java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:11:40,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:11:40,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:11:41,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:11:41,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:11:41,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:11:41,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:11:41,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:11:41,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:11:41,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:11:41,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:11:41,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:11:41,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:11:41,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:11:41,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:11:41,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:11:41,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:11:41,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:11:41,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:11:41,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:11:41,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:11:41,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:11:41,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:11:41,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:11:41,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:11:41,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:11:41,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:11:41,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:11:41,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:11:41,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:11:41,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:11:41,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:11:41,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:11:41,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:11:41,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:11:41,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:11:41,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:11:41,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:11:41,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:11:41,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:11:41,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:11:41,055 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 07:11:41,083 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:11:41,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:11:41,084 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:11:41,084 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:11:41,085 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:11:41,085 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:11:41,085 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:11:41,086 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:11:41,086 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:11:41,086 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:11:41,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:11:41,088 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:11:41,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:11:41,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:11:41,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:11:41,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:11:41,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:11:41,090 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:11:41,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:11:41,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:11:41,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:11:41,091 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:11:41,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:11:41,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:11:41,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:11:41,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:11:41,092 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:11:41,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:11:41,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:11:41,093 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:11:41,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:11:41,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:11:41,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:11:41,150 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:11:41,152 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:11:41,153 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-10 07:11:41,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6da9b4ef4/6ac9de498bdf43c6aa01e97e7e52d917/FLAG0b2f5691b [2019-09-10 07:11:42,275 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:11:42,276 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-10 07:11:42,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6da9b4ef4/6ac9de498bdf43c6aa01e97e7e52d917/FLAG0b2f5691b [2019-09-10 07:11:42,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6da9b4ef4/6ac9de498bdf43c6aa01e97e7e52d917 [2019-09-10 07:11:42,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:11:42,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:11:42,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:11:42,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:11:42,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:11:42,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:11:42" (1/1) ... [2019-09-10 07:11:42,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ffd4eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:42, skipping insertion in model container [2019-09-10 07:11:42,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:11:42" (1/1) ... [2019-09-10 07:11:42,550 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:11:42,946 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:11:45,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:11:45,812 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:11:47,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:11:47,722 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:11:47,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:47 WrapperNode [2019-09-10 07:11:47,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:11:47,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:11:47,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:11:47,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:11:47,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:47" (1/1) ... [2019-09-10 07:11:47,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:47" (1/1) ... [2019-09-10 07:11:47,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:47" (1/1) ... [2019-09-10 07:11:47,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:47" (1/1) ... [2019-09-10 07:11:48,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:47" (1/1) ... [2019-09-10 07:11:48,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:47" (1/1) ... [2019-09-10 07:11:48,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:47" (1/1) ... [2019-09-10 07:11:48,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:11:48,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:11:48,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:11:48,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:11:48,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:47" (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 07:11:48,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:11:48,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:11:48,416 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:11:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:11:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:11:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:11:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:11:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:11:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:11:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:11:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:11:48,420 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:11:48,420 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:11:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:11:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:11:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:11:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:11:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:11:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:11:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:12:03,608 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:12:03,609 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:12:03,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:12:03 BoogieIcfgContainer [2019-09-10 07:12:03,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:12:03,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:12:03,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:12:03,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:12:03,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:11:42" (1/3) ... [2019-09-10 07:12:03,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d4ec38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:12:03, skipping insertion in model container [2019-09-10 07:12:03,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:11:47" (2/3) ... [2019-09-10 07:12:03,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d4ec38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:12:03, skipping insertion in model container [2019-09-10 07:12:03,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:12:03" (3/3) ... [2019-09-10 07:12:03,628 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+sep-reducer.c [2019-09-10 07:12:03,638 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:12:03,660 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-09-10 07:12:03,677 INFO L252 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-09-10 07:12:03,710 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:12:03,710 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:12:03,710 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:12:03,711 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:12:03,711 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:12:03,711 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:12:03,711 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:12:03,711 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:12:03,823 INFO L276 IsEmpty]: Start isEmpty. Operand 6351 states. [2019-09-10 07:12:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:12:03,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:03,891 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] [2019-09-10 07:12:03,893 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:03,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:03,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1809486584, now seen corresponding path program 1 times [2019-09-10 07:12:03,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:03,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:03,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:03,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:03,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:05,109 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 07:12:05,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:05,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:12:05,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:05,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:12:05,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:12:05,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:12:05,137 INFO L87 Difference]: Start difference. First operand 6351 states. Second operand 5 states. [2019-09-10 07:12:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:13,004 INFO L93 Difference]: Finished difference Result 6000 states and 10363 transitions. [2019-09-10 07:12:13,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:12:13,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 07:12:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:13,078 INFO L225 Difference]: With dead ends: 6000 [2019-09-10 07:12:13,078 INFO L226 Difference]: Without dead ends: 5988 [2019-09-10 07:12:13,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:12:13,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2019-09-10 07:12:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 5955. [2019-09-10 07:12:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5955 states. [2019-09-10 07:12:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5955 states to 5955 states and 7689 transitions. [2019-09-10 07:12:13,341 INFO L78 Accepts]: Start accepts. Automaton has 5955 states and 7689 transitions. Word has length 82 [2019-09-10 07:12:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:13,342 INFO L475 AbstractCegarLoop]: Abstraction has 5955 states and 7689 transitions. [2019-09-10 07:12:13,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:12:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 5955 states and 7689 transitions. [2019-09-10 07:12:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:12:13,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:13,365 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] [2019-09-10 07:12:13,365 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:13,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:13,366 INFO L82 PathProgramCache]: Analyzing trace with hash 806830495, now seen corresponding path program 1 times [2019-09-10 07:12:13,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:13,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:13,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:13,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:13,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:13,703 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 07:12:13,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:13,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:12:13,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:13,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:12:13,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:12:13,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:12:13,711 INFO L87 Difference]: Start difference. First operand 5955 states and 7689 transitions. Second operand 5 states. [2019-09-10 07:12:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:20,586 INFO L93 Difference]: Finished difference Result 7982 states and 10329 transitions. [2019-09-10 07:12:20,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:12:20,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-10 07:12:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:20,628 INFO L225 Difference]: With dead ends: 7982 [2019-09-10 07:12:20,628 INFO L226 Difference]: Without dead ends: 7982 [2019-09-10 07:12:20,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:12:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7982 states. [2019-09-10 07:12:20,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7982 to 7958. [2019-09-10 07:12:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7958 states. [2019-09-10 07:12:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7958 states to 7958 states and 10316 transitions. [2019-09-10 07:12:20,806 INFO L78 Accepts]: Start accepts. Automaton has 7958 states and 10316 transitions. Word has length 83 [2019-09-10 07:12:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:20,807 INFO L475 AbstractCegarLoop]: Abstraction has 7958 states and 10316 transitions. [2019-09-10 07:12:20,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:12:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 7958 states and 10316 transitions. [2019-09-10 07:12:20,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:12:20,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:20,827 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] [2019-09-10 07:12:20,828 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:20,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:20,828 INFO L82 PathProgramCache]: Analyzing trace with hash 116069294, now seen corresponding path program 1 times [2019-09-10 07:12:20,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:20,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:20,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:20,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:20,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:21,358 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 07:12:21,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:21,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:12:21,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:21,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:12:21,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:12:21,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:12:21,361 INFO L87 Difference]: Start difference. First operand 7958 states and 10316 transitions. Second operand 9 states. [2019-09-10 07:12:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:34,750 INFO L93 Difference]: Finished difference Result 8734 states and 11334 transitions. [2019-09-10 07:12:34,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:12:34,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 07:12:34,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:34,786 INFO L225 Difference]: With dead ends: 8734 [2019-09-10 07:12:34,786 INFO L226 Difference]: Without dead ends: 8734 [2019-09-10 07:12:34,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:12:34,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8734 states. [2019-09-10 07:12:35,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8734 to 7958. [2019-09-10 07:12:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7958 states. [2019-09-10 07:12:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7958 states to 7958 states and 10315 transitions. [2019-09-10 07:12:35,106 INFO L78 Accepts]: Start accepts. Automaton has 7958 states and 10315 transitions. Word has length 84 [2019-09-10 07:12:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:35,109 INFO L475 AbstractCegarLoop]: Abstraction has 7958 states and 10315 transitions. [2019-09-10 07:12:35,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:12:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7958 states and 10315 transitions. [2019-09-10 07:12:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:12:35,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:35,128 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] [2019-09-10 07:12:35,130 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:35,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1112489822, now seen corresponding path program 1 times [2019-09-10 07:12:35,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:35,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:35,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:35,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:35,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:35,460 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 07:12:35,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:35,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:12:35,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:35,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:12:35,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:12:35,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:12:35,462 INFO L87 Difference]: Start difference. First operand 7958 states and 10315 transitions. Second operand 5 states. [2019-09-10 07:12:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:41,615 INFO L93 Difference]: Finished difference Result 9921 states and 12619 transitions. [2019-09-10 07:12:41,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:12:41,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-10 07:12:41,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:41,650 INFO L225 Difference]: With dead ends: 9921 [2019-09-10 07:12:41,650 INFO L226 Difference]: Without dead ends: 9921 [2019-09-10 07:12:41,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:12:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9921 states. [2019-09-10 07:12:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9921 to 9893. [2019-09-10 07:12:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9893 states. [2019-09-10 07:12:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9893 states to 9893 states and 12601 transitions. [2019-09-10 07:12:41,802 INFO L78 Accepts]: Start accepts. Automaton has 9893 states and 12601 transitions. Word has length 84 [2019-09-10 07:12:41,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:41,802 INFO L475 AbstractCegarLoop]: Abstraction has 9893 states and 12601 transitions. [2019-09-10 07:12:41,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:12:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 9893 states and 12601 transitions. [2019-09-10 07:12:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:12:41,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:41,820 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] [2019-09-10 07:12:41,821 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:41,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:41,821 INFO L82 PathProgramCache]: Analyzing trace with hash 480483016, now seen corresponding path program 1 times [2019-09-10 07:12:41,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:41,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:41,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:41,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:41,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:42,125 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 07:12:42,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:42,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:12:42,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:42,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:12:42,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:12:42,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:12:42,128 INFO L87 Difference]: Start difference. First operand 9893 states and 12601 transitions. Second operand 5 states. [2019-09-10 07:12:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:46,914 INFO L93 Difference]: Finished difference Result 11736 states and 15032 transitions. [2019-09-10 07:12:46,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:12:46,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-10 07:12:46,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:46,938 INFO L225 Difference]: With dead ends: 11736 [2019-09-10 07:12:46,938 INFO L226 Difference]: Without dead ends: 11736 [2019-09-10 07:12:46,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:12:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11736 states. [2019-09-10 07:12:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11736 to 11705. [2019-09-10 07:12:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11705 states. [2019-09-10 07:12:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11705 states to 11705 states and 15011 transitions. [2019-09-10 07:12:47,113 INFO L78 Accepts]: Start accepts. Automaton has 11705 states and 15011 transitions. Word has length 84 [2019-09-10 07:12:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:47,114 INFO L475 AbstractCegarLoop]: Abstraction has 11705 states and 15011 transitions. [2019-09-10 07:12:47,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:12:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 11705 states and 15011 transitions. [2019-09-10 07:12:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:12:47,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:47,130 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] [2019-09-10 07:12:47,130 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:47,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:47,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2076071052, now seen corresponding path program 1 times [2019-09-10 07:12:47,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:47,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:47,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:47,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:47,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:47,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:47,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:12:47,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:47,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:12:47,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:12:47,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:12:47,869 INFO L87 Difference]: Start difference. First operand 11705 states and 15011 transitions. Second operand 12 states. [2019-09-10 07:12:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:55,114 INFO L93 Difference]: Finished difference Result 48083 states and 68356 transitions. [2019-09-10 07:12:55,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:12:55,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2019-09-10 07:12:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:55,207 INFO L225 Difference]: With dead ends: 48083 [2019-09-10 07:12:55,207 INFO L226 Difference]: Without dead ends: 48083 [2019-09-10 07:12:55,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:12:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48083 states. [2019-09-10 07:12:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48083 to 11596. [2019-09-10 07:12:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11596 states. [2019-09-10 07:12:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11596 states to 11596 states and 14868 transitions. [2019-09-10 07:12:55,730 INFO L78 Accepts]: Start accepts. Automaton has 11596 states and 14868 transitions. Word has length 85 [2019-09-10 07:12:55,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:55,731 INFO L475 AbstractCegarLoop]: Abstraction has 11596 states and 14868 transitions. [2019-09-10 07:12:55,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:12:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 11596 states and 14868 transitions. [2019-09-10 07:12:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:12:55,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:55,751 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:12:55,752 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:55,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:55,761 INFO L82 PathProgramCache]: Analyzing trace with hash -531745965, now seen corresponding path program 1 times [2019-09-10 07:12:55,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:55,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:55,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:55,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:55,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:56,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:56,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:12:56,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:56,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:12:56,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:12:56,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:12:56,043 INFO L87 Difference]: Start difference. First operand 11596 states and 14868 transitions. Second operand 6 states. [2019-09-10 07:13:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:01,044 INFO L93 Difference]: Finished difference Result 19819 states and 25720 transitions. [2019-09-10 07:13:01,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:01,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-09-10 07:13:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:01,084 INFO L225 Difference]: With dead ends: 19819 [2019-09-10 07:13:01,084 INFO L226 Difference]: Without dead ends: 19819 [2019-09-10 07:13:01,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:13:01,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19819 states. [2019-09-10 07:13:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19819 to 19787. [2019-09-10 07:13:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19787 states. [2019-09-10 07:13:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19787 states to 19787 states and 25702 transitions. [2019-09-10 07:13:01,436 INFO L78 Accepts]: Start accepts. Automaton has 19787 states and 25702 transitions. Word has length 85 [2019-09-10 07:13:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:01,436 INFO L475 AbstractCegarLoop]: Abstraction has 19787 states and 25702 transitions. [2019-09-10 07:13:01,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:13:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 19787 states and 25702 transitions. [2019-09-10 07:13:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:13:01,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:01,451 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] [2019-09-10 07:13:01,451 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:01,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:01,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1305748461, now seen corresponding path program 1 times [2019-09-10 07:13:01,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:01,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:01,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:01,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:01,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:01,899 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 07:13:01,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:01,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:13:01,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:01,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:13:01,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:13:01,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:13:01,901 INFO L87 Difference]: Start difference. First operand 19787 states and 25702 transitions. Second operand 10 states. [2019-09-10 07:13:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:15,885 INFO L93 Difference]: Finished difference Result 54429 states and 76282 transitions. [2019-09-10 07:13:15,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:13:15,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2019-09-10 07:13:15,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:15,953 INFO L225 Difference]: With dead ends: 54429 [2019-09-10 07:13:15,953 INFO L226 Difference]: Without dead ends: 54429 [2019-09-10 07:13:15,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:13:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54429 states. [2019-09-10 07:13:16,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54429 to 19794. [2019-09-10 07:13:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19794 states. [2019-09-10 07:13:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19794 states to 19794 states and 25709 transitions. [2019-09-10 07:13:16,596 INFO L78 Accepts]: Start accepts. Automaton has 19794 states and 25709 transitions. Word has length 85 [2019-09-10 07:13:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:16,596 INFO L475 AbstractCegarLoop]: Abstraction has 19794 states and 25709 transitions. [2019-09-10 07:13:16,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:13:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 19794 states and 25709 transitions. [2019-09-10 07:13:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:13:16,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:16,611 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] [2019-09-10 07:13:16,611 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:16,612 INFO L82 PathProgramCache]: Analyzing trace with hash 535565163, now seen corresponding path program 1 times [2019-09-10 07:13:16,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:16,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:16,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:16,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:16,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:16,823 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 07:13:16,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:16,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:16,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:16,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:16,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:16,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:16,824 INFO L87 Difference]: Start difference. First operand 19794 states and 25709 transitions. Second operand 3 states. [2019-09-10 07:13:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:17,474 INFO L93 Difference]: Finished difference Result 24581 states and 31863 transitions. [2019-09-10 07:13:17,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:17,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:13:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:17,500 INFO L225 Difference]: With dead ends: 24581 [2019-09-10 07:13:17,500 INFO L226 Difference]: Without dead ends: 24581 [2019-09-10 07:13:17,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24581 states. [2019-09-10 07:13:17,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24581 to 24552. [2019-09-10 07:13:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24552 states. [2019-09-10 07:13:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24552 states to 24552 states and 31844 transitions. [2019-09-10 07:13:17,858 INFO L78 Accepts]: Start accepts. Automaton has 24552 states and 31844 transitions. Word has length 86 [2019-09-10 07:13:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:17,858 INFO L475 AbstractCegarLoop]: Abstraction has 24552 states and 31844 transitions. [2019-09-10 07:13:17,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 24552 states and 31844 transitions. [2019-09-10 07:13:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:13:17,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:17,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:17,871 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1761080908, now seen corresponding path program 1 times [2019-09-10 07:13:17,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:17,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:17,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:18,814 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 07:13:18,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:18,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:13:18,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:18,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:13:18,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:13:18,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:13:18,815 INFO L87 Difference]: Start difference. First operand 24552 states and 31844 transitions. Second operand 13 states. [2019-09-10 07:13:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:23,382 INFO L93 Difference]: Finished difference Result 76000 states and 110124 transitions. [2019-09-10 07:13:23,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:13:23,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-09-10 07:13:23,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:23,466 INFO L225 Difference]: With dead ends: 76000 [2019-09-10 07:13:23,467 INFO L226 Difference]: Without dead ends: 76000 [2019-09-10 07:13:23,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:13:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76000 states. [2019-09-10 07:13:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76000 to 23647. [2019-09-10 07:13:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23647 states. [2019-09-10 07:13:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23647 states to 23647 states and 31555 transitions. [2019-09-10 07:13:23,988 INFO L78 Accepts]: Start accepts. Automaton has 23647 states and 31555 transitions. Word has length 86 [2019-09-10 07:13:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:23,989 INFO L475 AbstractCegarLoop]: Abstraction has 23647 states and 31555 transitions. [2019-09-10 07:13:23,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:13:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 23647 states and 31555 transitions. [2019-09-10 07:13:23,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:13:23,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:23,996 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] [2019-09-10 07:13:23,996 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:23,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:23,996 INFO L82 PathProgramCache]: Analyzing trace with hash 14480584, now seen corresponding path program 1 times [2019-09-10 07:13:23,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:23,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:23,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:23,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:23,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:24,373 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 07:13:24,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:24,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:13:24,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:24,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:13:24,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:13:24,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:13:24,375 INFO L87 Difference]: Start difference. First operand 23647 states and 31555 transitions. Second operand 10 states. [2019-09-10 07:13:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:34,761 INFO L93 Difference]: Finished difference Result 79801 states and 114329 transitions. [2019-09-10 07:13:34,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:13:34,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-10 07:13:34,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:34,849 INFO L225 Difference]: With dead ends: 79801 [2019-09-10 07:13:34,849 INFO L226 Difference]: Without dead ends: 79801 [2019-09-10 07:13:34,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:13:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79801 states. [2019-09-10 07:13:35,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79801 to 23617. [2019-09-10 07:13:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23617 states. [2019-09-10 07:13:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23617 states to 23617 states and 31520 transitions. [2019-09-10 07:13:35,599 INFO L78 Accepts]: Start accepts. Automaton has 23617 states and 31520 transitions. Word has length 87 [2019-09-10 07:13:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:35,599 INFO L475 AbstractCegarLoop]: Abstraction has 23617 states and 31520 transitions. [2019-09-10 07:13:35,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:13:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 23617 states and 31520 transitions. [2019-09-10 07:13:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:13:35,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:35,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:35,606 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:35,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash -415911719, now seen corresponding path program 1 times [2019-09-10 07:13:35,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:35,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:35,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:35,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:35,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:35,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:13:35,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:35,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:13:35,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:13:35,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:13:35,998 INFO L87 Difference]: Start difference. First operand 23617 states and 31520 transitions. Second operand 9 states. [2019-09-10 07:13:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:43,107 INFO L93 Difference]: Finished difference Result 42582 states and 58747 transitions. [2019-09-10 07:13:43,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:13:43,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:13:43,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:43,148 INFO L225 Difference]: With dead ends: 42582 [2019-09-10 07:13:43,148 INFO L226 Difference]: Without dead ends: 42582 [2019-09-10 07:13:43,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:13:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42582 states. [2019-09-10 07:13:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42582 to 23617. [2019-09-10 07:13:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23617 states. [2019-09-10 07:13:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23617 states to 23617 states and 31519 transitions. [2019-09-10 07:13:43,584 INFO L78 Accepts]: Start accepts. Automaton has 23617 states and 31519 transitions. Word has length 87 [2019-09-10 07:13:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:43,585 INFO L475 AbstractCegarLoop]: Abstraction has 23617 states and 31519 transitions. [2019-09-10 07:13:43,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:13:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23617 states and 31519 transitions. [2019-09-10 07:13:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:13:43,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:43,592 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] [2019-09-10 07:13:43,592 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:43,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:43,593 INFO L82 PathProgramCache]: Analyzing trace with hash 134643284, now seen corresponding path program 1 times [2019-09-10 07:13:43,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:43,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:43,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:43,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:43,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:43,964 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 07:13:43,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:43,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:13:43,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:43,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:13:43,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:13:43,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:13:43,966 INFO L87 Difference]: Start difference. First operand 23617 states and 31519 transitions. Second operand 10 states. [2019-09-10 07:13:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:52,891 INFO L93 Difference]: Finished difference Result 54848 states and 78125 transitions. [2019-09-10 07:13:52,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:13:52,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:13:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:52,938 INFO L225 Difference]: With dead ends: 54848 [2019-09-10 07:13:52,939 INFO L226 Difference]: Without dead ends: 54848 [2019-09-10 07:13:52,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:13:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54848 states. [2019-09-10 07:13:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54848 to 23218. [2019-09-10 07:13:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23218 states. [2019-09-10 07:13:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23218 states to 23218 states and 31044 transitions. [2019-09-10 07:13:53,270 INFO L78 Accepts]: Start accepts. Automaton has 23218 states and 31044 transitions. Word has length 88 [2019-09-10 07:13:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:53,270 INFO L475 AbstractCegarLoop]: Abstraction has 23218 states and 31044 transitions. [2019-09-10 07:13:53,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:13:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 23218 states and 31044 transitions. [2019-09-10 07:13:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:13:53,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:53,278 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] [2019-09-10 07:13:53,278 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:53,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:53,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1646972436, now seen corresponding path program 1 times [2019-09-10 07:13:53,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:53,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:53,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:53,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:53,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:54,100 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-09-10 07:13:54,247 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-10 07:13:54,636 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-09-10 07:13:55,225 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 07:13:55,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:55,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:13:55,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:55,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:13:55,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:13:55,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:13:55,227 INFO L87 Difference]: Start difference. First operand 23218 states and 31044 transitions. Second operand 19 states. [2019-09-10 07:13:55,425 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 07:13:56,057 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:13:56,227 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-10 07:13:56,540 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 07:13:56,909 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:13:57,840 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-10 07:13:58,296 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2019-09-10 07:13:58,638 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 07:13:59,061 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 07:13:59,480 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-10 07:13:59,955 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-09-10 07:14:01,976 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-10 07:14:02,792 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 07:14:03,262 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 07:14:07,758 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:14:07,911 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:14:08,486 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 07:14:08,858 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-10 07:14:09,998 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 07:14:10,271 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:14:10,663 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:14:10,904 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:14:11,231 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 07:14:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:11,848 INFO L93 Difference]: Finished difference Result 89367 states and 129956 transitions. [2019-09-10 07:14:11,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 07:14:11,849 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 88 [2019-09-10 07:14:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:11,933 INFO L225 Difference]: With dead ends: 89367 [2019-09-10 07:14:11,933 INFO L226 Difference]: Without dead ends: 89367 [2019-09-10 07:14:11,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=543, Invalid=1809, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:14:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89367 states. [2019-09-10 07:14:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89367 to 23214. [2019-09-10 07:14:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23214 states. [2019-09-10 07:14:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23214 states to 23214 states and 31040 transitions. [2019-09-10 07:14:12,611 INFO L78 Accepts]: Start accepts. Automaton has 23214 states and 31040 transitions. Word has length 88 [2019-09-10 07:14:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:12,612 INFO L475 AbstractCegarLoop]: Abstraction has 23214 states and 31040 transitions. [2019-09-10 07:14:12,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:14:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 23214 states and 31040 transitions. [2019-09-10 07:14:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:14:12,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:12,620 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] [2019-09-10 07:14:12,620 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:12,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:12,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2058209277, now seen corresponding path program 1 times [2019-09-10 07:14:12,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:12,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:12,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:12,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:12,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:13,238 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 07:14:13,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:13,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:14:13,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:13,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:14:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:14:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:14:13,240 INFO L87 Difference]: Start difference. First operand 23214 states and 31040 transitions. Second operand 13 states. [2019-09-10 07:14:13,783 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-10 07:14:13,937 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:14:14,121 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:14:14,545 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:14:14,963 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-10 07:14:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:17,676 INFO L93 Difference]: Finished difference Result 78096 states and 112452 transitions. [2019-09-10 07:14:17,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:14:17,676 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2019-09-10 07:14:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:17,756 INFO L225 Difference]: With dead ends: 78096 [2019-09-10 07:14:17,756 INFO L226 Difference]: Without dead ends: 78096 [2019-09-10 07:14:17,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:14:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78096 states. [2019-09-10 07:14:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78096 to 23150. [2019-09-10 07:14:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-09-10 07:14:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 30970 transitions. [2019-09-10 07:14:18,190 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 30970 transitions. Word has length 88 [2019-09-10 07:14:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:18,191 INFO L475 AbstractCegarLoop]: Abstraction has 23150 states and 30970 transitions. [2019-09-10 07:14:18,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:14:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 30970 transitions. [2019-09-10 07:14:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:18,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:18,201 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] [2019-09-10 07:14:18,201 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:18,202 INFO L82 PathProgramCache]: Analyzing trace with hash 250696717, now seen corresponding path program 1 times [2019-09-10 07:14:18,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:18,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:18,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:18,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:18,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:18,501 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 07:14:18,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:18,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:14:18,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:18,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:14:18,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:14:18,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:14:18,506 INFO L87 Difference]: Start difference. First operand 23150 states and 30970 transitions. Second operand 9 states. [2019-09-10 07:14:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:24,957 INFO L93 Difference]: Finished difference Result 41203 states and 57686 transitions. [2019-09-10 07:14:24,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:14:24,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:14:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:25,007 INFO L225 Difference]: With dead ends: 41203 [2019-09-10 07:14:25,007 INFO L226 Difference]: Without dead ends: 41203 [2019-09-10 07:14:25,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:14:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41203 states. [2019-09-10 07:14:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41203 to 23150. [2019-09-10 07:14:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-09-10 07:14:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 30969 transitions. [2019-09-10 07:14:25,375 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 30969 transitions. Word has length 89 [2019-09-10 07:14:25,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:25,375 INFO L475 AbstractCegarLoop]: Abstraction has 23150 states and 30969 transitions. [2019-09-10 07:14:25,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:14:25,375 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 30969 transitions. [2019-09-10 07:14:25,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:25,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:25,386 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] [2019-09-10 07:14:25,386 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:25,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:25,387 INFO L82 PathProgramCache]: Analyzing trace with hash -736885635, now seen corresponding path program 1 times [2019-09-10 07:14:25,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:25,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:25,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:25,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:25,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:25,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:25,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:14:25,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:25,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:14:25,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:14:25,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:14:25,703 INFO L87 Difference]: Start difference. First operand 23150 states and 30969 transitions. Second operand 9 states. [2019-09-10 07:14:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:33,389 INFO L93 Difference]: Finished difference Result 68523 states and 97530 transitions. [2019-09-10 07:14:33,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:14:33,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:14:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:33,450 INFO L225 Difference]: With dead ends: 68523 [2019-09-10 07:14:33,450 INFO L226 Difference]: Without dead ends: 68523 [2019-09-10 07:14:33,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:14:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68523 states. [2019-09-10 07:14:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68523 to 23150. [2019-09-10 07:14:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-09-10 07:14:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 30968 transitions. [2019-09-10 07:14:33,855 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 30968 transitions. Word has length 89 [2019-09-10 07:14:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:33,856 INFO L475 AbstractCegarLoop]: Abstraction has 23150 states and 30968 transitions. [2019-09-10 07:14:33,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:14:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 30968 transitions. [2019-09-10 07:14:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:33,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:33,865 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] [2019-09-10 07:14:33,866 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:33,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:33,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1720334733, now seen corresponding path program 1 times [2019-09-10 07:14:33,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:33,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:33,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:33,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:33,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:34,142 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 07:14:34,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:34,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:14:34,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:34,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:14:34,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:14:34,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:14:34,144 INFO L87 Difference]: Start difference. First operand 23150 states and 30968 transitions. Second operand 9 states. [2019-09-10 07:14:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:42,660 INFO L93 Difference]: Finished difference Result 82028 states and 118960 transitions. [2019-09-10 07:14:42,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:14:42,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:14:42,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:42,739 INFO L225 Difference]: With dead ends: 82028 [2019-09-10 07:14:42,739 INFO L226 Difference]: Without dead ends: 82028 [2019-09-10 07:14:42,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:14:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82028 states. [2019-09-10 07:14:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82028 to 23150. [2019-09-10 07:14:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-09-10 07:14:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 30967 transitions. [2019-09-10 07:14:43,196 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 30967 transitions. Word has length 89 [2019-09-10 07:14:43,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:43,197 INFO L475 AbstractCegarLoop]: Abstraction has 23150 states and 30967 transitions. [2019-09-10 07:14:43,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:14:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 30967 transitions. [2019-09-10 07:14:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:43,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:43,205 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] [2019-09-10 07:14:43,205 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:43,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:43,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1295666299, now seen corresponding path program 1 times [2019-09-10 07:14:43,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:43,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:43,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:43,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:43,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:43,507 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 07:14:43,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:43,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:14:43,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:43,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:14:43,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:14:43,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:14:43,510 INFO L87 Difference]: Start difference. First operand 23150 states and 30967 transitions. Second operand 9 states. [2019-09-10 07:14:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:50,745 INFO L93 Difference]: Finished difference Result 44034 states and 61905 transitions. [2019-09-10 07:14:50,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:14:50,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:14:50,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:50,789 INFO L225 Difference]: With dead ends: 44034 [2019-09-10 07:14:50,789 INFO L226 Difference]: Without dead ends: 44034 [2019-09-10 07:14:50,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:14:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44034 states. [2019-09-10 07:14:51,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44034 to 23150. [2019-09-10 07:14:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-09-10 07:14:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 30966 transitions. [2019-09-10 07:14:51,097 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 30966 transitions. Word has length 89 [2019-09-10 07:14:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:51,097 INFO L475 AbstractCegarLoop]: Abstraction has 23150 states and 30966 transitions. [2019-09-10 07:14:51,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:14:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 30966 transitions. [2019-09-10 07:14:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:51,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:51,106 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] [2019-09-10 07:14:51,107 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:51,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:51,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1217226200, now seen corresponding path program 1 times [2019-09-10 07:14:51,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:51,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:51,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:51,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:51,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:51,477 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 07:14:51,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:51,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:14:51,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:51,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:14:51,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:14:51,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:14:51,479 INFO L87 Difference]: Start difference. First operand 23150 states and 30966 transitions. Second operand 10 states. [2019-09-10 07:15:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:01,824 INFO L93 Difference]: Finished difference Result 79328 states and 113771 transitions. [2019-09-10 07:15:01,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:15:01,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-10 07:15:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:01,900 INFO L225 Difference]: With dead ends: 79328 [2019-09-10 07:15:01,900 INFO L226 Difference]: Without dead ends: 79328 [2019-09-10 07:15:01,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:15:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79328 states. [2019-09-10 07:15:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79328 to 23150. [2019-09-10 07:15:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-09-10 07:15:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 30965 transitions. [2019-09-10 07:15:02,357 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 30965 transitions. Word has length 89 [2019-09-10 07:15:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:02,357 INFO L475 AbstractCegarLoop]: Abstraction has 23150 states and 30965 transitions. [2019-09-10 07:15:02,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:15:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 30965 transitions. [2019-09-10 07:15:02,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:02,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:02,366 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] [2019-09-10 07:15:02,366 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:02,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:02,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1849091349, now seen corresponding path program 1 times [2019-09-10 07:15:02,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:02,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:02,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:02,545 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 07:15:02,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:02,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:02,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:02,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:02,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:02,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:02,547 INFO L87 Difference]: Start difference. First operand 23150 states and 30965 transitions. Second operand 3 states. [2019-09-10 07:15:02,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:02,790 INFO L93 Difference]: Finished difference Result 27871 states and 38142 transitions. [2019-09-10 07:15:02,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:02,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:15:02,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:02,813 INFO L225 Difference]: With dead ends: 27871 [2019-09-10 07:15:02,813 INFO L226 Difference]: Without dead ends: 27871 [2019-09-10 07:15:02,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27871 states. [2019-09-10 07:15:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27871 to 23032. [2019-09-10 07:15:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23032 states. [2019-09-10 07:15:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23032 states to 23032 states and 31569 transitions. [2019-09-10 07:15:03,006 INFO L78 Accepts]: Start accepts. Automaton has 23032 states and 31569 transitions. Word has length 90 [2019-09-10 07:15:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:03,007 INFO L475 AbstractCegarLoop]: Abstraction has 23032 states and 31569 transitions. [2019-09-10 07:15:03,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 23032 states and 31569 transitions. [2019-09-10 07:15:03,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:03,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:03,015 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] [2019-09-10 07:15:03,015 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:03,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:03,015 INFO L82 PathProgramCache]: Analyzing trace with hash -172421632, now seen corresponding path program 1 times [2019-09-10 07:15:03,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:03,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:03,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:03,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:03,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:03,185 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 07:15:03,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:03,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:03,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:03,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:03,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:03,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:03,187 INFO L87 Difference]: Start difference. First operand 23032 states and 31569 transitions. Second operand 3 states. [2019-09-10 07:15:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:03,372 INFO L93 Difference]: Finished difference Result 33575 states and 47230 transitions. [2019-09-10 07:15:03,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:03,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:15:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:03,405 INFO L225 Difference]: With dead ends: 33575 [2019-09-10 07:15:03,405 INFO L226 Difference]: Without dead ends: 33575 [2019-09-10 07:15:03,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33575 states. [2019-09-10 07:15:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33575 to 28131. [2019-09-10 07:15:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28131 states. [2019-09-10 07:15:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28131 states to 28131 states and 39545 transitions. [2019-09-10 07:15:03,651 INFO L78 Accepts]: Start accepts. Automaton has 28131 states and 39545 transitions. Word has length 90 [2019-09-10 07:15:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:03,652 INFO L475 AbstractCegarLoop]: Abstraction has 28131 states and 39545 transitions. [2019-09-10 07:15:03,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 28131 states and 39545 transitions. [2019-09-10 07:15:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:03,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:03,658 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] [2019-09-10 07:15:03,659 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:03,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:03,659 INFO L82 PathProgramCache]: Analyzing trace with hash 10411893, now seen corresponding path program 1 times [2019-09-10 07:15:03,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:03,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:03,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:03,832 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 07:15:03,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:03,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:03,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:03,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:03,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:03,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:03,834 INFO L87 Difference]: Start difference. First operand 28131 states and 39545 transitions. Second operand 3 states. [2019-09-10 07:15:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:04,149 INFO L93 Difference]: Finished difference Result 48635 states and 68505 transitions. [2019-09-10 07:15:04,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:04,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:15:04,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:04,191 INFO L225 Difference]: With dead ends: 48635 [2019-09-10 07:15:04,191 INFO L226 Difference]: Without dead ends: 48635 [2019-09-10 07:15:04,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48635 states. [2019-09-10 07:15:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48635 to 48621. [2019-09-10 07:15:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48621 states. [2019-09-10 07:15:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48621 states to 48621 states and 68498 transitions. [2019-09-10 07:15:04,570 INFO L78 Accepts]: Start accepts. Automaton has 48621 states and 68498 transitions. Word has length 90 [2019-09-10 07:15:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:04,570 INFO L475 AbstractCegarLoop]: Abstraction has 48621 states and 68498 transitions. [2019-09-10 07:15:04,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 48621 states and 68498 transitions. [2019-09-10 07:15:04,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:04,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:04,579 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] [2019-09-10 07:15:04,580 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:04,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:04,580 INFO L82 PathProgramCache]: Analyzing trace with hash 905473228, now seen corresponding path program 1 times [2019-09-10 07:15:04,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:04,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:04,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:04,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:04,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:04,915 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 07:15:04,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:04,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:15:04,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:04,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:15:04,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:15:04,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:15:04,920 INFO L87 Difference]: Start difference. First operand 48621 states and 68498 transitions. Second operand 10 states. [2019-09-10 07:15:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:13,656 INFO L93 Difference]: Finished difference Result 112325 states and 160496 transitions. [2019-09-10 07:15:13,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:15:13,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-10 07:15:13,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:13,770 INFO L225 Difference]: With dead ends: 112325 [2019-09-10 07:15:13,770 INFO L226 Difference]: Without dead ends: 112325 [2019-09-10 07:15:13,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:15:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112325 states. [2019-09-10 07:15:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112325 to 48621. [2019-09-10 07:15:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48621 states. [2019-09-10 07:15:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48621 states to 48621 states and 68496 transitions. [2019-09-10 07:15:16,352 INFO L78 Accepts]: Start accepts. Automaton has 48621 states and 68496 transitions. Word has length 90 [2019-09-10 07:15:16,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:16,352 INFO L475 AbstractCegarLoop]: Abstraction has 48621 states and 68496 transitions. [2019-09-10 07:15:16,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:15:16,352 INFO L276 IsEmpty]: Start isEmpty. Operand 48621 states and 68496 transitions. [2019-09-10 07:15:16,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:16,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:16,364 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] [2019-09-10 07:15:16,365 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:16,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:16,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1584363060, now seen corresponding path program 1 times [2019-09-10 07:15:16,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:16,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:16,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:16,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:16,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:16,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:16,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:15:16,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:16,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:15:16,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:15:16,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:15:16,998 INFO L87 Difference]: Start difference. First operand 48621 states and 68496 transitions. Second operand 13 states. [2019-09-10 07:15:17,559 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-09-10 07:15:17,757 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-10 07:15:17,991 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 07:15:18,989 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2019-09-10 07:15:19,384 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-09-10 07:15:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:21,895 INFO L93 Difference]: Finished difference Result 156970 states and 225734 transitions. [2019-09-10 07:15:21,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:15:21,895 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2019-09-10 07:15:21,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:22,077 INFO L225 Difference]: With dead ends: 156970 [2019-09-10 07:15:22,077 INFO L226 Difference]: Without dead ends: 156970 [2019-09-10 07:15:22,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:15:22,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156970 states. [2019-09-10 07:15:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156970 to 48607. [2019-09-10 07:15:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48607 states. [2019-09-10 07:15:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48607 states to 48607 states and 68482 transitions. [2019-09-10 07:15:24,964 INFO L78 Accepts]: Start accepts. Automaton has 48607 states and 68482 transitions. Word has length 90 [2019-09-10 07:15:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:24,964 INFO L475 AbstractCegarLoop]: Abstraction has 48607 states and 68482 transitions. [2019-09-10 07:15:24,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:15:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 48607 states and 68482 transitions. [2019-09-10 07:15:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:24,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:24,973 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:24,973 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1472650956, now seen corresponding path program 1 times [2019-09-10 07:15:24,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:24,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:24,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:25,239 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 07:15:25,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:25,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:15:25,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:25,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:15:25,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:15:25,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:15:25,241 INFO L87 Difference]: Start difference. First operand 48607 states and 68482 transitions. Second operand 9 states. [2019-09-10 07:15:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:33,756 INFO L93 Difference]: Finished difference Result 131649 states and 188549 transitions. [2019-09-10 07:15:33,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:15:33,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-09-10 07:15:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:33,884 INFO L225 Difference]: With dead ends: 131649 [2019-09-10 07:15:33,884 INFO L226 Difference]: Without dead ends: 131649 [2019-09-10 07:15:33,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:15:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131649 states. [2019-09-10 07:15:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131649 to 48575. [2019-09-10 07:15:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48575 states. [2019-09-10 07:15:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48575 states to 48575 states and 68443 transitions. [2019-09-10 07:15:34,885 INFO L78 Accepts]: Start accepts. Automaton has 48575 states and 68443 transitions. Word has length 90 [2019-09-10 07:15:34,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:34,885 INFO L475 AbstractCegarLoop]: Abstraction has 48575 states and 68443 transitions. [2019-09-10 07:15:34,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:15:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 48575 states and 68443 transitions. [2019-09-10 07:15:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:34,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:34,894 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] [2019-09-10 07:15:34,894 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1635857145, now seen corresponding path program 1 times [2019-09-10 07:15:34,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:34,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:34,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:34,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:34,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:35,149 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 07:15:35,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:35,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:15:35,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:35,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:15:35,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:15:35,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:15:35,150 INFO L87 Difference]: Start difference. First operand 48575 states and 68443 transitions. Second operand 9 states. [2019-09-10 07:15:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:42,566 INFO L93 Difference]: Finished difference Result 112980 states and 161372 transitions. [2019-09-10 07:15:42,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:15:42,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-09-10 07:15:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:42,679 INFO L225 Difference]: With dead ends: 112980 [2019-09-10 07:15:42,680 INFO L226 Difference]: Without dead ends: 112980 [2019-09-10 07:15:42,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:15:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112980 states. [2019-09-10 07:15:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112980 to 48575. [2019-09-10 07:15:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48575 states. [2019-09-10 07:15:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48575 states to 48575 states and 68442 transitions. [2019-09-10 07:15:43,846 INFO L78 Accepts]: Start accepts. Automaton has 48575 states and 68442 transitions. Word has length 90 [2019-09-10 07:15:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:43,846 INFO L475 AbstractCegarLoop]: Abstraction has 48575 states and 68442 transitions. [2019-09-10 07:15:43,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:15:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 48575 states and 68442 transitions. [2019-09-10 07:15:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:43,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:43,856 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] [2019-09-10 07:15:43,856 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:43,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:43,857 INFO L82 PathProgramCache]: Analyzing trace with hash 808968133, now seen corresponding path program 1 times [2019-09-10 07:15:43,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:43,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:43,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:43,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:43,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:44,036 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 07:15:44,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:44,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:44,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:44,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:44,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:44,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:44,038 INFO L87 Difference]: Start difference. First operand 48575 states and 68442 transitions. Second operand 3 states. [2019-09-10 07:15:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:44,338 INFO L93 Difference]: Finished difference Result 85693 states and 120691 transitions. [2019-09-10 07:15:44,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:44,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 07:15:44,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:44,422 INFO L225 Difference]: With dead ends: 85693 [2019-09-10 07:15:44,422 INFO L226 Difference]: Without dead ends: 85693 [2019-09-10 07:15:44,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85693 states. [2019-09-10 07:15:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85693 to 73285. [2019-09-10 07:15:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73285 states. [2019-09-10 07:15:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73285 states to 73285 states and 102785 transitions. [2019-09-10 07:15:45,082 INFO L78 Accepts]: Start accepts. Automaton has 73285 states and 102785 transitions. Word has length 90 [2019-09-10 07:15:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:45,082 INFO L475 AbstractCegarLoop]: Abstraction has 73285 states and 102785 transitions. [2019-09-10 07:15:45,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 73285 states and 102785 transitions. [2019-09-10 07:15:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:15:45,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:45,094 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] [2019-09-10 07:15:45,094 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:45,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:45,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1020992873, now seen corresponding path program 1 times [2019-09-10 07:15:45,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:45,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:45,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:45,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:45,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:45,254 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 07:15:45,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:45,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:45,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:45,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:45,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:45,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:45,256 INFO L87 Difference]: Start difference. First operand 73285 states and 102785 transitions. Second operand 3 states. [2019-09-10 07:15:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:45,583 INFO L93 Difference]: Finished difference Result 84569 states and 119502 transitions. [2019-09-10 07:15:45,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:45,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 07:15:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:45,663 INFO L225 Difference]: With dead ends: 84569 [2019-09-10 07:15:45,663 INFO L226 Difference]: Without dead ends: 84569 [2019-09-10 07:15:45,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:45,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84569 states. [2019-09-10 07:15:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84569 to 67620. [2019-09-10 07:15:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67620 states. [2019-09-10 07:15:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67620 states to 67620 states and 95703 transitions. [2019-09-10 07:15:46,690 INFO L78 Accepts]: Start accepts. Automaton has 67620 states and 95703 transitions. Word has length 91 [2019-09-10 07:15:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:46,690 INFO L475 AbstractCegarLoop]: Abstraction has 67620 states and 95703 transitions. [2019-09-10 07:15:46,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 67620 states and 95703 transitions. [2019-09-10 07:15:46,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:15:46,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:46,699 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] [2019-09-10 07:15:46,699 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:46,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:46,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1699326230, now seen corresponding path program 1 times [2019-09-10 07:15:46,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:46,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:46,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:46,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:46,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:46,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:46,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:46,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:46,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:46,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:46,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:46,848 INFO L87 Difference]: Start difference. First operand 67620 states and 95703 transitions. Second operand 3 states. [2019-09-10 07:15:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:47,217 INFO L93 Difference]: Finished difference Result 120902 states and 170607 transitions. [2019-09-10 07:15:47,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:47,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 07:15:47,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:47,346 INFO L225 Difference]: With dead ends: 120902 [2019-09-10 07:15:47,346 INFO L226 Difference]: Without dead ends: 120902 [2019-09-10 07:15:47,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120902 states. [2019-09-10 07:15:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120902 to 120900. [2019-09-10 07:15:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120900 states. [2019-09-10 07:15:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120900 states to 120900 states and 170606 transitions. [2019-09-10 07:15:48,378 INFO L78 Accepts]: Start accepts. Automaton has 120900 states and 170606 transitions. Word has length 91 [2019-09-10 07:15:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:48,378 INFO L475 AbstractCegarLoop]: Abstraction has 120900 states and 170606 transitions. [2019-09-10 07:15:48,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 120900 states and 170606 transitions. [2019-09-10 07:15:48,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:15:48,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:48,385 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:48,386 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:48,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:48,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1965129879, now seen corresponding path program 1 times [2019-09-10 07:15:48,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:48,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:48,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:48,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:48,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:48,671 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 07:15:48,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:48,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:15:48,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:48,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:15:48,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:15:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:15:48,673 INFO L87 Difference]: Start difference. First operand 120900 states and 170606 transitions. Second operand 10 states. [2019-09-10 07:15:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:57,855 INFO L93 Difference]: Finished difference Result 245141 states and 344744 transitions. [2019-09-10 07:15:57,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:15:57,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-09-10 07:15:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:58,120 INFO L225 Difference]: With dead ends: 245141 [2019-09-10 07:15:58,120 INFO L226 Difference]: Without dead ends: 245141 [2019-09-10 07:15:58,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:15:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245141 states. [2019-09-10 07:16:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245141 to 120868. [2019-09-10 07:16:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120868 states. [2019-09-10 07:16:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120868 states to 120868 states and 170564 transitions. [2019-09-10 07:16:00,472 INFO L78 Accepts]: Start accepts. Automaton has 120868 states and 170564 transitions. Word has length 91 [2019-09-10 07:16:00,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:00,473 INFO L475 AbstractCegarLoop]: Abstraction has 120868 states and 170564 transitions. [2019-09-10 07:16:00,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:16:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 120868 states and 170564 transitions. [2019-09-10 07:16:00,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:16:00,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:00,480 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] [2019-09-10 07:16:00,480 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:00,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:00,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1059762761, now seen corresponding path program 1 times [2019-09-10 07:16:00,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:00,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:00,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:00,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:00,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:00,639 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 07:16:00,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:00,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:00,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:00,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:00,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:00,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:00,643 INFO L87 Difference]: Start difference. First operand 120868 states and 170564 transitions. Second operand 3 states. [2019-09-10 07:16:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:01,184 INFO L93 Difference]: Finished difference Result 208635 states and 295818 transitions. [2019-09-10 07:16:01,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:01,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 07:16:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:01,412 INFO L225 Difference]: With dead ends: 208635 [2019-09-10 07:16:01,412 INFO L226 Difference]: Without dead ends: 208635 [2019-09-10 07:16:01,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:01,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208635 states. [2019-09-10 07:16:06,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208635 to 161329. [2019-09-10 07:16:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161329 states. [2019-09-10 07:16:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161329 states to 161329 states and 228581 transitions. [2019-09-10 07:16:07,153 INFO L78 Accepts]: Start accepts. Automaton has 161329 states and 228581 transitions. Word has length 91 [2019-09-10 07:16:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:07,153 INFO L475 AbstractCegarLoop]: Abstraction has 161329 states and 228581 transitions. [2019-09-10 07:16:07,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 161329 states and 228581 transitions. [2019-09-10 07:16:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:16:07,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:07,159 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] [2019-09-10 07:16:07,159 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash 530111672, now seen corresponding path program 1 times [2019-09-10 07:16:07,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:07,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:07,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:07,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:07,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:07,462 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 07:16:07,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:07,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:16:07,462 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:07,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:16:07,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:16:07,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:16:07,463 INFO L87 Difference]: Start difference. First operand 161329 states and 228581 transitions. Second operand 10 states. [2019-09-10 07:16:16,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:16,535 INFO L93 Difference]: Finished difference Result 402540 states and 569023 transitions. [2019-09-10 07:16:16,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:16:16,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-09-10 07:16:16,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:17,007 INFO L225 Difference]: With dead ends: 402540 [2019-09-10 07:16:17,007 INFO L226 Difference]: Without dead ends: 402540 [2019-09-10 07:16:17,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:16:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402540 states. [2019-09-10 07:16:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402540 to 161329. [2019-09-10 07:16:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161329 states. [2019-09-10 07:16:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161329 states to 161329 states and 228580 transitions. [2019-09-10 07:16:20,205 INFO L78 Accepts]: Start accepts. Automaton has 161329 states and 228580 transitions. Word has length 91 [2019-09-10 07:16:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:20,206 INFO L475 AbstractCegarLoop]: Abstraction has 161329 states and 228580 transitions. [2019-09-10 07:16:20,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:16:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 161329 states and 228580 transitions. [2019-09-10 07:16:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:16:20,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:20,210 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] [2019-09-10 07:16:20,211 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:20,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:20,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1622563388, now seen corresponding path program 1 times [2019-09-10 07:16:20,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:20,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:20,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:20,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:20,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:20,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 07:16:20,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:20,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:16:20,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:20,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:16:20,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:16:20,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:16:20,512 INFO L87 Difference]: Start difference. First operand 161329 states and 228580 transitions. Second operand 9 states. [2019-09-10 07:16:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:28,458 INFO L93 Difference]: Finished difference Result 370803 states and 525778 transitions. [2019-09-10 07:16:28,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:16:28,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-10 07:16:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:28,864 INFO L225 Difference]: With dead ends: 370803 [2019-09-10 07:16:28,865 INFO L226 Difference]: Without dead ends: 370803 [2019-09-10 07:16:28,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:16:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370803 states. [2019-09-10 07:16:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370803 to 161311. [2019-09-10 07:16:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161311 states. [2019-09-10 07:16:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161311 states to 161311 states and 228554 transitions. [2019-09-10 07:16:33,229 INFO L78 Accepts]: Start accepts. Automaton has 161311 states and 228554 transitions. Word has length 91 [2019-09-10 07:16:33,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:33,230 INFO L475 AbstractCegarLoop]: Abstraction has 161311 states and 228554 transitions. [2019-09-10 07:16:33,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:16:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 161311 states and 228554 transitions. [2019-09-10 07:16:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:16:33,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:33,234 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] [2019-09-10 07:16:33,235 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:33,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:33,235 INFO L82 PathProgramCache]: Analyzing trace with hash -621590649, now seen corresponding path program 1 times [2019-09-10 07:16:33,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:33,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:33,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:33,579 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 07:16:33,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:33,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:16:33,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:33,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:16:33,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:16:33,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:16:33,582 INFO L87 Difference]: Start difference. First operand 161311 states and 228554 transitions. Second operand 10 states. [2019-09-10 07:16:47,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:47,241 INFO L93 Difference]: Finished difference Result 331358 states and 466929 transitions. [2019-09-10 07:16:47,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:16:47,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-09-10 07:16:47,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:47,635 INFO L225 Difference]: With dead ends: 331358 [2019-09-10 07:16:47,635 INFO L226 Difference]: Without dead ends: 331358 [2019-09-10 07:16:47,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:16:47,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331358 states. [2019-09-10 07:16:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331358 to 161311. [2019-09-10 07:16:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161311 states. [2019-09-10 07:16:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161311 states to 161311 states and 228553 transitions. [2019-09-10 07:16:50,798 INFO L78 Accepts]: Start accepts. Automaton has 161311 states and 228553 transitions. Word has length 91 [2019-09-10 07:16:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:50,798 INFO L475 AbstractCegarLoop]: Abstraction has 161311 states and 228553 transitions. [2019-09-10 07:16:50,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:16:50,798 INFO L276 IsEmpty]: Start isEmpty. Operand 161311 states and 228553 transitions. [2019-09-10 07:16:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:16:50,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:50,803 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] [2019-09-10 07:16:50,804 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:50,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:50,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1448713894, now seen corresponding path program 1 times [2019-09-10 07:16:50,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:50,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:50,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:50,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:50,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:51,596 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 07:16:51,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:51,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:16:51,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:51,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:16:51,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:16:51,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:16:51,598 INFO L87 Difference]: Start difference. First operand 161311 states and 228553 transitions. Second operand 13 states. [2019-09-10 07:16:57,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:57,186 INFO L93 Difference]: Finished difference Result 357184 states and 506610 transitions. [2019-09-10 07:16:57,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:16:57,186 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 92 [2019-09-10 07:16:57,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:57,597 INFO L225 Difference]: With dead ends: 357184 [2019-09-10 07:16:57,598 INFO L226 Difference]: Without dead ends: 357184 [2019-09-10 07:16:57,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:16:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357184 states. [2019-09-10 07:17:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357184 to 161307. [2019-09-10 07:17:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161307 states. [2019-09-10 07:17:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161307 states to 161307 states and 228548 transitions. [2019-09-10 07:17:04,148 INFO L78 Accepts]: Start accepts. Automaton has 161307 states and 228548 transitions. Word has length 92 [2019-09-10 07:17:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:04,149 INFO L475 AbstractCegarLoop]: Abstraction has 161307 states and 228548 transitions. [2019-09-10 07:17:04,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:17:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 161307 states and 228548 transitions. [2019-09-10 07:17:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:17:04,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:04,154 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] [2019-09-10 07:17:04,154 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash 294703003, now seen corresponding path program 1 times [2019-09-10 07:17:04,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:04,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:04,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:04,885 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 07:17:04,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:04,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:17:04,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:04,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:17:04,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:17:04,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:17:04,887 INFO L87 Difference]: Start difference. First operand 161307 states and 228548 transitions. Second operand 16 states. [2019-09-10 07:17:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:13,934 INFO L93 Difference]: Finished difference Result 387134 states and 549958 transitions. [2019-09-10 07:17:13,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:17:13,935 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2019-09-10 07:17:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:14,361 INFO L225 Difference]: With dead ends: 387134 [2019-09-10 07:17:14,361 INFO L226 Difference]: Without dead ends: 387134 [2019-09-10 07:17:14,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:17:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387134 states. [2019-09-10 07:17:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387134 to 161291. [2019-09-10 07:17:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161291 states. [2019-09-10 07:17:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161291 states to 161291 states and 228525 transitions. [2019-09-10 07:17:16,885 INFO L78 Accepts]: Start accepts. Automaton has 161291 states and 228525 transitions. Word has length 92 [2019-09-10 07:17:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:16,885 INFO L475 AbstractCegarLoop]: Abstraction has 161291 states and 228525 transitions. [2019-09-10 07:17:16,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:17:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 161291 states and 228525 transitions. [2019-09-10 07:17:16,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:17:16,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:16,891 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] [2019-09-10 07:17:16,891 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:16,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:16,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1774050406, now seen corresponding path program 1 times [2019-09-10 07:17:16,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:16,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:16,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:16,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:16,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:17,114 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 07:17:17,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:17,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:17:17,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:17,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:17:17,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:17:17,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:17:17,116 INFO L87 Difference]: Start difference. First operand 161291 states and 228525 transitions. Second operand 9 states. [2019-09-10 07:17:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:24,774 INFO L93 Difference]: Finished difference Result 402709 states and 569207 transitions. [2019-09-10 07:17:24,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:17:24,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:17:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:25,254 INFO L225 Difference]: With dead ends: 402709 [2019-09-10 07:17:25,255 INFO L226 Difference]: Without dead ends: 402709 [2019-09-10 07:17:25,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:17:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402709 states. [2019-09-10 07:17:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402709 to 161291. [2019-09-10 07:17:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161291 states. [2019-09-10 07:17:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161291 states to 161291 states and 228524 transitions. [2019-09-10 07:17:33,400 INFO L78 Accepts]: Start accepts. Automaton has 161291 states and 228524 transitions. Word has length 92 [2019-09-10 07:17:33,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:33,401 INFO L475 AbstractCegarLoop]: Abstraction has 161291 states and 228524 transitions. [2019-09-10 07:17:33,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:17:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 161291 states and 228524 transitions. [2019-09-10 07:17:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:17:33,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:33,405 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] [2019-09-10 07:17:33,405 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:33,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:33,406 INFO L82 PathProgramCache]: Analyzing trace with hash -653529683, now seen corresponding path program 1 times [2019-09-10 07:17:33,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:33,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:33,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:33,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:33,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:33,622 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 07:17:33,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:33,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:17:33,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:33,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:17:33,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:17:33,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:17:33,623 INFO L87 Difference]: Start difference. First operand 161291 states and 228524 transitions. Second operand 9 states. [2019-09-10 07:17:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:41,170 INFO L93 Difference]: Finished difference Result 328084 states and 463719 transitions. [2019-09-10 07:17:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:17:41,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:17:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:41,523 INFO L225 Difference]: With dead ends: 328084 [2019-09-10 07:17:41,523 INFO L226 Difference]: Without dead ends: 328084 [2019-09-10 07:17:41,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:17:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328084 states. [2019-09-10 07:17:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328084 to 161291. [2019-09-10 07:17:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161291 states. [2019-09-10 07:17:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161291 states to 161291 states and 228523 transitions. [2019-09-10 07:17:47,156 INFO L78 Accepts]: Start accepts. Automaton has 161291 states and 228523 transitions. Word has length 92 [2019-09-10 07:17:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:47,156 INFO L475 AbstractCegarLoop]: Abstraction has 161291 states and 228523 transitions. [2019-09-10 07:17:47,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:17:47,156 INFO L276 IsEmpty]: Start isEmpty. Operand 161291 states and 228523 transitions. [2019-09-10 07:17:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:17:47,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:47,161 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] [2019-09-10 07:17:47,161 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:47,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:47,161 INFO L82 PathProgramCache]: Analyzing trace with hash 711840796, now seen corresponding path program 1 times [2019-09-10 07:17:47,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:47,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:47,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:47,380 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 07:17:47,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:47,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:17:47,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:47,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:17:47,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:17:47,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:17:47,382 INFO L87 Difference]: Start difference. First operand 161291 states and 228523 transitions. Second operand 9 states. [2019-09-10 07:17:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:54,874 INFO L93 Difference]: Finished difference Result 328262 states and 463968 transitions. [2019-09-10 07:17:54,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:17:54,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:17:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:55,233 INFO L225 Difference]: With dead ends: 328262 [2019-09-10 07:17:55,233 INFO L226 Difference]: Without dead ends: 328262 [2019-09-10 07:17:55,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:17:55,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328262 states. [2019-09-10 07:17:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328262 to 161291. [2019-09-10 07:17:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161291 states. [2019-09-10 07:17:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161291 states to 161291 states and 228522 transitions. [2019-09-10 07:17:59,255 INFO L78 Accepts]: Start accepts. Automaton has 161291 states and 228522 transitions. Word has length 92 [2019-09-10 07:17:59,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:59,255 INFO L475 AbstractCegarLoop]: Abstraction has 161291 states and 228522 transitions. [2019-09-10 07:17:59,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:17:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 161291 states and 228522 transitions. [2019-09-10 07:17:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:17:59,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:59,260 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] [2019-09-10 07:17:59,260 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:59,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1547201594, now seen corresponding path program 1 times [2019-09-10 07:17:59,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:59,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:59,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:59,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:59,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:59,640 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 07:17:59,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:59,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:17:59,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:59,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:17:59,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:17:59,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:17:59,642 INFO L87 Difference]: Start difference. First operand 161291 states and 228522 transitions. Second operand 10 states. [2019-09-10 07:18:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:11,551 INFO L93 Difference]: Finished difference Result 331656 states and 467331 transitions. [2019-09-10 07:18:11,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:18:11,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-10 07:18:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:11,913 INFO L225 Difference]: With dead ends: 331656 [2019-09-10 07:18:11,914 INFO L226 Difference]: Without dead ends: 331656 [2019-09-10 07:18:11,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:18:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331656 states. [2019-09-10 07:18:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331656 to 161291. [2019-09-10 07:18:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161291 states. [2019-09-10 07:18:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161291 states to 161291 states and 228521 transitions. [2019-09-10 07:18:14,967 INFO L78 Accepts]: Start accepts. Automaton has 161291 states and 228521 transitions. Word has length 92 [2019-09-10 07:18:14,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:14,967 INFO L475 AbstractCegarLoop]: Abstraction has 161291 states and 228521 transitions. [2019-09-10 07:18:14,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:18:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 161291 states and 228521 transitions. [2019-09-10 07:18:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:18:14,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:14,971 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] [2019-09-10 07:18:14,972 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:14,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:14,972 INFO L82 PathProgramCache]: Analyzing trace with hash -30371882, now seen corresponding path program 1 times [2019-09-10 07:18:14,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:14,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:14,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:14,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:14,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:15,250 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 07:18:15,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:15,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:18:15,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:15,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:18:15,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:18:15,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:18:15,251 INFO L87 Difference]: Start difference. First operand 161291 states and 228521 transitions. Second operand 9 states. [2019-09-10 07:18:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:25,166 INFO L93 Difference]: Finished difference Result 371176 states and 526282 transitions. [2019-09-10 07:18:25,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:18:25,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:18:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:25,559 INFO L225 Difference]: With dead ends: 371176 [2019-09-10 07:18:25,559 INFO L226 Difference]: Without dead ends: 371176 [2019-09-10 07:18:25,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:18:25,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371176 states. [2019-09-10 07:18:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371176 to 161291. [2019-09-10 07:18:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161291 states. [2019-09-10 07:18:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161291 states to 161291 states and 228520 transitions. [2019-09-10 07:18:29,063 INFO L78 Accepts]: Start accepts. Automaton has 161291 states and 228520 transitions. Word has length 92 [2019-09-10 07:18:29,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:29,063 INFO L475 AbstractCegarLoop]: Abstraction has 161291 states and 228520 transitions. [2019-09-10 07:18:29,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:18:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 161291 states and 228520 transitions. [2019-09-10 07:18:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:18:29,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:29,068 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] [2019-09-10 07:18:29,068 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:29,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:29,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1081492538, now seen corresponding path program 1 times [2019-09-10 07:18:29,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:29,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:29,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:29,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:29,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:29,376 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 07:18:29,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:29,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:18:29,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:29,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:18:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:18:29,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:18:29,377 INFO L87 Difference]: Start difference. First operand 161291 states and 228520 transitions. Second operand 10 states. [2019-09-10 07:18:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:40,908 INFO L93 Difference]: Finished difference Result 402808 states and 569383 transitions. [2019-09-10 07:18:40,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:18:40,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-10 07:18:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:41,362 INFO L225 Difference]: With dead ends: 402808 [2019-09-10 07:18:41,363 INFO L226 Difference]: Without dead ends: 402808 [2019-09-10 07:18:41,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:18:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402808 states. [2019-09-10 07:18:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402808 to 161291. [2019-09-10 07:18:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161291 states. [2019-09-10 07:18:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161291 states to 161291 states and 228519 transitions. [2019-09-10 07:18:44,160 INFO L78 Accepts]: Start accepts. Automaton has 161291 states and 228519 transitions. Word has length 92 [2019-09-10 07:18:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:44,161 INFO L475 AbstractCegarLoop]: Abstraction has 161291 states and 228519 transitions. [2019-09-10 07:18:44,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:18:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 161291 states and 228519 transitions. [2019-09-10 07:18:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:18:44,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:44,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:18:44,166 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:44,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:44,166 INFO L82 PathProgramCache]: Analyzing trace with hash -467330234, now seen corresponding path program 1 times [2019-09-10 07:18:44,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:44,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:44,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:44,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:44,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:18:44,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:44,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:18:44,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:18:44,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:18:44,311 INFO L87 Difference]: Start difference. First operand 161291 states and 228519 transitions. Second operand 4 states. [2019-09-10 07:18:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:44,824 INFO L93 Difference]: Finished difference Result 161452 states and 228736 transitions. [2019-09-10 07:18:44,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:18:44,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-10 07:18:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:44,980 INFO L225 Difference]: With dead ends: 161452 [2019-09-10 07:18:44,981 INFO L226 Difference]: Without dead ends: 161452 [2019-09-10 07:18:44,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 07:18:45,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161452 states. [2019-09-10 07:18:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161452 to 161289. [2019-09-10 07:18:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161289 states. [2019-09-10 07:18:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161289 states to 161289 states and 228516 transitions. [2019-09-10 07:18:47,061 INFO L78 Accepts]: Start accepts. Automaton has 161289 states and 228516 transitions. Word has length 92 [2019-09-10 07:18:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:47,062 INFO L475 AbstractCegarLoop]: Abstraction has 161289 states and 228516 transitions. [2019-09-10 07:18:47,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:18:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 161289 states and 228516 transitions. [2019-09-10 07:18:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:18:47,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:47,066 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] [2019-09-10 07:18:47,066 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:47,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:47,067 INFO L82 PathProgramCache]: Analyzing trace with hash 897156576, now seen corresponding path program 1 times [2019-09-10 07:18:47,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:47,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:47,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:47,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:47,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:47,245 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 07:18:47,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:47,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:18:47,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:47,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:18:47,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:18:47,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:18:47,247 INFO L87 Difference]: Start difference. First operand 161289 states and 228516 transitions. Second operand 4 states. [2019-09-10 07:18:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:47,845 INFO L93 Difference]: Finished difference Result 161450 states and 228733 transitions. [2019-09-10 07:18:47,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:18:47,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-10 07:18:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:48,612 INFO L225 Difference]: With dead ends: 161450 [2019-09-10 07:18:48,613 INFO L226 Difference]: Without dead ends: 161450 [2019-09-10 07:18:48,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 07:18:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161450 states. [2019-09-10 07:18:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161450 to 161287. [2019-09-10 07:18:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161287 states. [2019-09-10 07:18:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161287 states to 161287 states and 228513 transitions. [2019-09-10 07:18:49,867 INFO L78 Accepts]: Start accepts. Automaton has 161287 states and 228513 transitions. Word has length 92 [2019-09-10 07:18:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:49,868 INFO L475 AbstractCegarLoop]: Abstraction has 161287 states and 228513 transitions. [2019-09-10 07:18:49,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:18:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 161287 states and 228513 transitions. [2019-09-10 07:18:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:18:49,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:49,875 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] [2019-09-10 07:18:49,875 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:49,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:49,876 INFO L82 PathProgramCache]: Analyzing trace with hash 57731354, now seen corresponding path program 1 times [2019-09-10 07:18:49,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:49,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:49,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:49,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:49,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:50,051 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 07:18:50,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:50,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:18:50,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:50,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:18:50,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:18:50,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:18:50,052 INFO L87 Difference]: Start difference. First operand 161287 states and 228513 transitions. Second operand 4 states. [2019-09-10 07:18:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:51,079 INFO L93 Difference]: Finished difference Result 161448 states and 228730 transitions. [2019-09-10 07:18:51,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:18:51,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-10 07:18:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:51,225 INFO L225 Difference]: With dead ends: 161448 [2019-09-10 07:18:51,225 INFO L226 Difference]: Without dead ends: 161448 [2019-09-10 07:18:51,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 07:18:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161448 states. [2019-09-10 07:18:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161448 to 161285. [2019-09-10 07:18:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161285 states. [2019-09-10 07:18:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161285 states to 161285 states and 228510 transitions. [2019-09-10 07:18:52,518 INFO L78 Accepts]: Start accepts. Automaton has 161285 states and 228510 transitions. Word has length 92 [2019-09-10 07:18:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:52,518 INFO L475 AbstractCegarLoop]: Abstraction has 161285 states and 228510 transitions. [2019-09-10 07:18:52,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:18:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 161285 states and 228510 transitions. [2019-09-10 07:18:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:18:52,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:52,523 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] [2019-09-10 07:18:52,523 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:52,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:52,523 INFO L82 PathProgramCache]: Analyzing trace with hash 452000394, now seen corresponding path program 1 times [2019-09-10 07:18:52,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:52,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:52,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:52,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:52,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:52,755 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 07:18:52,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:52,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:18:52,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:52,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:18:52,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:18:52,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:18:52,757 INFO L87 Difference]: Start difference. First operand 161285 states and 228510 transitions. Second operand 9 states. [2019-09-10 07:19:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:00,193 INFO L93 Difference]: Finished difference Result 328246 states and 463942 transitions. [2019-09-10 07:19:00,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:19:00,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:19:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:00,552 INFO L225 Difference]: With dead ends: 328246 [2019-09-10 07:19:00,552 INFO L226 Difference]: Without dead ends: 328246 [2019-09-10 07:19:00,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:19:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328246 states. [2019-09-10 07:19:06,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328246 to 161279. [2019-09-10 07:19:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161279 states. [2019-09-10 07:19:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161279 states to 161279 states and 228502 transitions. [2019-09-10 07:19:06,369 INFO L78 Accepts]: Start accepts. Automaton has 161279 states and 228502 transitions. Word has length 92 [2019-09-10 07:19:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:06,370 INFO L475 AbstractCegarLoop]: Abstraction has 161279 states and 228502 transitions. [2019-09-10 07:19:06,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:19:06,370 INFO L276 IsEmpty]: Start isEmpty. Operand 161279 states and 228502 transitions. [2019-09-10 07:19:06,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:19:06,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:06,845 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] [2019-09-10 07:19:06,845 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:06,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:06,845 INFO L82 PathProgramCache]: Analyzing trace with hash 312002255, now seen corresponding path program 1 times [2019-09-10 07:19:06,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:06,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:06,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:06,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:06,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:07,141 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 07:19:07,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:07,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:19:07,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:07,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:19:07,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:19:07,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:19:07,144 INFO L87 Difference]: Start difference. First operand 161279 states and 228502 transitions. Second operand 9 states. [2019-09-10 07:19:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:13,661 INFO L93 Difference]: Finished difference Result 328245 states and 463940 transitions. [2019-09-10 07:19:13,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:19:13,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:19:13,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:14,020 INFO L225 Difference]: With dead ends: 328245 [2019-09-10 07:19:14,020 INFO L226 Difference]: Without dead ends: 328245 [2019-09-10 07:19:14,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:19:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328245 states. [2019-09-10 07:19:16,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328245 to 161278. [2019-09-10 07:19:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161278 states. [2019-09-10 07:19:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161278 states to 161278 states and 228500 transitions. [2019-09-10 07:19:21,903 INFO L78 Accepts]: Start accepts. Automaton has 161278 states and 228500 transitions. Word has length 92 [2019-09-10 07:19:21,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:21,903 INFO L475 AbstractCegarLoop]: Abstraction has 161278 states and 228500 transitions. [2019-09-10 07:19:21,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:19:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 161278 states and 228500 transitions. [2019-09-10 07:19:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:19:21,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:21,908 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] [2019-09-10 07:19:21,908 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:21,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:21,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1029122939, now seen corresponding path program 1 times [2019-09-10 07:19:21,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:21,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:21,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:21,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:21,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:22,574 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 07:19:22,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:22,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:19:22,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:22,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:19:22,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:19:22,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:19:22,575 INFO L87 Difference]: Start difference. First operand 161278 states and 228500 transitions. Second operand 12 states. [2019-09-10 07:19:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:26,468 INFO L93 Difference]: Finished difference Result 228439 states and 323155 transitions. [2019-09-10 07:19:26,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:19:26,469 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-09-10 07:19:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:26,723 INFO L225 Difference]: With dead ends: 228439 [2019-09-10 07:19:26,723 INFO L226 Difference]: Without dead ends: 228439 [2019-09-10 07:19:26,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:19:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228439 states. [2019-09-10 07:19:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228439 to 161274. [2019-09-10 07:19:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161274 states. [2019-09-10 07:19:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161274 states to 161274 states and 228495 transitions. [2019-09-10 07:19:28,837 INFO L78 Accepts]: Start accepts. Automaton has 161274 states and 228495 transitions. Word has length 93 [2019-09-10 07:19:28,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:28,837 INFO L475 AbstractCegarLoop]: Abstraction has 161274 states and 228495 transitions. [2019-09-10 07:19:28,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:19:28,837 INFO L276 IsEmpty]: Start isEmpty. Operand 161274 states and 228495 transitions. [2019-09-10 07:19:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:19:28,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:28,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:28,843 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:28,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:28,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2003471515, now seen corresponding path program 1 times [2019-09-10 07:19:28,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:28,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:28,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:28,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:28,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:29,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:29,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:19:29,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:29,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:19:29,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:19:29,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:19:29,173 INFO L87 Difference]: Start difference. First operand 161274 states and 228495 transitions. Second operand 10 states. [2019-09-10 07:19:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:38,604 INFO L93 Difference]: Finished difference Result 331045 states and 466498 transitions. [2019-09-10 07:19:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:19:38,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-09-10 07:19:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:39,024 INFO L225 Difference]: With dead ends: 331045 [2019-09-10 07:19:39,024 INFO L226 Difference]: Without dead ends: 331045 [2019-09-10 07:19:39,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:19:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331045 states. [2019-09-10 07:19:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331045 to 161229. [2019-09-10 07:19:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161229 states. [2019-09-10 07:19:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161229 states to 161229 states and 228439 transitions. [2019-09-10 07:19:42,151 INFO L78 Accepts]: Start accepts. Automaton has 161229 states and 228439 transitions. Word has length 93 [2019-09-10 07:19:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:42,151 INFO L475 AbstractCegarLoop]: Abstraction has 161229 states and 228439 transitions. [2019-09-10 07:19:42,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:19:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 161229 states and 228439 transitions. [2019-09-10 07:19:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:19:42,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:42,159 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] [2019-09-10 07:19:42,159 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:42,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1138471167, now seen corresponding path program 1 times [2019-09-10 07:19:42,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:42,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:42,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:42,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:42,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:42,315 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 07:19:42,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:42,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:19:42,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:42,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:19:42,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:19:42,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:19:42,316 INFO L87 Difference]: Start difference. First operand 161229 states and 228439 transitions. Second operand 4 states. [2019-09-10 07:19:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:42,837 INFO L93 Difference]: Finished difference Result 161390 states and 228656 transitions. [2019-09-10 07:19:42,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:19:42,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-10 07:19:42,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:42,997 INFO L225 Difference]: With dead ends: 161390 [2019-09-10 07:19:42,997 INFO L226 Difference]: Without dead ends: 161390 [2019-09-10 07:19:42,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 07:19:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161390 states. [2019-09-10 07:19:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161390 to 161227. [2019-09-10 07:19:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161227 states. [2019-09-10 07:19:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161227 states to 161227 states and 228436 transitions. [2019-09-10 07:19:44,927 INFO L78 Accepts]: Start accepts. Automaton has 161227 states and 228436 transitions. Word has length 93 [2019-09-10 07:19:44,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:44,928 INFO L475 AbstractCegarLoop]: Abstraction has 161227 states and 228436 transitions. [2019-09-10 07:19:44,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:19:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 161227 states and 228436 transitions. [2019-09-10 07:19:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:19:44,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:44,934 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] [2019-09-10 07:19:44,934 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:44,934 INFO L82 PathProgramCache]: Analyzing trace with hash -922811079, now seen corresponding path program 1 times [2019-09-10 07:19:44,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:44,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:44,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:45,074 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 07:19:45,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:45,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:19:45,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:45,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:19:45,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:19:45,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:19:45,076 INFO L87 Difference]: Start difference. First operand 161227 states and 228436 transitions. Second operand 4 states. [2019-09-10 07:19:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:45,588 INFO L93 Difference]: Finished difference Result 161388 states and 228654 transitions. [2019-09-10 07:19:45,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:19:45,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-10 07:19:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:45,747 INFO L225 Difference]: With dead ends: 161388 [2019-09-10 07:19:45,748 INFO L226 Difference]: Without dead ends: 161388 [2019-09-10 07:19:45,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 07:19:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161388 states. [2019-09-10 07:19:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161388 to 161225. [2019-09-10 07:19:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161225 states. [2019-09-10 07:19:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161225 states to 161225 states and 228434 transitions. [2019-09-10 07:19:47,664 INFO L78 Accepts]: Start accepts. Automaton has 161225 states and 228434 transitions. Word has length 93 [2019-09-10 07:19:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:47,664 INFO L475 AbstractCegarLoop]: Abstraction has 161225 states and 228434 transitions. [2019-09-10 07:19:47,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:19:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 161225 states and 228434 transitions. [2019-09-10 07:19:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:19:47,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:47,669 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] [2019-09-10 07:19:47,670 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:47,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:47,670 INFO L82 PathProgramCache]: Analyzing trace with hash 900748271, now seen corresponding path program 1 times [2019-09-10 07:19:47,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:47,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:47,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:47,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:47,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:48,035 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 07:19:48,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:48,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:19:48,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:48,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:19:48,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:19:48,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:19:48,037 INFO L87 Difference]: Start difference. First operand 161225 states and 228434 transitions. Second operand 10 states. [2019-09-10 07:19:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:57,224 INFO L93 Difference]: Finished difference Result 401442 states and 567521 transitions. [2019-09-10 07:19:57,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:19:57,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-09-10 07:19:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:57,763 INFO L225 Difference]: With dead ends: 401442 [2019-09-10 07:19:57,763 INFO L226 Difference]: Without dead ends: 401442 [2019-09-10 07:19:57,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:19:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401442 states. [2019-09-10 07:20:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401442 to 161225. [2019-09-10 07:20:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161225 states. [2019-09-10 07:20:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161225 states to 161225 states and 228433 transitions. [2019-09-10 07:20:01,378 INFO L78 Accepts]: Start accepts. Automaton has 161225 states and 228433 transitions. Word has length 93 [2019-09-10 07:20:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:01,379 INFO L475 AbstractCegarLoop]: Abstraction has 161225 states and 228433 transitions. [2019-09-10 07:20:01,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:20:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 161225 states and 228433 transitions. [2019-09-10 07:20:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:20:01,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:01,385 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:20:01,385 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:01,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:01,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1817172059, now seen corresponding path program 1 times [2019-09-10 07:20:01,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:01,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:01,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:01,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:01,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:02,069 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 07:20:02,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:02,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:20:02,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:02,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:20:02,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:20:02,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:20:02,072 INFO L87 Difference]: Start difference. First operand 161225 states and 228433 transitions. Second operand 12 states. [2019-09-10 07:20:02,636 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-10 07:20:02,793 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-10 07:20:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:08,748 INFO L93 Difference]: Finished difference Result 416123 states and 590162 transitions. [2019-09-10 07:20:08,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:20:08,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-09-10 07:20:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:09,340 INFO L225 Difference]: With dead ends: 416123 [2019-09-10 07:20:09,341 INFO L226 Difference]: Without dead ends: 416123 [2019-09-10 07:20:09,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:20:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416123 states. [2019-09-10 07:20:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416123 to 161171. [2019-09-10 07:20:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161171 states. [2019-09-10 07:20:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161171 states to 161171 states and 228369 transitions. [2019-09-10 07:20:12,734 INFO L78 Accepts]: Start accepts. Automaton has 161171 states and 228369 transitions. Word has length 93 [2019-09-10 07:20:12,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:12,734 INFO L475 AbstractCegarLoop]: Abstraction has 161171 states and 228369 transitions. [2019-09-10 07:20:12,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:20:12,734 INFO L276 IsEmpty]: Start isEmpty. Operand 161171 states and 228369 transitions. [2019-09-10 07:20:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:20:12,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:12,739 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] [2019-09-10 07:20:12,740 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:12,740 INFO L82 PathProgramCache]: Analyzing trace with hash 60532649, now seen corresponding path program 1 times [2019-09-10 07:20:12,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:12,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:12,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:12,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:12,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:13,011 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 07:20:13,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:13,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:20:13,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:13,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:20:13,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:20:13,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:20:13,013 INFO L87 Difference]: Start difference. First operand 161171 states and 228369 transitions. Second operand 9 states. [2019-09-10 07:20:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:20,801 INFO L93 Difference]: Finished difference Result 328074 states and 463737 transitions. [2019-09-10 07:20:20,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:20:20,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 07:20:20,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:21,167 INFO L225 Difference]: With dead ends: 328074 [2019-09-10 07:20:21,168 INFO L226 Difference]: Without dead ends: 328074 [2019-09-10 07:20:21,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:20:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328074 states. [2019-09-10 07:20:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328074 to 161168. [2019-09-10 07:20:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161168 states. [2019-09-10 07:20:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161168 states to 161168 states and 228365 transitions. [2019-09-10 07:20:27,185 INFO L78 Accepts]: Start accepts. Automaton has 161168 states and 228365 transitions. Word has length 93 [2019-09-10 07:20:27,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:27,186 INFO L475 AbstractCegarLoop]: Abstraction has 161168 states and 228365 transitions. [2019-09-10 07:20:27,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:20:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 161168 states and 228365 transitions. [2019-09-10 07:20:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:20:27,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:27,191 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] [2019-09-10 07:20:27,191 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:27,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:27,191 INFO L82 PathProgramCache]: Analyzing trace with hash 129408807, now seen corresponding path program 1 times [2019-09-10 07:20:27,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:27,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:27,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:27,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:27,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:27,388 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 07:20:27,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:27,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:20:27,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:27,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:20:27,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:20:27,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:20:27,389 INFO L87 Difference]: Start difference. First operand 161168 states and 228365 transitions. Second operand 9 states. [2019-09-10 07:20:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:34,881 INFO L93 Difference]: Finished difference Result 328068 states and 463729 transitions. [2019-09-10 07:20:34,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:20:34,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 07:20:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:35,242 INFO L225 Difference]: With dead ends: 328068 [2019-09-10 07:20:35,242 INFO L226 Difference]: Without dead ends: 328068 [2019-09-10 07:20:35,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:20:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328068 states. [2019-09-10 07:20:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328068 to 161165. [2019-09-10 07:20:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161165 states. [2019-09-10 07:20:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161165 states to 161165 states and 228361 transitions. [2019-09-10 07:20:38,191 INFO L78 Accepts]: Start accepts. Automaton has 161165 states and 228361 transitions. Word has length 93 [2019-09-10 07:20:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:38,191 INFO L475 AbstractCegarLoop]: Abstraction has 161165 states and 228361 transitions. [2019-09-10 07:20:38,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:20:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 161165 states and 228361 transitions. [2019-09-10 07:20:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:20:38,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:38,196 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] [2019-09-10 07:20:38,196 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:38,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:38,197 INFO L82 PathProgramCache]: Analyzing trace with hash 48591913, now seen corresponding path program 1 times [2019-09-10 07:20:38,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:38,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:38,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:38,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:38,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:38,736 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 07:20:38,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:38,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:20:38,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:38,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:20:38,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:20:38,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:20:38,738 INFO L87 Difference]: Start difference. First operand 161165 states and 228361 transitions. Second operand 13 states. [2019-09-10 07:20:39,277 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-10 07:20:39,429 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:20:39,607 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:20:40,048 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:20:40,493 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-10 07:20:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:43,328 INFO L93 Difference]: Finished difference Result 287393 states and 406022 transitions. [2019-09-10 07:20:43,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:20:43,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-10 07:20:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:44,678 INFO L225 Difference]: With dead ends: 287393 [2019-09-10 07:20:44,679 INFO L226 Difference]: Without dead ends: 287393 [2019-09-10 07:20:44,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:20:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287393 states. [2019-09-10 07:20:46,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287393 to 161113. [2019-09-10 07:20:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161113 states. [2019-09-10 07:20:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161113 states to 161113 states and 228300 transitions. [2019-09-10 07:20:51,792 INFO L78 Accepts]: Start accepts. Automaton has 161113 states and 228300 transitions. Word has length 93 [2019-09-10 07:20:51,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:51,793 INFO L475 AbstractCegarLoop]: Abstraction has 161113 states and 228300 transitions. [2019-09-10 07:20:51,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:20:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 161113 states and 228300 transitions. [2019-09-10 07:20:51,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:20:51,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:51,797 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] [2019-09-10 07:20:51,798 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:51,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:51,798 INFO L82 PathProgramCache]: Analyzing trace with hash -468693387, now seen corresponding path program 1 times [2019-09-10 07:20:51,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:51,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:51,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:51,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:52,830 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 07:20:52,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:52,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:20:52,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:52,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:20:52,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:20:52,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:20:52,831 INFO L87 Difference]: Start difference. First operand 161113 states and 228300 transitions. Second operand 18 states. [2019-09-10 07:20:53,739 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:20:54,467 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-10 07:20:54,676 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:20:55,202 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-09-10 07:20:55,676 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-09-10 07:20:56,045 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 07:20:56,390 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:21:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:02,148 INFO L93 Difference]: Finished difference Result 274506 states and 388052 transitions. [2019-09-10 07:21:02,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:21:02,149 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2019-09-10 07:21:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:02,447 INFO L225 Difference]: With dead ends: 274506 [2019-09-10 07:21:02,447 INFO L226 Difference]: Without dead ends: 274506 [2019-09-10 07:21:02,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 07:21:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274506 states. [2019-09-10 07:21:04,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274506 to 161131. [2019-09-10 07:21:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161131 states. [2019-09-10 07:21:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161131 states to 161131 states and 228323 transitions. [2019-09-10 07:21:04,597 INFO L78 Accepts]: Start accepts. Automaton has 161131 states and 228323 transitions. Word has length 94 [2019-09-10 07:21:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:04,598 INFO L475 AbstractCegarLoop]: Abstraction has 161131 states and 228323 transitions. [2019-09-10 07:21:04,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:21:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 161131 states and 228323 transitions. [2019-09-10 07:21:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:21:04,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:04,603 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] [2019-09-10 07:21:04,603 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:04,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:04,604 INFO L82 PathProgramCache]: Analyzing trace with hash 95128221, now seen corresponding path program 1 times [2019-09-10 07:21:04,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:04,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:04,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:04,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:04,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:04,812 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 07:21:04,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:04,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:21:04,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:04,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:21:04,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:21:04,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:21:04,813 INFO L87 Difference]: Start difference. First operand 161131 states and 228323 transitions. Second operand 9 states. [2019-09-10 07:21:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:11,905 INFO L93 Difference]: Finished difference Result 370599 states and 525523 transitions. [2019-09-10 07:21:11,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:21:11,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-10 07:21:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:12,308 INFO L225 Difference]: With dead ends: 370599 [2019-09-10 07:21:12,308 INFO L226 Difference]: Without dead ends: 370599 [2019-09-10 07:21:12,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:21:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370599 states. [2019-09-10 07:21:15,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370599 to 161115. [2019-09-10 07:21:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161115 states. [2019-09-10 07:21:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161115 states to 161115 states and 228303 transitions. [2019-09-10 07:21:15,462 INFO L78 Accepts]: Start accepts. Automaton has 161115 states and 228303 transitions. Word has length 94 [2019-09-10 07:21:15,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:15,463 INFO L475 AbstractCegarLoop]: Abstraction has 161115 states and 228303 transitions. [2019-09-10 07:21:15,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:21:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 161115 states and 228303 transitions. [2019-09-10 07:21:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:21:15,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:15,468 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] [2019-09-10 07:21:15,468 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:15,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:15,469 INFO L82 PathProgramCache]: Analyzing trace with hash -939976707, now seen corresponding path program 1 times [2019-09-10 07:21:15,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:15,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:15,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:15,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:15,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:15,677 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 07:21:15,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:15,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:21:15,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:15,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:21:15,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:21:15,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:21:15,679 INFO L87 Difference]: Start difference. First operand 161115 states and 228303 transitions. Second operand 9 states. [2019-09-10 07:21:23,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:23,110 INFO L93 Difference]: Finished difference Result 370567 states and 525483 transitions. [2019-09-10 07:21:23,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:21:23,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-10 07:21:23,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:23,517 INFO L225 Difference]: With dead ends: 370567 [2019-09-10 07:21:23,517 INFO L226 Difference]: Without dead ends: 370567 [2019-09-10 07:21:23,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:21:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370567 states. [2019-09-10 07:21:29,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370567 to 161083. [2019-09-10 07:21:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161083 states. [2019-09-10 07:21:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161083 states to 161083 states and 228263 transitions. [2019-09-10 07:21:29,885 INFO L78 Accepts]: Start accepts. Automaton has 161083 states and 228263 transitions. Word has length 94 [2019-09-10 07:21:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:29,885 INFO L475 AbstractCegarLoop]: Abstraction has 161083 states and 228263 transitions. [2019-09-10 07:21:29,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:21:29,885 INFO L276 IsEmpty]: Start isEmpty. Operand 161083 states and 228263 transitions. [2019-09-10 07:21:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:21:29,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:29,890 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] [2019-09-10 07:21:29,891 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:29,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:29,891 INFO L82 PathProgramCache]: Analyzing trace with hash -63156650, now seen corresponding path program 1 times [2019-09-10 07:21:29,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:29,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:29,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:29,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:29,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:30,085 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 07:21:30,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:30,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:21:30,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:30,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:21:30,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:21:30,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:21:30,087 INFO L87 Difference]: Start difference. First operand 161083 states and 228263 transitions. Second operand 9 states. [2019-09-10 07:21:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:37,476 INFO L93 Difference]: Finished difference Result 402646 states and 569159 transitions. [2019-09-10 07:21:37,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:21:37,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-10 07:21:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:37,933 INFO L225 Difference]: With dead ends: 402646 [2019-09-10 07:21:37,933 INFO L226 Difference]: Without dead ends: 402646 [2019-09-10 07:21:37,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:21:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402646 states. [2019-09-10 07:21:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402646 to 161075. [2019-09-10 07:21:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161075 states. [2019-09-10 07:21:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161075 states to 161075 states and 228251 transitions. [2019-09-10 07:21:41,317 INFO L78 Accepts]: Start accepts. Automaton has 161075 states and 228251 transitions. Word has length 94 [2019-09-10 07:21:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:41,317 INFO L475 AbstractCegarLoop]: Abstraction has 161075 states and 228251 transitions. [2019-09-10 07:21:41,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:21:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 161075 states and 228251 transitions. [2019-09-10 07:21:41,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:21:41,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:41,322 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] [2019-09-10 07:21:41,323 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash 796049598, now seen corresponding path program 1 times [2019-09-10 07:21:41,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:41,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:41,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:41,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:41,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:41,606 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 07:21:41,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:41,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:21:41,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:41,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:21:41,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:21:41,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:21:41,607 INFO L87 Difference]: Start difference. First operand 161075 states and 228251 transitions. Second operand 10 states. [2019-09-10 07:21:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:54,165 INFO L93 Difference]: Finished difference Result 330078 states and 465202 transitions. [2019-09-10 07:21:54,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:21:54,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-10 07:21:54,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:54,557 INFO L225 Difference]: With dead ends: 330078 [2019-09-10 07:21:54,557 INFO L226 Difference]: Without dead ends: 330078 [2019-09-10 07:21:54,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:21:54,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330078 states. [2019-09-10 07:21:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330078 to 161075. [2019-09-10 07:21:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161075 states. [2019-09-10 07:21:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161075 states to 161075 states and 228250 transitions. [2019-09-10 07:21:57,407 INFO L78 Accepts]: Start accepts. Automaton has 161075 states and 228250 transitions. Word has length 94 [2019-09-10 07:21:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:57,407 INFO L475 AbstractCegarLoop]: Abstraction has 161075 states and 228250 transitions. [2019-09-10 07:21:57,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:21:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 161075 states and 228250 transitions. [2019-09-10 07:21:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:21:57,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:57,413 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] [2019-09-10 07:21:57,413 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:57,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:57,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1717158127, now seen corresponding path program 1 times [2019-09-10 07:21:57,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:57,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:57,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:57,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:57,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:57,962 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 07:21:57,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:57,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:21:57,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:57,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:21:57,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:21:57,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:21:57,963 INFO L87 Difference]: Start difference. First operand 161075 states and 228250 transitions. Second operand 13 states. [2019-09-10 07:22:04,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:04,226 INFO L93 Difference]: Finished difference Result 402876 states and 569350 transitions. [2019-09-10 07:22:04,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:22:04,227 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2019-09-10 07:22:04,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:04,701 INFO L225 Difference]: With dead ends: 402876 [2019-09-10 07:22:04,701 INFO L226 Difference]: Without dead ends: 402876 [2019-09-10 07:22:04,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:22:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402876 states. [2019-09-10 07:22:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402876 to 161074. [2019-09-10 07:22:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161074 states. [2019-09-10 07:22:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161074 states to 161074 states and 228248 transitions. [2019-09-10 07:22:07,893 INFO L78 Accepts]: Start accepts. Automaton has 161074 states and 228248 transitions. Word has length 95 [2019-09-10 07:22:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:07,893 INFO L475 AbstractCegarLoop]: Abstraction has 161074 states and 228248 transitions. [2019-09-10 07:22:07,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:22:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 161074 states and 228248 transitions. [2019-09-10 07:22:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:22:07,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:07,899 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] [2019-09-10 07:22:07,899 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:07,900 INFO L82 PathProgramCache]: Analyzing trace with hash 741918215, now seen corresponding path program 1 times [2019-09-10 07:22:07,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:07,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:07,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:07,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:07,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:08,711 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 07:22:08,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:08,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:22:08,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:08,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:22:08,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:22:08,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:22:08,713 INFO L87 Difference]: Start difference. First operand 161074 states and 228248 transitions. Second operand 17 states. [2019-09-10 07:22:09,356 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 07:22:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:18,252 INFO L93 Difference]: Finished difference Result 273252 states and 386288 transitions. [2019-09-10 07:22:18,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:22:18,253 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2019-09-10 07:22:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:18,562 INFO L225 Difference]: With dead ends: 273252 [2019-09-10 07:22:18,562 INFO L226 Difference]: Without dead ends: 273252 [2019-09-10 07:22:18,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:22:18,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273252 states. [2019-09-10 07:22:20,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273252 to 161074. [2019-09-10 07:22:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161074 states. [2019-09-10 07:22:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161074 states to 161074 states and 228246 transitions. [2019-09-10 07:22:20,836 INFO L78 Accepts]: Start accepts. Automaton has 161074 states and 228246 transitions. Word has length 95 [2019-09-10 07:22:20,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:20,836 INFO L475 AbstractCegarLoop]: Abstraction has 161074 states and 228246 transitions. [2019-09-10 07:22:20,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:22:20,836 INFO L276 IsEmpty]: Start isEmpty. Operand 161074 states and 228246 transitions. [2019-09-10 07:22:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:22:20,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:20,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:22:20,842 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:20,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:20,843 INFO L82 PathProgramCache]: Analyzing trace with hash -216874807, now seen corresponding path program 1 times [2019-09-10 07:22:20,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:20,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:20,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:20,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:20,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:21,397 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 07:22:21,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:21,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:22:21,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:21,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:22:21,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:22:21,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:22:21,398 INFO L87 Difference]: Start difference. First operand 161074 states and 228246 transitions. Second operand 13 states. [2019-09-10 07:22:26,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:26,670 INFO L93 Difference]: Finished difference Result 324110 states and 457967 transitions. [2019-09-10 07:22:26,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:22:26,671 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2019-09-10 07:22:26,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:28,009 INFO L225 Difference]: With dead ends: 324110 [2019-09-10 07:22:28,009 INFO L226 Difference]: Without dead ends: 324110 [2019-09-10 07:22:28,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:22:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324110 states. [2019-09-10 07:22:29,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324110 to 161055. [2019-09-10 07:22:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161055 states. [2019-09-10 07:22:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161055 states to 161055 states and 228221 transitions. [2019-09-10 07:22:29,887 INFO L78 Accepts]: Start accepts. Automaton has 161055 states and 228221 transitions. Word has length 95 [2019-09-10 07:22:29,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:29,887 INFO L475 AbstractCegarLoop]: Abstraction has 161055 states and 228221 transitions. [2019-09-10 07:22:29,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:22:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 161055 states and 228221 transitions. [2019-09-10 07:22:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:22:29,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:29,893 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] [2019-09-10 07:22:29,894 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:29,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:29,894 INFO L82 PathProgramCache]: Analyzing trace with hash 390866911, now seen corresponding path program 1 times [2019-09-10 07:22:29,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:29,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:29,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:29,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:29,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:31,450 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 07:22:31,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:31,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:22:31,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:31,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:22:31,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:22:31,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:22:31,452 INFO L87 Difference]: Start difference. First operand 161055 states and 228221 transitions. Second operand 17 states. [2019-09-10 07:22:32,297 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:22:33,274 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 07:22:33,601 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-09-10 07:22:33,768 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 07:22:33,983 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 07:22:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:40,199 INFO L93 Difference]: Finished difference Result 274976 states and 388718 transitions. [2019-09-10 07:22:40,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:22:40,200 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2019-09-10 07:22:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:40,518 INFO L225 Difference]: With dead ends: 274976 [2019-09-10 07:22:40,518 INFO L226 Difference]: Without dead ends: 274976 [2019-09-10 07:22:40,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:22:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274976 states. [2019-09-10 07:22:45,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274976 to 161074. [2019-09-10 07:22:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161074 states. [2019-09-10 07:22:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161074 states to 161074 states and 228245 transitions. [2019-09-10 07:22:45,637 INFO L78 Accepts]: Start accepts. Automaton has 161074 states and 228245 transitions. Word has length 95 [2019-09-10 07:22:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:45,637 INFO L475 AbstractCegarLoop]: Abstraction has 161074 states and 228245 transitions. [2019-09-10 07:22:45,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:22:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 161074 states and 228245 transitions. [2019-09-10 07:22:45,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:22:45,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:45,644 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] [2019-09-10 07:22:45,644 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:45,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:45,645 INFO L82 PathProgramCache]: Analyzing trace with hash 980858160, now seen corresponding path program 1 times [2019-09-10 07:22:45,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:45,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:45,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:45,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:45,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:46,702 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 07:22:46,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:46,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:22:46,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:46,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:22:46,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:22:46,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:22:46,704 INFO L87 Difference]: Start difference. First operand 161074 states and 228245 transitions. Second operand 18 states. [2019-09-10 07:22:48,090 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-09-10 07:22:48,901 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2019-09-10 07:22:49,254 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2019-09-10 07:22:49,484 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 07:22:49,890 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 07:22:50,517 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 07:22:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:57,488 INFO L93 Difference]: Finished difference Result 243151 states and 343331 transitions. [2019-09-10 07:22:57,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:22:57,489 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2019-09-10 07:22:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:57,812 INFO L225 Difference]: With dead ends: 243151 [2019-09-10 07:22:57,812 INFO L226 Difference]: Without dead ends: 243151 [2019-09-10 07:22:57,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:22:57,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243151 states. [2019-09-10 07:23:00,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243151 to 161030. [2019-09-10 07:23:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161030 states. [2019-09-10 07:23:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161030 states to 161030 states and 228191 transitions. [2019-09-10 07:23:00,431 INFO L78 Accepts]: Start accepts. Automaton has 161030 states and 228191 transitions. Word has length 95 [2019-09-10 07:23:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:00,431 INFO L475 AbstractCegarLoop]: Abstraction has 161030 states and 228191 transitions. [2019-09-10 07:23:00,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:23:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 161030 states and 228191 transitions. [2019-09-10 07:23:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:23:00,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:00,438 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] [2019-09-10 07:23:00,438 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:00,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:00,438 INFO L82 PathProgramCache]: Analyzing trace with hash 635261786, now seen corresponding path program 1 times [2019-09-10 07:23:00,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:00,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:00,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:00,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:00,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:00,639 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 07:23:00,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:00,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:23:00,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:00,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:23:00,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:23:00,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:23:00,640 INFO L87 Difference]: Start difference. First operand 161030 states and 228191 transitions. Second operand 9 states. [2019-09-10 07:23:08,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:08,702 INFO L93 Difference]: Finished difference Result 402595 states and 569092 transitions. [2019-09-10 07:23:08,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:23:08,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 07:23:08,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:09,207 INFO L225 Difference]: With dead ends: 402595 [2019-09-10 07:23:09,207 INFO L226 Difference]: Without dead ends: 402595 [2019-09-10 07:23:09,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:23:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402595 states. [2019-09-10 07:23:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402595 to 161024. [2019-09-10 07:23:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161024 states. [2019-09-10 07:23:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161024 states to 161024 states and 228184 transitions. [2019-09-10 07:23:12,592 INFO L78 Accepts]: Start accepts. Automaton has 161024 states and 228184 transitions. Word has length 95 [2019-09-10 07:23:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:12,592 INFO L475 AbstractCegarLoop]: Abstraction has 161024 states and 228184 transitions. [2019-09-10 07:23:12,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:23:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 161024 states and 228184 transitions. [2019-09-10 07:23:12,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:23:12,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:12,599 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] [2019-09-10 07:23:12,599 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:12,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:12,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1621086837, now seen corresponding path program 1 times [2019-09-10 07:23:12,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:12,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:12,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:12,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:12,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:12,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 07:23:12,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:12,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:23:12,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:12,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:23:12,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:23:12,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:23:12,833 INFO L87 Difference]: Start difference. First operand 161024 states and 228184 transitions. Second operand 9 states.