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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:06:03,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:06:03,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:06:03,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:06:03,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:06:03,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:06:03,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:06:03,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:06:03,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:06:03,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:06:03,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:06:03,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:06:03,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:06:03,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:06:03,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:06:03,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:06:03,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:06:04,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:06:04,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:06:04,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:06:04,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:06:04,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:06:04,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:06:04,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:06:04,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:06:04,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:06:04,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:06:04,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:06:04,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:06:04,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:06:04,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:06:04,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:06:04,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:06:04,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:06:04,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:06:04,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:06:04,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:06:04,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:06:04,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:06:04,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:06:04,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:06:04,032 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 08:06:04,071 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:06:04,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:06:04,072 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:06:04,072 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:06:04,076 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:06:04,076 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:06:04,076 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:06:04,076 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:06:04,077 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:06:04,077 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:06:04,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:06:04,080 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:06:04,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:06:04,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:06:04,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:06:04,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:06:04,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:06:04,081 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:06:04,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:06:04,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:06:04,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:06:04,083 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:06:04,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:06:04,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:06:04,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:06:04,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:06:04,084 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:06:04,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:06:04,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:06:04,085 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:06:04,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:06:04,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:06:04,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:06:04,157 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:06:04,157 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:06:04,158 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 08:06:04,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c649caf/be9272ed8d4f49c1b423064eadcfb5da/FLAG4cb7ca70d [2019-09-10 08:06:04,915 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:06:04,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 08:06:04,949 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c649caf/be9272ed8d4f49c1b423064eadcfb5da/FLAG4cb7ca70d [2019-09-10 08:06:05,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c649caf/be9272ed8d4f49c1b423064eadcfb5da [2019-09-10 08:06:05,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:06:05,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:06:05,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:06:05,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:06:05,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:06:05,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:06:05" (1/1) ... [2019-09-10 08:06:05,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8f9913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:06:05, skipping insertion in model container [2019-09-10 08:06:05,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:06:05" (1/1) ... [2019-09-10 08:06:05,081 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:06:05,256 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:06:06,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:06:06,410 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:06:06,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:06:06,817 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:06:06,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:06:06 WrapperNode [2019-09-10 08:06:06,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:06:06,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:06:06,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:06:06,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:06:06,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:06:06" (1/1) ... [2019-09-10 08:06:06,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:06:06" (1/1) ... [2019-09-10 08:06:06,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:06:06" (1/1) ... [2019-09-10 08:06:06,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:06:06" (1/1) ... [2019-09-10 08:06:07,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:06:06" (1/1) ... [2019-09-10 08:06:07,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:06:06" (1/1) ... [2019-09-10 08:06:07,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:06:06" (1/1) ... [2019-09-10 08:06:07,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:06:07,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:06:07,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:06:07,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:06:07,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:06:06" (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 08:06:07,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:06:07,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:06:07,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:06:07,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:06:07,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:06:07,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:06:07,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:06:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:06:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:06:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:06:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:06:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:06:07,226 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:06:07,227 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:06:07,227 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:06:07,228 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:06:07,228 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:06:07,228 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:06:07,229 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:06:07,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:06:07,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:06:10,416 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:06:10,416 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:06:10,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:06:10 BoogieIcfgContainer [2019-09-10 08:06:10,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:06:10,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:06:10,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:06:10,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:06:10,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:06:05" (1/3) ... [2019-09-10 08:06:10,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2791fdab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:06:10, skipping insertion in model container [2019-09-10 08:06:10,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:06:06" (2/3) ... [2019-09-10 08:06:10,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2791fdab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:06:10, skipping insertion in model container [2019-09-10 08:06:10,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:06:10" (3/3) ... [2019-09-10 08:06:10,427 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 08:06:10,437 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:06:10,453 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-10 08:06:10,474 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-10 08:06:10,511 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:06:10,511 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:06:10,511 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:06:10,512 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:06:10,512 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:06:10,512 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:06:10,512 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:06:10,512 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:06:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states. [2019-09-10 08:06:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:06:10,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:10,604 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] [2019-09-10 08:06:10,606 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:10,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:10,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2026715041, now seen corresponding path program 1 times [2019-09-10 08:06:10,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:10,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:10,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:10,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:10,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:11,227 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 08:06:11,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:11,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:06:11,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:11,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:06:11,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:06:11,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:06:11,254 INFO L87 Difference]: Start difference. First operand 1116 states. Second operand 5 states. [2019-09-10 08:06:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:12,237 INFO L93 Difference]: Finished difference Result 716 states and 1233 transitions. [2019-09-10 08:06:12,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:06:12,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 08:06:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:12,259 INFO L225 Difference]: With dead ends: 716 [2019-09-10 08:06:12,259 INFO L226 Difference]: Without dead ends: 704 [2019-09-10 08:06:12,261 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 08:06:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-09-10 08:06:12,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-09-10 08:06:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-09-10 08:06:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 889 transitions. [2019-09-10 08:06:12,349 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 889 transitions. Word has length 76 [2019-09-10 08:06:12,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:12,350 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 889 transitions. [2019-09-10 08:06:12,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:06:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 889 transitions. [2019-09-10 08:06:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:06:12,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:12,355 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] [2019-09-10 08:06:12,355 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:12,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:12,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1438864747, now seen corresponding path program 1 times [2019-09-10 08:06:12,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:12,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:12,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:12,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:12,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:12,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:12,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:06:12,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:12,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:06:12,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:06:12,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:06:12,560 INFO L87 Difference]: Start difference. First operand 704 states and 889 transitions. Second operand 5 states. [2019-09-10 08:06:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:13,014 INFO L93 Difference]: Finished difference Result 546 states and 698 transitions. [2019-09-10 08:06:13,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:06:13,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 08:06:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:13,018 INFO L225 Difference]: With dead ends: 546 [2019-09-10 08:06:13,019 INFO L226 Difference]: Without dead ends: 546 [2019-09-10 08:06:13,020 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 08:06:13,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-10 08:06:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2019-09-10 08:06:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-09-10 08:06:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 698 transitions. [2019-09-10 08:06:13,044 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 698 transitions. Word has length 76 [2019-09-10 08:06:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:13,044 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 698 transitions. [2019-09-10 08:06:13,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:06:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 698 transitions. [2019-09-10 08:06:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:06:13,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:13,050 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] [2019-09-10 08:06:13,051 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:13,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:13,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1708480706, now seen corresponding path program 1 times [2019-09-10 08:06:13,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:13,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:13,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:13,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:13,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:13,230 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 08:06:13,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:13,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:06:13,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:13,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:06:13,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:06:13,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:06:13,233 INFO L87 Difference]: Start difference. First operand 546 states and 698 transitions. Second operand 5 states. [2019-09-10 08:06:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:13,706 INFO L93 Difference]: Finished difference Result 480 states and 621 transitions. [2019-09-10 08:06:13,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:06:13,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 08:06:13,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:13,711 INFO L225 Difference]: With dead ends: 480 [2019-09-10 08:06:13,712 INFO L226 Difference]: Without dead ends: 480 [2019-09-10 08:06:13,712 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 08:06:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-10 08:06:13,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2019-09-10 08:06:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-10 08:06:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 621 transitions. [2019-09-10 08:06:13,725 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 621 transitions. Word has length 76 [2019-09-10 08:06:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:13,725 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 621 transitions. [2019-09-10 08:06:13,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:06:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 621 transitions. [2019-09-10 08:06:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:06:13,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:13,727 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] [2019-09-10 08:06:13,728 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:13,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:13,729 INFO L82 PathProgramCache]: Analyzing trace with hash 755366932, now seen corresponding path program 1 times [2019-09-10 08:06:13,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:13,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:13,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:13,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:13,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:13,836 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 08:06:13,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:13,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:06:13,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:13,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:06:13,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:06:13,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:06:13,838 INFO L87 Difference]: Start difference. First operand 480 states and 621 transitions. Second operand 5 states. [2019-09-10 08:06:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:14,312 INFO L93 Difference]: Finished difference Result 464 states and 602 transitions. [2019-09-10 08:06:14,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:06:14,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:06:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:14,317 INFO L225 Difference]: With dead ends: 464 [2019-09-10 08:06:14,317 INFO L226 Difference]: Without dead ends: 464 [2019-09-10 08:06:14,318 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 08:06:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-10 08:06:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-09-10 08:06:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 08:06:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 602 transitions. [2019-09-10 08:06:14,328 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 602 transitions. Word has length 77 [2019-09-10 08:06:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:14,329 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 602 transitions. [2019-09-10 08:06:14,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:06:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 602 transitions. [2019-09-10 08:06:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 08:06:14,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:14,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:14,331 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:14,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:14,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1886479960, now seen corresponding path program 1 times [2019-09-10 08:06:14,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:14,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:14,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:14,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:14,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:14,439 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 08:06:14,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:14,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:06:14,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:14,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:06:14,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:06:14,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:06:14,443 INFO L87 Difference]: Start difference. First operand 464 states and 602 transitions. Second operand 5 states. [2019-09-10 08:06:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:14,752 INFO L93 Difference]: Finished difference Result 394 states and 509 transitions. [2019-09-10 08:06:14,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:06:14,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 08:06:14,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:14,755 INFO L225 Difference]: With dead ends: 394 [2019-09-10 08:06:14,755 INFO L226 Difference]: Without dead ends: 394 [2019-09-10 08:06:14,755 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 08:06:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-10 08:06:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2019-09-10 08:06:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 509 transitions. [2019-09-10 08:06:14,764 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 509 transitions. Word has length 78 [2019-09-10 08:06:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:14,765 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 509 transitions. [2019-09-10 08:06:14,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:06:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 509 transitions. [2019-09-10 08:06:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 08:06:14,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:14,766 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] [2019-09-10 08:06:14,767 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:14,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:14,767 INFO L82 PathProgramCache]: Analyzing trace with hash -213392593, now seen corresponding path program 1 times [2019-09-10 08:06:14,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:14,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:14,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:14,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:14,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:14,949 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 08:06:14,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:14,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:06:14,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:14,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:06:14,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:06:14,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:06:14,951 INFO L87 Difference]: Start difference. First operand 394 states and 509 transitions. Second operand 8 states. [2019-09-10 08:06:15,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:15,752 INFO L93 Difference]: Finished difference Result 546 states and 684 transitions. [2019-09-10 08:06:15,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:06:15,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-09-10 08:06:15,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:15,756 INFO L225 Difference]: With dead ends: 546 [2019-09-10 08:06:15,756 INFO L226 Difference]: Without dead ends: 546 [2019-09-10 08:06:15,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:06:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-10 08:06:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 394. [2019-09-10 08:06:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 508 transitions. [2019-09-10 08:06:15,767 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 508 transitions. Word has length 79 [2019-09-10 08:06:15,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:15,767 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 508 transitions. [2019-09-10 08:06:15,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:06:15,768 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 508 transitions. [2019-09-10 08:06:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 08:06:15,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:15,769 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] [2019-09-10 08:06:15,770 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:15,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:15,770 INFO L82 PathProgramCache]: Analyzing trace with hash -929977429, now seen corresponding path program 1 times [2019-09-10 08:06:15,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:15,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:15,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:15,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:15,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:15,997 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 08:06:15,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:15,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:15,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:15,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:15,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:15,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:15,998 INFO L87 Difference]: Start difference. First operand 394 states and 508 transitions. Second operand 9 states. [2019-09-10 08:06:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:17,478 INFO L93 Difference]: Finished difference Result 727 states and 961 transitions. [2019-09-10 08:06:17,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:17,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-10 08:06:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:17,484 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:06:17,485 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:06:17,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:17,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:06:17,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:06:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 507 transitions. [2019-09-10 08:06:17,501 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 507 transitions. Word has length 79 [2019-09-10 08:06:17,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:17,502 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 507 transitions. [2019-09-10 08:06:17,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 507 transitions. [2019-09-10 08:06:17,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 08:06:17,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:17,504 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] [2019-09-10 08:06:17,506 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:17,507 INFO L82 PathProgramCache]: Analyzing trace with hash -868457063, now seen corresponding path program 1 times [2019-09-10 08:06:17,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:17,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:17,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:17,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:17,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:17,713 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 08:06:17,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:17,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:17,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:17,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:17,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:17,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:17,715 INFO L87 Difference]: Start difference. First operand 394 states and 507 transitions. Second operand 9 states. [2019-09-10 08:06:19,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:19,268 INFO L93 Difference]: Finished difference Result 739 states and 982 transitions. [2019-09-10 08:06:19,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:19,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-10 08:06:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:19,272 INFO L225 Difference]: With dead ends: 739 [2019-09-10 08:06:19,272 INFO L226 Difference]: Without dead ends: 739 [2019-09-10 08:06:19,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-09-10 08:06:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 394. [2019-09-10 08:06:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 506 transitions. [2019-09-10 08:06:19,284 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 506 transitions. Word has length 79 [2019-09-10 08:06:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:19,284 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 506 transitions. [2019-09-10 08:06:19,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 506 transitions. [2019-09-10 08:06:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:06:19,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:19,286 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] [2019-09-10 08:06:19,287 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:19,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:19,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1890090262, now seen corresponding path program 1 times [2019-09-10 08:06:19,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:19,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:19,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:19,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:19,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:19,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:19,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:19,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:19,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:19,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:19,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:19,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:19,445 INFO L87 Difference]: Start difference. First operand 394 states and 506 transitions. Second operand 9 states. [2019-09-10 08:06:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:20,664 INFO L93 Difference]: Finished difference Result 727 states and 958 transitions. [2019-09-10 08:06:20,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:20,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:06:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:20,672 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:06:20,673 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:06:20,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:06:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:06:20,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 505 transitions. [2019-09-10 08:06:20,688 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 505 transitions. Word has length 81 [2019-09-10 08:06:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:20,688 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 505 transitions. [2019-09-10 08:06:20,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 505 transitions. [2019-09-10 08:06:20,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:06:20,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:20,690 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] [2019-09-10 08:06:20,691 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:20,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:20,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1898902830, now seen corresponding path program 1 times [2019-09-10 08:06:20,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:20,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:20,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:20,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:20,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:20,872 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 08:06:20,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:20,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:20,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:20,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:20,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:20,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:20,877 INFO L87 Difference]: Start difference. First operand 394 states and 505 transitions. Second operand 9 states. [2019-09-10 08:06:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:22,343 INFO L93 Difference]: Finished difference Result 735 states and 976 transitions. [2019-09-10 08:06:22,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:22,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:06:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:22,350 INFO L225 Difference]: With dead ends: 735 [2019-09-10 08:06:22,350 INFO L226 Difference]: Without dead ends: 735 [2019-09-10 08:06:22,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-10 08:06:22,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-10 08:06:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 504 transitions. [2019-09-10 08:06:22,361 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 504 transitions. Word has length 81 [2019-09-10 08:06:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:22,361 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 504 transitions. [2019-09-10 08:06:22,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 504 transitions. [2019-09-10 08:06:22,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:06:22,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:22,363 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] [2019-09-10 08:06:22,364 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:22,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:22,364 INFO L82 PathProgramCache]: Analyzing trace with hash 59601677, now seen corresponding path program 1 times [2019-09-10 08:06:22,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:22,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:22,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:22,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:22,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:22,514 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 08:06:22,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:22,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:22,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:22,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:22,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:22,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:22,516 INFO L87 Difference]: Start difference. First operand 394 states and 504 transitions. Second operand 9 states. [2019-09-10 08:06:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:23,916 INFO L93 Difference]: Finished difference Result 727 states and 956 transitions. [2019-09-10 08:06:23,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:23,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:06:23,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:23,922 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:06:23,922 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:06:23,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:23,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:06:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:06:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 503 transitions. [2019-09-10 08:06:23,933 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 503 transitions. Word has length 81 [2019-09-10 08:06:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:23,933 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 503 transitions. [2019-09-10 08:06:23,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 503 transitions. [2019-09-10 08:06:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:06:23,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:23,935 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] [2019-09-10 08:06:23,935 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:23,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:23,936 INFO L82 PathProgramCache]: Analyzing trace with hash 916645204, now seen corresponding path program 1 times [2019-09-10 08:06:23,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:23,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:23,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:23,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:23,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:24,106 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 08:06:24,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:24,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:24,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:24,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:24,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:24,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:24,109 INFO L87 Difference]: Start difference. First operand 394 states and 503 transitions. Second operand 9 states. [2019-09-10 08:06:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:25,610 INFO L93 Difference]: Finished difference Result 739 states and 974 transitions. [2019-09-10 08:06:25,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:25,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:06:25,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:25,614 INFO L225 Difference]: With dead ends: 739 [2019-09-10 08:06:25,614 INFO L226 Difference]: Without dead ends: 739 [2019-09-10 08:06:25,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-09-10 08:06:25,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 394. [2019-09-10 08:06:25,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 502 transitions. [2019-09-10 08:06:25,625 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 502 transitions. Word has length 81 [2019-09-10 08:06:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:25,625 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 502 transitions. [2019-09-10 08:06:25,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 502 transitions. [2019-09-10 08:06:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:06:25,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:25,627 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] [2019-09-10 08:06:25,627 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash -819894320, now seen corresponding path program 1 times [2019-09-10 08:06:25,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:25,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:25,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:25,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:25,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:25,777 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 08:06:25,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:25,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:25,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:25,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:25,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:25,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:25,780 INFO L87 Difference]: Start difference. First operand 394 states and 502 transitions. Second operand 9 states. [2019-09-10 08:06:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:27,202 INFO L93 Difference]: Finished difference Result 735 states and 973 transitions. [2019-09-10 08:06:27,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:27,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:06:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:27,206 INFO L225 Difference]: With dead ends: 735 [2019-09-10 08:06:27,206 INFO L226 Difference]: Without dead ends: 735 [2019-09-10 08:06:27,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:27,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-10 08:06:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-10 08:06:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 501 transitions. [2019-09-10 08:06:27,216 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 501 transitions. Word has length 81 [2019-09-10 08:06:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:27,216 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 501 transitions. [2019-09-10 08:06:27,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:27,217 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 501 transitions. [2019-09-10 08:06:27,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:06:27,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:27,218 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] [2019-09-10 08:06:27,218 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:27,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:27,219 INFO L82 PathProgramCache]: Analyzing trace with hash 494668223, now seen corresponding path program 1 times [2019-09-10 08:06:27,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:27,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:27,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:27,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:27,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:27,360 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 08:06:27,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:27,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:27,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:27,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:27,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:27,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:27,362 INFO L87 Difference]: Start difference. First operand 394 states and 501 transitions. Second operand 9 states. [2019-09-10 08:06:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:28,747 INFO L93 Difference]: Finished difference Result 727 states and 953 transitions. [2019-09-10 08:06:28,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:28,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:06:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:28,752 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:06:28,753 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:06:28,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:06:28,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:06:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 500 transitions. [2019-09-10 08:06:28,762 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 500 transitions. Word has length 81 [2019-09-10 08:06:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:28,763 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 500 transitions. [2019-09-10 08:06:28,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 500 transitions. [2019-09-10 08:06:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:06:28,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:28,764 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] [2019-09-10 08:06:28,765 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:28,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:28,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1431462676, now seen corresponding path program 1 times [2019-09-10 08:06:28,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:28,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:28,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:28,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:28,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:28,908 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 08:06:28,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:28,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:28,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:28,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:28,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:28,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:28,910 INFO L87 Difference]: Start difference. First operand 394 states and 500 transitions. Second operand 9 states. [2019-09-10 08:06:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:30,343 INFO L93 Difference]: Finished difference Result 735 states and 970 transitions. [2019-09-10 08:06:30,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:30,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:06:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:30,348 INFO L225 Difference]: With dead ends: 735 [2019-09-10 08:06:30,348 INFO L226 Difference]: Without dead ends: 735 [2019-09-10 08:06:30,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-10 08:06:30,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-10 08:06:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 499 transitions. [2019-09-10 08:06:30,358 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 499 transitions. Word has length 81 [2019-09-10 08:06:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:30,358 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 499 transitions. [2019-09-10 08:06:30,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 499 transitions. [2019-09-10 08:06:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:06:30,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:30,360 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] [2019-09-10 08:06:30,361 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:30,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:30,361 INFO L82 PathProgramCache]: Analyzing trace with hash -272719777, now seen corresponding path program 1 times [2019-09-10 08:06:30,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:30,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:30,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:30,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:30,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:30,537 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 08:06:30,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:30,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:30,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:30,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:30,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:30,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:30,538 INFO L87 Difference]: Start difference. First operand 394 states and 499 transitions. Second operand 9 states. [2019-09-10 08:06:31,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:31,873 INFO L93 Difference]: Finished difference Result 727 states and 951 transitions. [2019-09-10 08:06:31,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:31,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 08:06:31,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:31,878 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:06:31,878 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:06:31,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:06:31,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:06:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 498 transitions. [2019-09-10 08:06:31,888 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 498 transitions. Word has length 81 [2019-09-10 08:06:31,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:31,888 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 498 transitions. [2019-09-10 08:06:31,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 498 transitions. [2019-09-10 08:06:31,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:06:31,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:31,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] [2019-09-10 08:06:31,891 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:31,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:31,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1337474297, now seen corresponding path program 1 times [2019-09-10 08:06:31,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:31,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:31,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:31,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:31,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:32,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:32,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:32,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:32,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:32,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:32,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:32,093 INFO L87 Difference]: Start difference. First operand 394 states and 498 transitions. Second operand 9 states. [2019-09-10 08:06:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:33,213 INFO L93 Difference]: Finished difference Result 727 states and 950 transitions. [2019-09-10 08:06:33,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:33,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:06:33,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:33,223 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:06:33,223 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:06:33,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:06:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:06:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 497 transitions. [2019-09-10 08:06:33,233 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 497 transitions. Word has length 83 [2019-09-10 08:06:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:33,233 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 497 transitions. [2019-09-10 08:06:33,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 497 transitions. [2019-09-10 08:06:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:06:33,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:33,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:33,235 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:33,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:33,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1331235743, now seen corresponding path program 1 times [2019-09-10 08:06:33,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:33,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:33,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:33,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:33,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:33,437 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 08:06:33,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:33,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:33,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:33,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:33,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:33,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:33,440 INFO L87 Difference]: Start difference. First operand 394 states and 497 transitions. Second operand 9 states. [2019-09-10 08:06:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:34,879 INFO L93 Difference]: Finished difference Result 711 states and 923 transitions. [2019-09-10 08:06:34,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:34,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:06:34,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:34,884 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:34,884 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:34,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:34,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 496 transitions. [2019-09-10 08:06:34,893 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 496 transitions. Word has length 83 [2019-09-10 08:06:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:34,894 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 496 transitions. [2019-09-10 08:06:34,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 496 transitions. [2019-09-10 08:06:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:06:34,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:34,895 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 08:06:34,896 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:34,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:34,896 INFO L82 PathProgramCache]: Analyzing trace with hash 11721297, now seen corresponding path program 1 times [2019-09-10 08:06:34,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:34,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:34,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:34,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:34,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:35,080 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 08:06:35,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:35,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:35,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:35,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:35,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:35,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:35,082 INFO L87 Difference]: Start difference. First operand 394 states and 496 transitions. Second operand 9 states. [2019-09-10 08:06:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:36,622 INFO L93 Difference]: Finished difference Result 735 states and 962 transitions. [2019-09-10 08:06:36,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:36,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:06:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:36,627 INFO L225 Difference]: With dead ends: 735 [2019-09-10 08:06:36,627 INFO L226 Difference]: Without dead ends: 735 [2019-09-10 08:06:36,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-10 08:06:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-10 08:06:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 495 transitions. [2019-09-10 08:06:36,635 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 495 transitions. Word has length 83 [2019-09-10 08:06:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:36,636 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 495 transitions. [2019-09-10 08:06:36,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 495 transitions. [2019-09-10 08:06:36,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:06:36,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:36,637 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 08:06:36,638 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:36,638 INFO L82 PathProgramCache]: Analyzing trace with hash 116579511, now seen corresponding path program 1 times [2019-09-10 08:06:36,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:36,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:36,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:36,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:36,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:36,782 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 08:06:36,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:36,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:36,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:36,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:36,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:36,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:36,784 INFO L87 Difference]: Start difference. First operand 394 states and 495 transitions. Second operand 9 states. [2019-09-10 08:06:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:38,015 INFO L93 Difference]: Finished difference Result 711 states and 921 transitions. [2019-09-10 08:06:38,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:38,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:06:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:38,020 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:38,020 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:38,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:38,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 494 transitions. [2019-09-10 08:06:38,030 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 494 transitions. Word has length 83 [2019-09-10 08:06:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:38,030 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 494 transitions. [2019-09-10 08:06:38,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 494 transitions. [2019-09-10 08:06:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:06:38,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:38,032 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 08:06:38,033 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:38,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:38,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2029458257, now seen corresponding path program 1 times [2019-09-10 08:06:38,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:38,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:38,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:38,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:38,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:38,181 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 08:06:38,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:38,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:38,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:38,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:38,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:38,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:38,183 INFO L87 Difference]: Start difference. First operand 394 states and 494 transitions. Second operand 9 states. [2019-09-10 08:06:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:39,637 INFO L93 Difference]: Finished difference Result 711 states and 920 transitions. [2019-09-10 08:06:39,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:39,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:06:39,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:39,642 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:39,642 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:39,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 493 transitions. [2019-09-10 08:06:39,650 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 493 transitions. Word has length 83 [2019-09-10 08:06:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:39,651 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 493 transitions. [2019-09-10 08:06:39,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 493 transitions. [2019-09-10 08:06:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:06:39,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:39,652 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 08:06:39,653 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:39,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:39,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2037194958, now seen corresponding path program 1 times [2019-09-10 08:06:39,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:39,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:39,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:39,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:39,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:39,796 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 08:06:39,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:39,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:39,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:39,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:39,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:39,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:39,798 INFO L87 Difference]: Start difference. First operand 394 states and 493 transitions. Second operand 9 states. [2019-09-10 08:06:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:41,301 INFO L93 Difference]: Finished difference Result 711 states and 918 transitions. [2019-09-10 08:06:41,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:41,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:06:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:41,307 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:41,307 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:41,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 492 transitions. [2019-09-10 08:06:41,315 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 492 transitions. Word has length 83 [2019-09-10 08:06:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:41,315 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 492 transitions. [2019-09-10 08:06:41,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 492 transitions. [2019-09-10 08:06:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:06:41,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:41,318 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 08:06:41,318 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:41,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:41,319 INFO L82 PathProgramCache]: Analyzing trace with hash -315572149, now seen corresponding path program 1 times [2019-09-10 08:06:41,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:41,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:41,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:41,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:41,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:06:41,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:41,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:41,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:41,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:41,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:41,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:41,453 INFO L87 Difference]: Start difference. First operand 394 states and 492 transitions. Second operand 9 states. [2019-09-10 08:06:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:42,733 INFO L93 Difference]: Finished difference Result 711 states and 916 transitions. [2019-09-10 08:06:42,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:42,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:06:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:42,737 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:42,737 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:42,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 491 transitions. [2019-09-10 08:06:42,745 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 491 transitions. Word has length 83 [2019-09-10 08:06:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:42,746 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 491 transitions. [2019-09-10 08:06:42,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 491 transitions. [2019-09-10 08:06:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:06:42,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:42,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:42,748 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:42,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:42,748 INFO L82 PathProgramCache]: Analyzing trace with hash -697978443, now seen corresponding path program 1 times [2019-09-10 08:06:42,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:42,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:42,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:42,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:42,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:42,908 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 08:06:42,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:42,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:42,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:42,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:42,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:42,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:42,911 INFO L87 Difference]: Start difference. First operand 394 states and 491 transitions. Second operand 9 states. [2019-09-10 08:06:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:44,348 INFO L93 Difference]: Finished difference Result 711 states and 915 transitions. [2019-09-10 08:06:44,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:44,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:06:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:44,353 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:44,353 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:44,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 490 transitions. [2019-09-10 08:06:44,362 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 490 transitions. Word has length 83 [2019-09-10 08:06:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:44,362 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 490 transitions. [2019-09-10 08:06:44,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 490 transitions. [2019-09-10 08:06:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:06:44,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:44,363 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 08:06:44,364 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1927606278, now seen corresponding path program 1 times [2019-09-10 08:06:44,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:44,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:44,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:44,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:44,509 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 08:06:44,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:44,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:44,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:44,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:44,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:44,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:44,511 INFO L87 Difference]: Start difference. First operand 394 states and 490 transitions. Second operand 9 states. [2019-09-10 08:06:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:45,924 INFO L93 Difference]: Finished difference Result 711 states and 913 transitions. [2019-09-10 08:06:45,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:45,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:06:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:45,928 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:45,928 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:45,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:45,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 489 transitions. [2019-09-10 08:06:45,935 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 489 transitions. Word has length 83 [2019-09-10 08:06:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:45,935 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 489 transitions. [2019-09-10 08:06:45,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 489 transitions. [2019-09-10 08:06:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:06:45,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:45,937 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 08:06:45,937 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:45,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:45,937 INFO L82 PathProgramCache]: Analyzing trace with hash 416569401, now seen corresponding path program 1 times [2019-09-10 08:06:45,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:45,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:45,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:45,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:45,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:46,073 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 08:06:46,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:46,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:46,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:46,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:46,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:46,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:46,075 INFO L87 Difference]: Start difference. First operand 394 states and 489 transitions. Second operand 9 states. [2019-09-10 08:06:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:47,495 INFO L93 Difference]: Finished difference Result 711 states and 912 transitions. [2019-09-10 08:06:47,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:47,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:06:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:47,499 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:47,499 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:47,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 488 transitions. [2019-09-10 08:06:47,507 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 488 transitions. Word has length 83 [2019-09-10 08:06:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:47,507 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 488 transitions. [2019-09-10 08:06:47,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 488 transitions. [2019-09-10 08:06:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:06:47,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:47,509 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 08:06:47,509 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:47,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:47,509 INFO L82 PathProgramCache]: Analyzing trace with hash -961144879, now seen corresponding path program 1 times [2019-09-10 08:06:47,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:47,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:47,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:47,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:47,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:47,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 08:06:47,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:47,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:47,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:47,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:47,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:47,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:47,642 INFO L87 Difference]: Start difference. First operand 394 states and 488 transitions. Second operand 9 states. [2019-09-10 08:06:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:48,956 INFO L93 Difference]: Finished difference Result 727 states and 935 transitions. [2019-09-10 08:06:48,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:48,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:06:48,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:48,961 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:06:48,961 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:06:48,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:48,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:06:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:06:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 487 transitions. [2019-09-10 08:06:48,968 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 487 transitions. Word has length 83 [2019-09-10 08:06:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:48,968 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 487 transitions. [2019-09-10 08:06:48,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 487 transitions. [2019-09-10 08:06:48,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:06:48,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:48,970 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 08:06:48,970 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:48,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:48,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1104924732, now seen corresponding path program 1 times [2019-09-10 08:06:48,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:48,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:48,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:48,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:48,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:49,100 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 08:06:49,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:49,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:49,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:49,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:49,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:49,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:49,102 INFO L87 Difference]: Start difference. First operand 394 states and 487 transitions. Second operand 9 states. [2019-09-10 08:06:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:50,590 INFO L93 Difference]: Finished difference Result 711 states and 909 transitions. [2019-09-10 08:06:50,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:50,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:06:50,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:50,593 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:50,593 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:50,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:50,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 486 transitions. [2019-09-10 08:06:50,601 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 486 transitions. Word has length 83 [2019-09-10 08:06:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:50,601 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 486 transitions. [2019-09-10 08:06:50,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 486 transitions. [2019-09-10 08:06:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 08:06:50,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:50,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] [2019-09-10 08:06:50,603 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:50,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1641831093, now seen corresponding path program 1 times [2019-09-10 08:06:50,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:50,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:50,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:50,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:50,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:50,750 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 08:06:50,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:50,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:50,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:50,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:50,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:50,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:50,752 INFO L87 Difference]: Start difference. First operand 394 states and 486 transitions. Second operand 9 states. [2019-09-10 08:06:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:52,184 INFO L93 Difference]: Finished difference Result 711 states and 908 transitions. [2019-09-10 08:06:52,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:52,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-10 08:06:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:52,188 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:52,188 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:52,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 485 transitions. [2019-09-10 08:06:52,196 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 485 transitions. Word has length 83 [2019-09-10 08:06:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:52,196 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 485 transitions. [2019-09-10 08:06:52,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:52,196 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 485 transitions. [2019-09-10 08:06:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:06:52,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:52,198 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 08:06:52,198 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:52,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:52,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1207818414, now seen corresponding path program 1 times [2019-09-10 08:06:52,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:52,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:52,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:52,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:52,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:52,334 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 08:06:52,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:52,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:52,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:52,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:52,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:52,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:52,337 INFO L87 Difference]: Start difference. First operand 394 states and 485 transitions. Second operand 9 states. [2019-09-10 08:06:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:53,703 INFO L93 Difference]: Finished difference Result 710 states and 906 transitions. [2019-09-10 08:06:53,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:53,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:06:53,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:53,709 INFO L225 Difference]: With dead ends: 710 [2019-09-10 08:06:53,710 INFO L226 Difference]: Without dead ends: 710 [2019-09-10 08:06:53,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-09-10 08:06:53,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 393. [2019-09-10 08:06:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-09-10 08:06:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 483 transitions. [2019-09-10 08:06:53,715 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 483 transitions. Word has length 84 [2019-09-10 08:06:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:53,715 INFO L475 AbstractCegarLoop]: Abstraction has 393 states and 483 transitions. [2019-09-10 08:06:53,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 483 transitions. [2019-09-10 08:06:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:06:53,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:53,716 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 08:06:53,717 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:53,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:53,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1370154188, now seen corresponding path program 1 times [2019-09-10 08:06:53,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:53,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:53,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:53,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:53,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:55,754 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 08:06:55,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:55,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:06:55,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:55,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:06:55,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:06:55,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:06:55,756 INFO L87 Difference]: Start difference. First operand 393 states and 483 transitions. Second operand 26 states. [2019-09-10 08:06:55,912 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 08:06:56,957 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 08:06:57,221 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-10 08:06:57,488 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-10 08:06:57,873 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-09-10 08:06:58,086 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:06:58,299 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:06:58,574 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:07:02,682 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 08:07:03,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:03,655 INFO L93 Difference]: Finished difference Result 759 states and 934 transitions. [2019-09-10 08:07:03,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:07:03,655 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 85 [2019-09-10 08:07:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:03,660 INFO L225 Difference]: With dead ends: 759 [2019-09-10 08:07:03,660 INFO L226 Difference]: Without dead ends: 759 [2019-09-10 08:07:03,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=354, Invalid=1368, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:07:03,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-09-10 08:07:03,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 413. [2019-09-10 08:07:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-09-10 08:07:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 510 transitions. [2019-09-10 08:07:03,668 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 510 transitions. Word has length 85 [2019-09-10 08:07:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:03,669 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 510 transitions. [2019-09-10 08:07:03,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:07:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 510 transitions. [2019-09-10 08:07:03,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:07:03,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:03,670 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 08:07:03,671 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:03,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:03,671 INFO L82 PathProgramCache]: Analyzing trace with hash -230689484, now seen corresponding path program 1 times [2019-09-10 08:07:03,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:03,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:03,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:03,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:03,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:04,403 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 08:07:04,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:04,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:07:04,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:04,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:07:04,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:07:04,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:07:04,404 INFO L87 Difference]: Start difference. First operand 413 states and 510 transitions. Second operand 17 states. [2019-09-10 08:07:05,046 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:07:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:07,151 INFO L93 Difference]: Finished difference Result 792 states and 1012 transitions. [2019-09-10 08:07:07,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:07:07,151 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-10 08:07:07,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:07,154 INFO L225 Difference]: With dead ends: 792 [2019-09-10 08:07:07,154 INFO L226 Difference]: Without dead ends: 792 [2019-09-10 08:07:07,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:07:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-09-10 08:07:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 402. [2019-09-10 08:07:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-09-10 08:07:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 495 transitions. [2019-09-10 08:07:07,163 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 495 transitions. Word has length 85 [2019-09-10 08:07:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:07,164 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 495 transitions. [2019-09-10 08:07:07,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:07:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 495 transitions. [2019-09-10 08:07:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:07:07,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:07,165 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 08:07:07,166 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:07,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:07,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1185402698, now seen corresponding path program 1 times [2019-09-10 08:07:07,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:07,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:07,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:07,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:07,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:08,044 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 08:07:08,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:08,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:07:08,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:08,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:07:08,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:07:08,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:07:08,046 INFO L87 Difference]: Start difference. First operand 402 states and 495 transitions. Second operand 16 states. [2019-09-10 08:07:08,629 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 08:07:08,899 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:07:09,062 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:07:09,221 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 08:07:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:11,367 INFO L93 Difference]: Finished difference Result 698 states and 842 transitions. [2019-09-10 08:07:11,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:07:11,368 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 85 [2019-09-10 08:07:11,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:11,372 INFO L225 Difference]: With dead ends: 698 [2019-09-10 08:07:11,372 INFO L226 Difference]: Without dead ends: 698 [2019-09-10 08:07:11,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:07:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-10 08:07:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 419. [2019-09-10 08:07:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-10 08:07:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 519 transitions. [2019-09-10 08:07:11,381 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 519 transitions. Word has length 85 [2019-09-10 08:07:11,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:11,381 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 519 transitions. [2019-09-10 08:07:11,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:07:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 519 transitions. [2019-09-10 08:07:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:07:11,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:11,382 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 08:07:11,383 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:11,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:11,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1294662844, now seen corresponding path program 1 times [2019-09-10 08:07:11,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:11,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:11,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:11,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:11,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:12,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 08:07:12,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:12,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:07:12,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:12,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:07:12,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:07:12,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:07:12,174 INFO L87 Difference]: Start difference. First operand 419 states and 519 transitions. Second operand 17 states. [2019-09-10 08:07:12,756 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:07:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:14,541 INFO L93 Difference]: Finished difference Result 743 states and 952 transitions. [2019-09-10 08:07:14,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:07:14,542 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-10 08:07:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:14,546 INFO L225 Difference]: With dead ends: 743 [2019-09-10 08:07:14,547 INFO L226 Difference]: Without dead ends: 743 [2019-09-10 08:07:14,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:07:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-09-10 08:07:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 395. [2019-09-10 08:07:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-09-10 08:07:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 486 transitions. [2019-09-10 08:07:14,555 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 486 transitions. Word has length 85 [2019-09-10 08:07:14,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:14,555 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 486 transitions. [2019-09-10 08:07:14,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:07:14,555 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 486 transitions. [2019-09-10 08:07:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:07:14,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:14,557 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 08:07:14,557 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:14,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:14,557 INFO L82 PathProgramCache]: Analyzing trace with hash 181793350, now seen corresponding path program 1 times [2019-09-10 08:07:14,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:14,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:14,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:14,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:14,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:15,364 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 08:07:15,615 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 08:07:16,490 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 08:07:16,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:16,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 08:07:16,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:16,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 08:07:16,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 08:07:16,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:07:16,492 INFO L87 Difference]: Start difference. First operand 395 states and 486 transitions. Second operand 27 states. [2019-09-10 08:07:16,660 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-10 08:07:17,533 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 08:07:18,006 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-09-10 08:07:18,345 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-10 08:07:18,770 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2019-09-10 08:07:19,211 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2019-09-10 08:07:19,439 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 08:07:19,693 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 08:07:19,917 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-10 08:07:20,185 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 08:07:20,427 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 08:07:20,787 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 08:07:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:24,771 INFO L93 Difference]: Finished difference Result 672 states and 827 transitions. [2019-09-10 08:07:24,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:07:24,771 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2019-09-10 08:07:24,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:24,775 INFO L225 Difference]: With dead ends: 672 [2019-09-10 08:07:24,775 INFO L226 Difference]: Without dead ends: 672 [2019-09-10 08:07:24,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=433, Invalid=1547, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:07:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-10 08:07:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 406. [2019-09-10 08:07:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-09-10 08:07:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 498 transitions. [2019-09-10 08:07:24,781 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 498 transitions. Word has length 85 [2019-09-10 08:07:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:24,781 INFO L475 AbstractCegarLoop]: Abstraction has 406 states and 498 transitions. [2019-09-10 08:07:24,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 08:07:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 498 transitions. [2019-09-10 08:07:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:07:24,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:24,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:24,784 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:24,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:24,784 INFO L82 PathProgramCache]: Analyzing trace with hash 151515162, now seen corresponding path program 1 times [2019-09-10 08:07:24,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:24,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:24,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:24,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:24,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:25,584 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 08:07:25,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:25,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:07:25,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:25,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:07:25,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:07:25,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:07:25,585 INFO L87 Difference]: Start difference. First operand 406 states and 498 transitions. Second operand 17 states. [2019-09-10 08:07:26,133 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:07:26,292 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:07:27,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:27,596 INFO L93 Difference]: Finished difference Result 722 states and 923 transitions. [2019-09-10 08:07:27,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:07:27,597 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-10 08:07:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:27,600 INFO L225 Difference]: With dead ends: 722 [2019-09-10 08:07:27,600 INFO L226 Difference]: Without dead ends: 722 [2019-09-10 08:07:27,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:07:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-09-10 08:07:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 377. [2019-09-10 08:07:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-10 08:07:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 460 transitions. [2019-09-10 08:07:27,607 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 460 transitions. Word has length 85 [2019-09-10 08:07:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:27,607 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 460 transitions. [2019-09-10 08:07:27,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:07:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 460 transitions. [2019-09-10 08:07:27,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:07:27,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:27,609 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 08:07:27,609 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:27,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:27,610 INFO L82 PathProgramCache]: Analyzing trace with hash 626554292, now seen corresponding path program 1 times [2019-09-10 08:07:27,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:27,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:27,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:27,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:27,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:28,371 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 08:07:28,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:28,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:07:28,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:28,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:07:28,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:07:28,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:07:28,372 INFO L87 Difference]: Start difference. First operand 377 states and 460 transitions. Second operand 17 states. [2019-09-10 08:07:29,000 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:07:29,160 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:07:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:31,283 INFO L93 Difference]: Finished difference Result 696 states and 887 transitions. [2019-09-10 08:07:31,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:07:31,284 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2019-09-10 08:07:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:31,286 INFO L225 Difference]: With dead ends: 696 [2019-09-10 08:07:31,286 INFO L226 Difference]: Without dead ends: 696 [2019-09-10 08:07:31,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:07:31,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-09-10 08:07:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 376. [2019-09-10 08:07:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-10 08:07:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 457 transitions. [2019-09-10 08:07:31,292 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 457 transitions. Word has length 85 [2019-09-10 08:07:31,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:31,292 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 457 transitions. [2019-09-10 08:07:31,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:07:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 457 transitions. [2019-09-10 08:07:31,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:07:31,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:31,294 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 08:07:31,294 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:31,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:31,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1764599692, now seen corresponding path program 1 times [2019-09-10 08:07:31,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:31,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:31,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:31,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:31,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:32,740 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 08:07:32,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:32,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:07:32,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:32,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:07:32,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:07:32,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:07:32,741 INFO L87 Difference]: Start difference. First operand 376 states and 457 transitions. Second operand 25 states. [2019-09-10 08:07:33,727 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 08:07:34,022 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 08:07:34,291 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 08:07:34,622 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-09-10 08:07:34,821 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 08:07:35,015 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 08:07:35,207 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:07:35,443 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:07:35,673 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:07:35,929 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 08:07:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:39,397 INFO L93 Difference]: Finished difference Result 692 states and 859 transitions. [2019-09-10 08:07:39,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:07:39,397 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-09-10 08:07:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:39,402 INFO L225 Difference]: With dead ends: 692 [2019-09-10 08:07:39,402 INFO L226 Difference]: Without dead ends: 692 [2019-09-10 08:07:39,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=415, Invalid=1391, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 08:07:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-09-10 08:07:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 387. [2019-09-10 08:07:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-09-10 08:07:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 469 transitions. [2019-09-10 08:07:39,410 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 469 transitions. Word has length 85 [2019-09-10 08:07:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:39,410 INFO L475 AbstractCegarLoop]: Abstraction has 387 states and 469 transitions. [2019-09-10 08:07:39,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:07:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 469 transitions. [2019-09-10 08:07:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:07:39,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:39,412 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 08:07:39,412 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:39,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1793652703, now seen corresponding path program 1 times [2019-09-10 08:07:39,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:39,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:39,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:39,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:39,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:39,945 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 08:07:39,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:39,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:07:39,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:39,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:07:39,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:07:39,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:07:39,946 INFO L87 Difference]: Start difference. First operand 387 states and 469 transitions. Second operand 15 states. [2019-09-10 08:07:41,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:41,673 INFO L93 Difference]: Finished difference Result 643 states and 820 transitions. [2019-09-10 08:07:41,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:07:41,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2019-09-10 08:07:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:41,678 INFO L225 Difference]: With dead ends: 643 [2019-09-10 08:07:41,679 INFO L226 Difference]: Without dead ends: 643 [2019-09-10 08:07:41,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:07:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-10 08:07:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 346. [2019-09-10 08:07:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-10 08:07:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 420 transitions. [2019-09-10 08:07:41,690 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 420 transitions. Word has length 85 [2019-09-10 08:07:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:41,690 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 420 transitions. [2019-09-10 08:07:41,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:07:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 420 transitions. [2019-09-10 08:07:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:07:41,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:41,691 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 08:07:41,692 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:41,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2017902633, now seen corresponding path program 1 times [2019-09-10 08:07:41,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:41,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:41,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:41,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:41,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:41,897 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 08:07:41,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:41,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:07:41,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:41,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:07:41,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:07:41,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:07:41,899 INFO L87 Difference]: Start difference. First operand 346 states and 420 transitions. Second operand 9 states. [2019-09-10 08:07:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:42,847 INFO L93 Difference]: Finished difference Result 617 states and 792 transitions. [2019-09-10 08:07:42,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:07:42,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-10 08:07:42,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:42,850 INFO L225 Difference]: With dead ends: 617 [2019-09-10 08:07:42,850 INFO L226 Difference]: Without dead ends: 617 [2019-09-10 08:07:42,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:07:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-10 08:07:42,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 346. [2019-09-10 08:07:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-10 08:07:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 418 transitions. [2019-09-10 08:07:42,856 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 418 transitions. Word has length 86 [2019-09-10 08:07:42,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:42,856 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 418 transitions. [2019-09-10 08:07:42,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:07:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 418 transitions. [2019-09-10 08:07:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:07:42,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:42,858 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 08:07:42,858 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:42,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:42,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1859590783, now seen corresponding path program 1 times [2019-09-10 08:07:42,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:42,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:42,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:42,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:42,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:43,003 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 08:07:43,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:43,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:07:43,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:43,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:07:43,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:07:43,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:07:43,005 INFO L87 Difference]: Start difference. First operand 346 states and 418 transitions. Second operand 9 states. [2019-09-10 08:07:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:44,170 INFO L93 Difference]: Finished difference Result 616 states and 788 transitions. [2019-09-10 08:07:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:07:44,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-10 08:07:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:44,173 INFO L225 Difference]: With dead ends: 616 [2019-09-10 08:07:44,173 INFO L226 Difference]: Without dead ends: 616 [2019-09-10 08:07:44,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:07:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-10 08:07:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 346. [2019-09-10 08:07:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-10 08:07:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 416 transitions. [2019-09-10 08:07:44,179 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 416 transitions. Word has length 86 [2019-09-10 08:07:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:44,180 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 416 transitions. [2019-09-10 08:07:44,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:07:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 416 transitions. [2019-09-10 08:07:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:07:44,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:44,180 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 08:07:44,181 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:44,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:44,181 INFO L82 PathProgramCache]: Analyzing trace with hash 163610703, now seen corresponding path program 1 times [2019-09-10 08:07:44,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:44,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:44,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:44,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:44,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:44,582 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 08:07:44,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:44,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:07:44,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:44,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:07:44,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:07:44,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:07:44,586 INFO L87 Difference]: Start difference. First operand 346 states and 416 transitions. Second operand 12 states. [2019-09-10 08:07:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:45,750 INFO L93 Difference]: Finished difference Result 773 states and 1011 transitions. [2019-09-10 08:07:45,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:07:45,750 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-09-10 08:07:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:45,751 INFO L225 Difference]: With dead ends: 773 [2019-09-10 08:07:45,751 INFO L226 Difference]: Without dead ends: 773 [2019-09-10 08:07:45,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:07:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-09-10 08:07:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 324. [2019-09-10 08:07:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-09-10 08:07:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 391 transitions. [2019-09-10 08:07:45,757 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 391 transitions. Word has length 86 [2019-09-10 08:07:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:45,757 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 391 transitions. [2019-09-10 08:07:45,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:07:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 391 transitions. [2019-09-10 08:07:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:07:45,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:45,758 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 08:07:45,759 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:45,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:45,759 INFO L82 PathProgramCache]: Analyzing trace with hash 28003791, now seen corresponding path program 1 times [2019-09-10 08:07:45,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:45,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:45,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:45,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:45,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:46,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 08:07:46,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:46,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:07:46,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:46,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:07:46,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:07:46,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:07:46,374 INFO L87 Difference]: Start difference. First operand 324 states and 391 transitions. Second operand 16 states. [2019-09-10 08:07:47,467 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:07:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:48,756 INFO L93 Difference]: Finished difference Result 753 states and 988 transitions. [2019-09-10 08:07:48,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:07:48,756 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-10 08:07:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:48,757 INFO L225 Difference]: With dead ends: 753 [2019-09-10 08:07:48,757 INFO L226 Difference]: Without dead ends: 753 [2019-09-10 08:07:48,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:07:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-10 08:07:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 330. [2019-09-10 08:07:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-10 08:07:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 398 transitions. [2019-09-10 08:07:48,765 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 398 transitions. Word has length 86 [2019-09-10 08:07:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:48,766 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 398 transitions. [2019-09-10 08:07:48,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:07:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 398 transitions. [2019-09-10 08:07:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:07:48,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:48,767 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 08:07:48,767 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:48,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:48,768 INFO L82 PathProgramCache]: Analyzing trace with hash 676927323, now seen corresponding path program 1 times [2019-09-10 08:07:48,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:48,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:48,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:48,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:48,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:49,339 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 08:07:49,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:49,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:07:49,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:49,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:07:49,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:07:49,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:07:49,341 INFO L87 Difference]: Start difference. First operand 330 states and 398 transitions. Second operand 16 states. [2019-09-10 08:07:50,308 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:07:51,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:51,140 INFO L93 Difference]: Finished difference Result 472 states and 579 transitions. [2019-09-10 08:07:51,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:07:51,140 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-10 08:07:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:51,141 INFO L225 Difference]: With dead ends: 472 [2019-09-10 08:07:51,142 INFO L226 Difference]: Without dead ends: 472 [2019-09-10 08:07:51,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:07:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-10 08:07:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 319. [2019-09-10 08:07:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-10 08:07:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2019-09-10 08:07:51,147 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 86 [2019-09-10 08:07:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:51,147 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2019-09-10 08:07:51,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:07:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2019-09-10 08:07:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:07:51,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:51,148 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 08:07:51,148 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:51,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1971516155, now seen corresponding path program 1 times [2019-09-10 08:07:51,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:51,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:51,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:51,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:51,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:51,845 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 08:07:51,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:51,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:07:51,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:51,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:07:51,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:07:51,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:07:51,846 INFO L87 Difference]: Start difference. First operand 319 states and 384 transitions. Second operand 16 states. [2019-09-10 08:07:52,446 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:07:52,589 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 08:07:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:53,934 INFO L93 Difference]: Finished difference Result 504 states and 612 transitions. [2019-09-10 08:07:53,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:07:53,935 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-10 08:07:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:53,936 INFO L225 Difference]: With dead ends: 504 [2019-09-10 08:07:53,937 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 08:07:53,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:07:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 08:07:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 319. [2019-09-10 08:07:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-10 08:07:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2019-09-10 08:07:53,942 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 86 [2019-09-10 08:07:53,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:53,942 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2019-09-10 08:07:53,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:07:53,942 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2019-09-10 08:07:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:07:53,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:53,943 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 08:07:53,943 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:53,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:53,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1312927659, now seen corresponding path program 1 times [2019-09-10 08:07:53,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:53,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:53,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:53,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:53,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:54,409 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 08:07:54,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:54,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:07:54,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:54,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:07:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:07:54,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:07:54,411 INFO L87 Difference]: Start difference. First operand 319 states and 384 transitions. Second operand 12 states. [2019-09-10 08:07:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:55,636 INFO L93 Difference]: Finished difference Result 465 states and 566 transitions. [2019-09-10 08:07:55,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:07:55,637 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-09-10 08:07:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:55,638 INFO L225 Difference]: With dead ends: 465 [2019-09-10 08:07:55,639 INFO L226 Difference]: Without dead ends: 465 [2019-09-10 08:07:55,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:07:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-10 08:07:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 315. [2019-09-10 08:07:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-10 08:07:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 379 transitions. [2019-09-10 08:07:55,645 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 379 transitions. Word has length 86 [2019-09-10 08:07:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:55,645 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 379 transitions. [2019-09-10 08:07:55,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:07:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 379 transitions. [2019-09-10 08:07:55,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:07:55,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:55,646 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 08:07:55,647 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:55,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:55,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1341980670, now seen corresponding path program 1 times [2019-09-10 08:07:55,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:55,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:55,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:55,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:55,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:56,285 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 08:07:56,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:56,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:07:56,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:56,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:07:56,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:07:56,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:07:56,286 INFO L87 Difference]: Start difference. First operand 315 states and 379 transitions. Second operand 17 states. [2019-09-10 08:07:56,426 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2019-09-10 08:07:57,108 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-09-10 08:07:57,272 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 08:07:57,436 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 08:07:57,612 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 08:07:57,793 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 08:07:58,059 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-10 08:07:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:59,393 INFO L93 Difference]: Finished difference Result 1003 states and 1353 transitions. [2019-09-10 08:07:59,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:07:59,394 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-09-10 08:07:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:59,396 INFO L225 Difference]: With dead ends: 1003 [2019-09-10 08:07:59,396 INFO L226 Difference]: Without dead ends: 1003 [2019-09-10 08:07:59,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:07:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-09-10 08:07:59,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 291. [2019-09-10 08:07:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-10 08:07:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 348 transitions. [2019-09-10 08:07:59,402 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 348 transitions. Word has length 86 [2019-09-10 08:07:59,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:59,403 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 348 transitions. [2019-09-10 08:07:59,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:07:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 348 transitions. [2019-09-10 08:07:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:07:59,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:59,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:59,404 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:59,404 INFO L82 PathProgramCache]: Analyzing trace with hash 151346387, now seen corresponding path program 1 times [2019-09-10 08:07:59,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:59,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:59,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:59,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:59,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:00,058 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 08:08:00,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:00,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:08:00,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:00,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:08:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:08:00,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:08:00,059 INFO L87 Difference]: Start difference. First operand 291 states and 348 transitions. Second operand 15 states. [2019-09-10 08:08:00,252 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 08:08:00,596 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:08:00,821 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 08:08:01,081 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:08:01,285 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2019-09-10 08:08:01,504 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-10 08:08:01,727 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-09-10 08:08:02,105 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-09-10 08:08:02,605 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2019-09-10 08:08:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:03,994 INFO L93 Difference]: Finished difference Result 993 states and 1339 transitions. [2019-09-10 08:08:03,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:08:03,995 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-09-10 08:08:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:03,997 INFO L225 Difference]: With dead ends: 993 [2019-09-10 08:08:03,997 INFO L226 Difference]: Without dead ends: 993 [2019-09-10 08:08:03,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=234, Invalid=758, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:08:03,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-09-10 08:08:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 254. [2019-09-10 08:08:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-10 08:08:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 304 transitions. [2019-09-10 08:08:04,002 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 304 transitions. Word has length 86 [2019-09-10 08:08:04,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:04,003 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 304 transitions. [2019-09-10 08:08:04,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:08:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 304 transitions. [2019-09-10 08:08:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:08:04,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:04,003 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 08:08:04,004 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:04,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash 470342809, now seen corresponding path program 1 times [2019-09-10 08:08:04,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:04,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:04,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:04,128 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 08:08:04,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:04,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:08:04,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:04,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:08:04,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:08:04,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:08:04,129 INFO L87 Difference]: Start difference. First operand 254 states and 304 transitions. Second operand 9 states. [2019-09-10 08:08:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:04,871 INFO L93 Difference]: Finished difference Result 377 states and 460 transitions. [2019-09-10 08:08:04,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:08:04,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:08:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:04,872 INFO L225 Difference]: With dead ends: 377 [2019-09-10 08:08:04,873 INFO L226 Difference]: Without dead ends: 377 [2019-09-10 08:08:04,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:08:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-10 08:08:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 254. [2019-09-10 08:08:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-10 08:08:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 302 transitions. [2019-09-10 08:08:04,879 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 302 transitions. Word has length 87 [2019-09-10 08:08:04,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:04,879 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 302 transitions. [2019-09-10 08:08:04,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:08:04,880 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 302 transitions. [2019-09-10 08:08:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:08:04,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:04,880 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 08:08:04,881 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1658746276, now seen corresponding path program 1 times [2019-09-10 08:08:04,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:04,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:04,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:04,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:04,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:05,297 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 08:08:05,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:05,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:08:05,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:05,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:08:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:08:05,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:08:05,300 INFO L87 Difference]: Start difference. First operand 254 states and 302 transitions. Second operand 9 states. [2019-09-10 08:08:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:05,821 INFO L93 Difference]: Finished difference Result 475 states and 612 transitions. [2019-09-10 08:08:05,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:08:05,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:08:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:05,824 INFO L225 Difference]: With dead ends: 475 [2019-09-10 08:08:05,824 INFO L226 Difference]: Without dead ends: 475 [2019-09-10 08:08:05,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:08:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-10 08:08:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 214. [2019-09-10 08:08:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-10 08:08:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 257 transitions. [2019-09-10 08:08:05,831 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 257 transitions. Word has length 87 [2019-09-10 08:08:05,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:05,832 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 257 transitions. [2019-09-10 08:08:05,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:08:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 257 transitions. [2019-09-10 08:08:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:08:05,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:05,833 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 08:08:05,834 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:05,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:05,834 INFO L82 PathProgramCache]: Analyzing trace with hash -266310598, now seen corresponding path program 1 times [2019-09-10 08:08:05,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:05,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:05,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:05,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:05,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:06,351 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 08:08:06,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:06,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:08:06,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:06,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:08:06,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:08:06,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:08:06,352 INFO L87 Difference]: Start difference. First operand 214 states and 257 transitions. Second operand 13 states. [2019-09-10 08:08:06,830 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-09-10 08:08:07,044 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-10 08:08:07,235 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-10 08:08:07,502 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-10 08:08:07,747 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-09-10 08:08:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:08,253 INFO L93 Difference]: Finished difference Result 583 states and 788 transitions. [2019-09-10 08:08:08,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:08:08,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2019-09-10 08:08:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:08,256 INFO L225 Difference]: With dead ends: 583 [2019-09-10 08:08:08,256 INFO L226 Difference]: Without dead ends: 583 [2019-09-10 08:08:08,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:08:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-10 08:08:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 164. [2019-09-10 08:08:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-10 08:08:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2019-09-10 08:08:08,274 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 87 [2019-09-10 08:08:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:08,274 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2019-09-10 08:08:08,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:08:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2019-09-10 08:08:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:08:08,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:08,275 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 08:08:08,276 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1545293458, now seen corresponding path program 1 times [2019-09-10 08:08:08,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:08,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:08,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:08,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:08,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:09,019 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 08:08:09,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:09,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:08:09,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:09,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:08:09,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:08:09,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:08:09,021 INFO L87 Difference]: Start difference. First operand 164 states and 201 transitions. Second operand 16 states. [2019-09-10 08:08:09,800 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 08:08:09,958 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 08:08:10,114 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 08:08:10,258 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 08:08:10,461 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-09-10 08:08:10,653 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-09-10 08:08:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:11,245 INFO L93 Difference]: Finished difference Result 559 states and 760 transitions. [2019-09-10 08:08:11,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:08:11,246 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-09-10 08:08:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:11,247 INFO L225 Difference]: With dead ends: 559 [2019-09-10 08:08:11,247 INFO L226 Difference]: Without dead ends: 559 [2019-09-10 08:08:11,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:08:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-10 08:08:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 188. [2019-09-10 08:08:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-10 08:08:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 230 transitions. [2019-09-10 08:08:11,251 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 230 transitions. Word has length 88 [2019-09-10 08:08:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:11,251 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 230 transitions. [2019-09-10 08:08:11,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:08:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 230 transitions. [2019-09-10 08:08:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:08:11,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:11,252 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 08:08:11,252 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:11,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:11,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1695614251, now seen corresponding path program 1 times [2019-09-10 08:08:11,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:11,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:11,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:11,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:11,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:11,634 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 08:08:11,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:11,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:08:11,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:11,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:08:11,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:08:11,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:08:11,635 INFO L87 Difference]: Start difference. First operand 188 states and 230 transitions. Second operand 12 states. [2019-09-10 08:08:12,176 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:08:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:12,878 INFO L93 Difference]: Finished difference Result 541 states and 742 transitions. [2019-09-10 08:08:12,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:08:12,879 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-09-10 08:08:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:12,880 INFO L225 Difference]: With dead ends: 541 [2019-09-10 08:08:12,881 INFO L226 Difference]: Without dead ends: 541 [2019-09-10 08:08:12,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:08:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-10 08:08:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 158. [2019-09-10 08:08:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-10 08:08:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 195 transitions. [2019-09-10 08:08:12,885 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 195 transitions. Word has length 89 [2019-09-10 08:08:12,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:12,886 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 195 transitions. [2019-09-10 08:08:12,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:08:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 195 transitions. [2019-09-10 08:08:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:08:12,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:12,887 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:12,887 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1499104933, now seen corresponding path program 1 times [2019-09-10 08:08:12,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:12,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:12,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:12,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:12,980 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 08:08:12,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:12,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:08:12,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:12,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:08:12,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:08:12,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:08:12,982 INFO L87 Difference]: Start difference. First operand 158 states and 195 transitions. Second operand 3 states. [2019-09-10 08:08:13,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:13,011 INFO L93 Difference]: Finished difference Result 218 states and 281 transitions. [2019-09-10 08:08:13,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:08:13,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 08:08:13,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:13,012 INFO L225 Difference]: With dead ends: 218 [2019-09-10 08:08:13,013 INFO L226 Difference]: Without dead ends: 218 [2019-09-10 08:08:13,013 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 08:08:13,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-10 08:08:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2019-09-10 08:08:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-10 08:08:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 280 transitions. [2019-09-10 08:08:13,016 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 280 transitions. Word has length 115 [2019-09-10 08:08:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:13,017 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 280 transitions. [2019-09-10 08:08:13,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:08:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 280 transitions. [2019-09-10 08:08:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:08:13,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:13,018 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:13,018 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:13,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:13,018 INFO L82 PathProgramCache]: Analyzing trace with hash -527865099, now seen corresponding path program 1 times [2019-09-10 08:08:13,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:13,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:13,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:13,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:13,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:13,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:13,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:08:13,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:13,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:08:13,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:08:13,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:08:13,084 INFO L87 Difference]: Start difference. First operand 216 states and 280 transitions. Second operand 3 states. [2019-09-10 08:08:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:13,111 INFO L93 Difference]: Finished difference Result 328 states and 438 transitions. [2019-09-10 08:08:13,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:08:13,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 08:08:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:13,112 INFO L225 Difference]: With dead ends: 328 [2019-09-10 08:08:13,112 INFO L226 Difference]: Without dead ends: 328 [2019-09-10 08:08:13,113 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 08:08:13,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-10 08:08:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2019-09-10 08:08:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-09-10 08:08:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 435 transitions. [2019-09-10 08:08:13,117 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 435 transitions. Word has length 117 [2019-09-10 08:08:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:13,118 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 435 transitions. [2019-09-10 08:08:13,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:08:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 435 transitions. [2019-09-10 08:08:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:08:13,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:13,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:13,119 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:13,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:13,120 INFO L82 PathProgramCache]: Analyzing trace with hash -461371587, now seen corresponding path program 1 times [2019-09-10 08:08:13,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:13,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:13,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:13,189 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 08:08:13,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:13,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:08:13,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:13,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:08:13,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:08:13,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:08:13,191 INFO L87 Difference]: Start difference. First operand 324 states and 435 transitions. Second operand 3 states. [2019-09-10 08:08:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:13,221 INFO L93 Difference]: Finished difference Result 442 states and 604 transitions. [2019-09-10 08:08:13,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:08:13,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 08:08:13,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:13,222 INFO L225 Difference]: With dead ends: 442 [2019-09-10 08:08:13,222 INFO L226 Difference]: Without dead ends: 442 [2019-09-10 08:08:13,223 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 08:08:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-10 08:08:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2019-09-10 08:08:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-10 08:08:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 603 transitions. [2019-09-10 08:08:13,229 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 603 transitions. Word has length 117 [2019-09-10 08:08:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:13,229 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 603 transitions. [2019-09-10 08:08:13,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:08:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 603 transitions. [2019-09-10 08:08:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:08:13,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:13,230 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:13,231 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:13,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1576522212, now seen corresponding path program 1 times [2019-09-10 08:08:13,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:13,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:13,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:13,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:13,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:13,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:13,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:08:13,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:13,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:08:13,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:08:13,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:08:13,318 INFO L87 Difference]: Start difference. First operand 440 states and 603 transitions. Second operand 7 states. [2019-09-10 08:08:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:13,756 INFO L93 Difference]: Finished difference Result 1514 states and 2124 transitions. [2019-09-10 08:08:13,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:08:13,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-10 08:08:13,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:13,763 INFO L225 Difference]: With dead ends: 1514 [2019-09-10 08:08:13,764 INFO L226 Difference]: Without dead ends: 1514 [2019-09-10 08:08:13,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:08:13,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-09-10 08:08:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 844. [2019-09-10 08:08:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-10 08:08:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1189 transitions. [2019-09-10 08:08:13,781 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1189 transitions. Word has length 117 [2019-09-10 08:08:13,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:13,781 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1189 transitions. [2019-09-10 08:08:13,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:08:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1189 transitions. [2019-09-10 08:08:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:08:13,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:13,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:13,783 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:13,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:13,783 INFO L82 PathProgramCache]: Analyzing trace with hash 298627100, now seen corresponding path program 1 times [2019-09-10 08:08:13,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:13,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:13,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:13,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:13,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:13,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:13,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:08:13,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:13,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:08:13,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:08:13,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:08:13,904 INFO L87 Difference]: Start difference. First operand 844 states and 1189 transitions. Second operand 7 states. [2019-09-10 08:08:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:14,374 INFO L93 Difference]: Finished difference Result 2682 states and 3800 transitions. [2019-09-10 08:08:14,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:08:14,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-10 08:08:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:14,380 INFO L225 Difference]: With dead ends: 2682 [2019-09-10 08:08:14,380 INFO L226 Difference]: Without dead ends: 2682 [2019-09-10 08:08:14,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:08:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-09-10 08:08:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 1712. [2019-09-10 08:08:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2019-09-10 08:08:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2445 transitions. [2019-09-10 08:08:14,408 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2445 transitions. Word has length 117 [2019-09-10 08:08:14,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:14,408 INFO L475 AbstractCegarLoop]: Abstraction has 1712 states and 2445 transitions. [2019-09-10 08:08:14,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:08:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2445 transitions. [2019-09-10 08:08:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:08:14,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:14,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:14,410 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:14,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:14,410 INFO L82 PathProgramCache]: Analyzing trace with hash 662712860, now seen corresponding path program 1 times [2019-09-10 08:08:14,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:14,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:14,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:14,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:14,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:14,512 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 08:08:14,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:14,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:08:14,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:14,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:08:14,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:08:14,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:08:14,514 INFO L87 Difference]: Start difference. First operand 1712 states and 2445 transitions. Second operand 7 states. [2019-09-10 08:08:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:14,934 INFO L93 Difference]: Finished difference Result 5982 states and 8528 transitions. [2019-09-10 08:08:14,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:08:14,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-10 08:08:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:14,942 INFO L225 Difference]: With dead ends: 5982 [2019-09-10 08:08:14,943 INFO L226 Difference]: Without dead ends: 5982 [2019-09-10 08:08:14,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:08:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2019-09-10 08:08:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3568. [2019-09-10 08:08:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-09-10 08:08:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 5125 transitions. [2019-09-10 08:08:15,003 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 5125 transitions. Word has length 117 [2019-09-10 08:08:15,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:15,003 INFO L475 AbstractCegarLoop]: Abstraction has 3568 states and 5125 transitions. [2019-09-10 08:08:15,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:08:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 5125 transitions. [2019-09-10 08:08:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:08:15,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:15,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:15,005 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:15,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:15,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1403171868, now seen corresponding path program 1 times [2019-09-10 08:08:15,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:15,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:15,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:15,115 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 08:08:15,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:15,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:08:15,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:15,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:08:15,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:08:15,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:08:15,117 INFO L87 Difference]: Start difference. First operand 3568 states and 5125 transitions. Second operand 7 states. [2019-09-10 08:08:15,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:15,669 INFO L93 Difference]: Finished difference Result 10200 states and 14593 transitions. [2019-09-10 08:08:15,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:08:15,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-10 08:08:15,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:15,679 INFO L225 Difference]: With dead ends: 10200 [2019-09-10 08:08:15,679 INFO L226 Difference]: Without dead ends: 10200 [2019-09-10 08:08:15,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:08:15,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10200 states. [2019-09-10 08:08:15,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10200 to 5872. [2019-09-10 08:08:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5872 states. [2019-09-10 08:08:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 8453 transitions. [2019-09-10 08:08:15,775 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 8453 transitions. Word has length 117 [2019-09-10 08:08:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:15,775 INFO L475 AbstractCegarLoop]: Abstraction has 5872 states and 8453 transitions. [2019-09-10 08:08:15,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:08:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 8453 transitions. [2019-09-10 08:08:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:08:15,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:15,777 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:15,778 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:15,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1159936026, now seen corresponding path program 1 times [2019-09-10 08:08:15,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:15,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:15,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:15,861 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 08:08:15,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:15,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:08:15,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:15,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:08:15,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:08:15,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:08:15,862 INFO L87 Difference]: Start difference. First operand 5872 states and 8453 transitions. Second operand 7 states. [2019-09-10 08:08:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:16,262 INFO L93 Difference]: Finished difference Result 12358 states and 17608 transitions. [2019-09-10 08:08:16,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:08:16,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-10 08:08:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:16,276 INFO L225 Difference]: With dead ends: 12358 [2019-09-10 08:08:16,276 INFO L226 Difference]: Without dead ends: 12358 [2019-09-10 08:08:16,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:08:16,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12358 states. [2019-09-10 08:08:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12358 to 6968. [2019-09-10 08:08:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6968 states. [2019-09-10 08:08:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6968 states to 6968 states and 9941 transitions. [2019-09-10 08:08:16,372 INFO L78 Accepts]: Start accepts. Automaton has 6968 states and 9941 transitions. Word has length 118 [2019-09-10 08:08:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:16,373 INFO L475 AbstractCegarLoop]: Abstraction has 6968 states and 9941 transitions. [2019-09-10 08:08:16,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:08:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6968 states and 9941 transitions. [2019-09-10 08:08:16,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:08:16,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:16,374 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:16,375 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:16,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:16,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1593339123, now seen corresponding path program 1 times [2019-09-10 08:08:16,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:16,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:16,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:16,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:16,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:16,428 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 08:08:16,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:16,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:08:16,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:16,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:08:16,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:08:16,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:08:16,430 INFO L87 Difference]: Start difference. First operand 6968 states and 9941 transitions. Second operand 3 states. [2019-09-10 08:08:16,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:16,476 INFO L93 Difference]: Finished difference Result 7682 states and 10854 transitions. [2019-09-10 08:08:16,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:08:16,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 08:08:16,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:16,484 INFO L225 Difference]: With dead ends: 7682 [2019-09-10 08:08:16,484 INFO L226 Difference]: Without dead ends: 7682 [2019-09-10 08:08:16,484 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 08:08:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2019-09-10 08:08:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 7584. [2019-09-10 08:08:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7584 states. [2019-09-10 08:08:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7584 states to 7584 states and 10741 transitions. [2019-09-10 08:08:16,573 INFO L78 Accepts]: Start accepts. Automaton has 7584 states and 10741 transitions. Word has length 118 [2019-09-10 08:08:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:16,573 INFO L475 AbstractCegarLoop]: Abstraction has 7584 states and 10741 transitions. [2019-09-10 08:08:16,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:08:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 7584 states and 10741 transitions. [2019-09-10 08:08:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:08:16,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:16,575 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:16,575 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:16,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:16,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1861651787, now seen corresponding path program 1 times [2019-09-10 08:08:16,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:16,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:16,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:16,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:16,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:16,659 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 08:08:16,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:16,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:08:16,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:16,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:08:16,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:08:16,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:08:16,661 INFO L87 Difference]: Start difference. First operand 7584 states and 10741 transitions. Second operand 6 states. [2019-09-10 08:08:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:16,767 INFO L93 Difference]: Finished difference Result 12086 states and 16803 transitions. [2019-09-10 08:08:16,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:08:16,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-10 08:08:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:16,784 INFO L225 Difference]: With dead ends: 12086 [2019-09-10 08:08:16,784 INFO L226 Difference]: Without dead ends: 12086 [2019-09-10 08:08:16,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:08:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12086 states. [2019-09-10 08:08:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12086 to 7680. [2019-09-10 08:08:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7680 states. [2019-09-10 08:08:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7680 states to 7680 states and 10805 transitions. [2019-09-10 08:08:16,920 INFO L78 Accepts]: Start accepts. Automaton has 7680 states and 10805 transitions. Word has length 118 [2019-09-10 08:08:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:16,921 INFO L475 AbstractCegarLoop]: Abstraction has 7680 states and 10805 transitions. [2019-09-10 08:08:16,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:08:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 7680 states and 10805 transitions. [2019-09-10 08:08:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:08:16,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:16,923 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:16,923 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:16,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:16,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2125598154, now seen corresponding path program 1 times [2019-09-10 08:08:16,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:16,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:16,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:16,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:17,008 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 08:08:17,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:17,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:08:17,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:17,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:08:17,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:08:17,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:08:17,011 INFO L87 Difference]: Start difference. First operand 7680 states and 10805 transitions. Second operand 3 states. [2019-09-10 08:08:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:17,078 INFO L93 Difference]: Finished difference Result 7226 states and 10046 transitions. [2019-09-10 08:08:17,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:08:17,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-10 08:08:17,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:17,088 INFO L225 Difference]: With dead ends: 7226 [2019-09-10 08:08:17,088 INFO L226 Difference]: Without dead ends: 7226 [2019-09-10 08:08:17,089 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 08:08:17,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7226 states. [2019-09-10 08:08:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7226 to 6432. [2019-09-10 08:08:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6432 states. [2019-09-10 08:08:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6432 states to 6432 states and 8965 transitions. [2019-09-10 08:08:17,158 INFO L78 Accepts]: Start accepts. Automaton has 6432 states and 8965 transitions. Word has length 119 [2019-09-10 08:08:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:17,158 INFO L475 AbstractCegarLoop]: Abstraction has 6432 states and 8965 transitions. [2019-09-10 08:08:17,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:08:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 6432 states and 8965 transitions. [2019-09-10 08:08:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:08:17,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:17,160 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:17,160 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:17,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:17,160 INFO L82 PathProgramCache]: Analyzing trace with hash -45815035, now seen corresponding path program 1 times [2019-09-10 08:08:17,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:17,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:17,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:17,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:17,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:17,227 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 08:08:17,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:17,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:08:17,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:17,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:08:17,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:08:17,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:08:17,228 INFO L87 Difference]: Start difference. First operand 6432 states and 8965 transitions. Second operand 3 states. [2019-09-10 08:08:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:17,259 INFO L93 Difference]: Finished difference Result 5978 states and 8206 transitions. [2019-09-10 08:08:17,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:08:17,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:08:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:17,266 INFO L225 Difference]: With dead ends: 5978 [2019-09-10 08:08:17,266 INFO L226 Difference]: Without dead ends: 5978 [2019-09-10 08:08:17,267 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 08:08:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2019-09-10 08:08:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 4563. [2019-09-10 08:08:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4563 states. [2019-09-10 08:08:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 6255 transitions. [2019-09-10 08:08:17,328 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 6255 transitions. Word has length 120 [2019-09-10 08:08:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:17,329 INFO L475 AbstractCegarLoop]: Abstraction has 4563 states and 6255 transitions. [2019-09-10 08:08:17,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:08:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 6255 transitions. [2019-09-10 08:08:17,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:08:17,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:17,330 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:17,330 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:17,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:17,331 INFO L82 PathProgramCache]: Analyzing trace with hash -686485906, now seen corresponding path program 1 times [2019-09-10 08:08:17,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:17,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:17,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:17,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:17,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:17,404 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 08:08:17,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:17,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:08:17,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:17,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:08:17,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:08:17,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:08:17,406 INFO L87 Difference]: Start difference. First operand 4563 states and 6255 transitions. Second operand 3 states. [2019-09-10 08:08:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:17,440 INFO L93 Difference]: Finished difference Result 7202 states and 9796 transitions. [2019-09-10 08:08:17,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:08:17,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 08:08:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:17,448 INFO L225 Difference]: With dead ends: 7202 [2019-09-10 08:08:17,449 INFO L226 Difference]: Without dead ends: 7202 [2019-09-10 08:08:17,449 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 08:08:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7202 states. [2019-09-10 08:08:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7202 to 6744. [2019-09-10 08:08:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2019-09-10 08:08:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 9244 transitions. [2019-09-10 08:08:17,520 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 9244 transitions. Word has length 121 [2019-09-10 08:08:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:17,520 INFO L475 AbstractCegarLoop]: Abstraction has 6744 states and 9244 transitions. [2019-09-10 08:08:17,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:08:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 9244 transitions. [2019-09-10 08:08:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:08:17,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:17,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:17,522 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:17,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:17,522 INFO L82 PathProgramCache]: Analyzing trace with hash 470166097, now seen corresponding path program 1 times [2019-09-10 08:08:17,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:17,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:17,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:17,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:17,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:17,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 08:08:17,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:17,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:08:17,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:17,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:08:17,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:08:17,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:08:17,608 INFO L87 Difference]: Start difference. First operand 6744 states and 9244 transitions. Second operand 3 states. [2019-09-10 08:08:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:17,642 INFO L93 Difference]: Finished difference Result 8158 states and 11016 transitions. [2019-09-10 08:08:17,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:08:17,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-10 08:08:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:17,653 INFO L225 Difference]: With dead ends: 8158 [2019-09-10 08:08:17,653 INFO L226 Difference]: Without dead ends: 8158 [2019-09-10 08:08:17,653 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 08:08:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8158 states. [2019-09-10 08:08:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8158 to 7764. [2019-09-10 08:08:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7764 states. [2019-09-10 08:08:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7764 states to 7764 states and 10545 transitions. [2019-09-10 08:08:17,720 INFO L78 Accepts]: Start accepts. Automaton has 7764 states and 10545 transitions. Word has length 122 [2019-09-10 08:08:17,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:17,721 INFO L475 AbstractCegarLoop]: Abstraction has 7764 states and 10545 transitions. [2019-09-10 08:08:17,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:08:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 7764 states and 10545 transitions. [2019-09-10 08:08:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:08:17,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:17,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:08:17,722 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:17,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:17,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1737959858, now seen corresponding path program 1 times [2019-09-10 08:08:17,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:17,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:17,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:17,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:17,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:17,781 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 08:08:17,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:17,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:08:17,782 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:17,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:08:17,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:08:17,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:08:17,783 INFO L87 Difference]: Start difference. First operand 7764 states and 10545 transitions. Second operand 3 states. [2019-09-10 08:08:17,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:17,815 INFO L93 Difference]: Finished difference Result 8194 states and 11022 transitions. [2019-09-10 08:08:17,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:08:17,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-10 08:08:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:17,823 INFO L225 Difference]: With dead ends: 8194 [2019-09-10 08:08:17,824 INFO L226 Difference]: Without dead ends: 8194 [2019-09-10 08:08:17,824 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 08:08:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8194 states. [2019-09-10 08:08:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8194 to 8032. [2019-09-10 08:08:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8032 states. [2019-09-10 08:08:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8032 states to 8032 states and 10821 transitions. [2019-09-10 08:08:17,897 INFO L78 Accepts]: Start accepts. Automaton has 8032 states and 10821 transitions. Word has length 123 [2019-09-10 08:08:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:17,897 INFO L475 AbstractCegarLoop]: Abstraction has 8032 states and 10821 transitions. [2019-09-10 08:08:17,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:08:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 8032 states and 10821 transitions. [2019-09-10 08:08:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:08:17,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:17,900 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:08:17,900 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:17,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1630138217, now seen corresponding path program 1 times [2019-09-10 08:08:17,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:17,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:17,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:17,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:17,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:18,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:18,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:08:18,013 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2019-09-10 08:08:18,015 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [166], [170], [173], [176], [273], [313], [316], [319], [322], [397], [2269], [2271], [2274], [2279], [2282], [2286], [2299], [2301], [2379], [2382], [2385], [2388], [2445], [3287], [3290], [3291], [3293], [3373], [3376], [3379], [3382], [3423], [3852], [3855], [3889], [4083], [4086], [4090], [4093], [4096], [4100], [4102], [4131], [4134], [4149], [4151], [4153], [4156], [4171], [4173], [4175], [4178], [4193], [4195], [4197], [4200], [4203], [4208], [4211], [4217], [4220], [4223], [4226], [4234], [4236], [4239], [4242], [4250], [4252], [4255], [4258], [4266], [4268], [4271], [4274], [4282], [4284], [4287], [4290], [4298], [4344], [4345], [4349], [4350], [4351] [2019-09-10 08:08:18,064 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:08:18,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:08:18,246 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:08:19,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:08:19,065 INFO L272 AbstractInterpreter]: Visited 138 different actions 577 times. Merged at 51 different actions 387 times. Widened at 20 different actions 67 times. Performed 2185 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2185 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 40 fixpoints after 13 different actions. Largest state had 268 variables. [2019-09-10 08:08:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:19,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:08:19,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:19,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:08:19,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:19,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:08:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:19,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:08:19,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:08:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:08:19,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:08:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:08:19,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:08:19,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 14 [2019-09-10 08:08:19,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:19,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:08:19,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:08:19,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:08:19,632 INFO L87 Difference]: Start difference. First operand 8032 states and 10821 transitions. Second operand 7 states. [2019-09-10 08:08:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:19,816 INFO L93 Difference]: Finished difference Result 37008 states and 49833 transitions. [2019-09-10 08:08:19,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:08:19,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2019-09-10 08:08:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:19,905 INFO L225 Difference]: With dead ends: 37008 [2019-09-10 08:08:19,905 INFO L226 Difference]: Without dead ends: 37008 [2019-09-10 08:08:19,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 293 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:08:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37008 states. [2019-09-10 08:08:20,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37008 to 13096. [2019-09-10 08:08:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13096 states. [2019-09-10 08:08:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13096 states to 13096 states and 17573 transitions. [2019-09-10 08:08:20,287 INFO L78 Accepts]: Start accepts. Automaton has 13096 states and 17573 transitions. Word has length 151 [2019-09-10 08:08:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:20,287 INFO L475 AbstractCegarLoop]: Abstraction has 13096 states and 17573 transitions. [2019-09-10 08:08:20,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:08:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 13096 states and 17573 transitions. [2019-09-10 08:08:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:08:20,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:20,294 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:08:20,294 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:20,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:20,295 INFO L82 PathProgramCache]: Analyzing trace with hash 245011095, now seen corresponding path program 1 times [2019-09-10 08:08:20,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:20,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:20,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:20,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:20,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:20,522 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:08:20,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:20,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:08:20,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:20,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:08:20,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:08:20,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:08:20,524 INFO L87 Difference]: Start difference. First operand 13096 states and 17573 transitions. Second operand 7 states. [2019-09-10 08:08:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:20,780 INFO L93 Difference]: Finished difference Result 44718 states and 60086 transitions. [2019-09-10 08:08:20,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:08:20,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2019-09-10 08:08:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:20,868 INFO L225 Difference]: With dead ends: 44718 [2019-09-10 08:08:20,868 INFO L226 Difference]: Without dead ends: 44718 [2019-09-10 08:08:20,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:08:20,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44718 states. [2019-09-10 08:08:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44718 to 20660. [2019-09-10 08:08:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20660 states. [2019-09-10 08:08:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20660 states to 20660 states and 27621 transitions. [2019-09-10 08:08:22,044 INFO L78 Accepts]: Start accepts. Automaton has 20660 states and 27621 transitions. Word has length 151 [2019-09-10 08:08:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:22,045 INFO L475 AbstractCegarLoop]: Abstraction has 20660 states and 27621 transitions. [2019-09-10 08:08:22,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:08:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 20660 states and 27621 transitions. [2019-09-10 08:08:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:08:22,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:22,050 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:08:22,050 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:22,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:22,050 INFO L82 PathProgramCache]: Analyzing trace with hash 609096855, now seen corresponding path program 1 times [2019-09-10 08:08:22,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:22,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:22,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:22,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:22,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:22,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:22,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:08:22,208 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2019-09-10 08:08:22,214 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [166], [170], [173], [176], [273], [313], [316], [319], [322], [397], [2269], [2271], [2274], [2279], [2282], [2286], [2299], [2301], [2379], [2382], [2385], [2388], [2445], [3287], [3290], [3291], [3293], [3373], [3376], [3379], [3382], [3423], [3852], [3855], [3889], [4083], [4086], [4090], [4093], [4096], [4100], [4102], [4131], [4134], [4149], [4151], [4153], [4156], [4159], [4164], [4167], [4173], [4175], [4178], [4193], [4195], [4197], [4200], [4215], [4217], [4220], [4223], [4226], [4234], [4236], [4239], [4242], [4250], [4252], [4255], [4258], [4266], [4268], [4271], [4274], [4282], [4284], [4287], [4290], [4298], [4344], [4345], [4349], [4350], [4351] [2019-09-10 08:08:22,228 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:08:22,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:08:22,294 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:08:22,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:08:22,775 INFO L272 AbstractInterpreter]: Visited 138 different actions 558 times. Merged at 51 different actions 368 times. Widened at 20 different actions 62 times. Performed 2196 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2196 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 38 fixpoints after 9 different actions. Largest state had 268 variables. [2019-09-10 08:08:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:22,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:08:22,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:22,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:08:22,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:22,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:08:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:23,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:08:23,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:08:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:08:23,168 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:08:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:08:23,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:08:23,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 14 [2019-09-10 08:08:23,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:23,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:08:23,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:08:23,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:08:23,277 INFO L87 Difference]: Start difference. First operand 20660 states and 27621 transitions. Second operand 7 states. [2019-09-10 08:08:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:23,553 INFO L93 Difference]: Finished difference Result 49980 states and 67114 transitions. [2019-09-10 08:08:23,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:08:23,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2019-09-10 08:08:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:23,631 INFO L225 Difference]: With dead ends: 49980 [2019-09-10 08:08:23,632 INFO L226 Difference]: Without dead ends: 49980 [2019-09-10 08:08:23,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 293 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:08:23,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49980 states. [2019-09-10 08:08:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49980 to 25724. [2019-09-10 08:08:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25724 states. [2019-09-10 08:08:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25724 states to 25724 states and 34373 transitions. [2019-09-10 08:08:24,299 INFO L78 Accepts]: Start accepts. Automaton has 25724 states and 34373 transitions. Word has length 151 [2019-09-10 08:08:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:24,300 INFO L475 AbstractCegarLoop]: Abstraction has 25724 states and 34373 transitions. [2019-09-10 08:08:24,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:08:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 25724 states and 34373 transitions. [2019-09-10 08:08:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:08:24,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:24,305 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:08:24,305 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:24,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:24,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1349555863, now seen corresponding path program 1 times [2019-09-10 08:08:24,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:24,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:24,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:24,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:24,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:24,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:24,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:08:24,464 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2019-09-10 08:08:24,464 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [166], [170], [173], [176], [273], [313], [316], [319], [322], [397], [2269], [2271], [2274], [2279], [2282], [2286], [2299], [2301], [2379], [2382], [2385], [2388], [2445], [3287], [3290], [3291], [3293], [3373], [3376], [3379], [3382], [3423], [3852], [3855], [3889], [4083], [4086], [4090], [4093], [4096], [4100], [4102], [4131], [4134], [4137], [4142], [4145], [4151], [4153], [4156], [4171], [4173], [4175], [4178], [4193], [4195], [4197], [4200], [4215], [4217], [4220], [4223], [4226], [4234], [4236], [4239], [4242], [4250], [4252], [4255], [4258], [4266], [4268], [4271], [4274], [4282], [4284], [4287], [4290], [4298], [4344], [4345], [4349], [4350], [4351] [2019-09-10 08:08:24,474 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:08:24,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:08:24,534 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:08:25,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:08:25,160 INFO L272 AbstractInterpreter]: Visited 138 different actions 575 times. Merged at 51 different actions 386 times. Widened at 19 different actions 54 times. Performed 2224 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2224 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 45 fixpoints after 13 different actions. Largest state had 268 variables. [2019-09-10 08:08:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:25,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:08:25,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:25,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:08:25,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:25,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:08:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:25,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:08:25,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:08:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:08:25,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:08:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:08:25,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:08:25,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 14 [2019-09-10 08:08:25,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:25,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:08:25,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:08:25,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:08:25,617 INFO L87 Difference]: Start difference. First operand 25724 states and 34373 transitions. Second operand 7 states. [2019-09-10 08:08:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:25,813 INFO L93 Difference]: Finished difference Result 55242 states and 74142 transitions. [2019-09-10 08:08:25,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:08:25,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2019-09-10 08:08:25,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:25,896 INFO L225 Difference]: With dead ends: 55242 [2019-09-10 08:08:25,896 INFO L226 Difference]: Without dead ends: 55242 [2019-09-10 08:08:25,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 293 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:08:25,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55242 states. [2019-09-10 08:08:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55242 to 30788. [2019-09-10 08:08:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30788 states. [2019-09-10 08:08:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30788 states to 30788 states and 41125 transitions. [2019-09-10 08:08:27,291 INFO L78 Accepts]: Start accepts. Automaton has 30788 states and 41125 transitions. Word has length 151 [2019-09-10 08:08:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:27,291 INFO L475 AbstractCegarLoop]: Abstraction has 30788 states and 41125 transitions. [2019-09-10 08:08:27,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:08:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 30788 states and 41125 transitions. [2019-09-10 08:08:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:08:27,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:27,294 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:08:27,295 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:27,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:27,295 INFO L82 PathProgramCache]: Analyzing trace with hash -502160129, now seen corresponding path program 1 times [2019-09-10 08:08:27,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:27,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:27,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:27,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:27,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:08:27,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:08:27,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:08:27,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:08:27,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:08:27,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:08:27,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:08:27,448 INFO L87 Difference]: Start difference. First operand 30788 states and 41125 transitions. Second operand 7 states. [2019-09-10 08:08:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:08:27,715 INFO L93 Difference]: Finished difference Result 60022 states and 80518 transitions. [2019-09-10 08:08:27,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:08:27,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2019-09-10 08:08:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:08:27,806 INFO L225 Difference]: With dead ends: 60022 [2019-09-10 08:08:27,807 INFO L226 Difference]: Without dead ends: 60022 [2019-09-10 08:08:27,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:08:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60022 states. [2019-09-10 08:08:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60022 to 35852. [2019-09-10 08:08:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35852 states. [2019-09-10 08:08:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35852 states to 35852 states and 47877 transitions. [2019-09-10 08:08:28,334 INFO L78 Accepts]: Start accepts. Automaton has 35852 states and 47877 transitions. Word has length 152 [2019-09-10 08:08:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:08:28,334 INFO L475 AbstractCegarLoop]: Abstraction has 35852 states and 47877 transitions. [2019-09-10 08:08:28,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:08:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 35852 states and 47877 transitions. [2019-09-10 08:08:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:08:28,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:08:28,338 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:08:28,339 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:08:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2110971407, now seen corresponding path program 1 times [2019-09-10 08:08:28,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:08:28,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:28,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:28,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:08:28,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:08:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:28,636 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-09-10 08:08:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:28,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:28,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:08:28,936 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-09-10 08:08:28,937 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [166], [170], [173], [176], [273], [313], [316], [319], [322], [397], [2269], [2271], [2274], [2277], [2279], [2282], [2286], [2288], [2293], [2301], [2379], [2382], [2385], [2388], [2445], [3287], [3290], [3291], [3293], [3373], [3376], [3379], [3382], [3423], [3852], [3855], [3889], [4083], [4086], [4090], [4093], [4096], [4100], [4102], [4105], [4110], [4112], [4127], [4129], [4131], [4134], [4149], [4151], [4153], [4156], [4171], [4173], [4175], [4178], [4193], [4195], [4197], [4200], [4215], [4217], [4220], [4223], [4226], [4234], [4236], [4239], [4242], [4250], [4252], [4255], [4258], [4266], [4268], [4271], [4274], [4282], [4284], [4287], [4290], [4298], [4344], [4345], [4349], [4350], [4351] [2019-09-10 08:08:28,939 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:08:28,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:08:28,997 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:08:29,711 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:08:29,712 INFO L272 AbstractInterpreter]: Visited 143 different actions 895 times. Merged at 55 different actions 652 times. Widened at 23 different actions 122 times. Performed 3118 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3118 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 106 fixpoints after 19 different actions. Largest state had 268 variables. [2019-09-10 08:08:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:08:29,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:08:29,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:08:29,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:08:29,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:08:29,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:08:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:08:29,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 08:08:29,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:08:30,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:30,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:30,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:30,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:08:30,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:30,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:30,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:30,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:30,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:32,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:08:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:08:32,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:08:32,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 08:08:32,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:08:32,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:08:32,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:08:32,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:08:32,680 INFO L87 Difference]: Start difference. First operand 35852 states and 47877 transitions. Second operand 21 states. [2019-09-10 08:08:35,183 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 08:08:35,472 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:08:36,235 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:08:36,794 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:08:36,989 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:08:37,431 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:08:37,572 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:08:38,351 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:08:38,787 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:08:38,999 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:08:39,180 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:08:39,334 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:08:39,816 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-09-10 08:08:40,029 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:08:40,237 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:40,463 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:08:40,608 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:08:42,013 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:08:42,654 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:08:42,819 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:08:43,005 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:08:43,173 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:08:43,630 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:08:43,803 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:08:44,278 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:08:44,431 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:08:44,602 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:08:44,766 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:08:45,232 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:08:45,432 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:08:45,622 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:08:45,779 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:08:45,955 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 08:08:46,118 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:08:46,282 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:08:46,486 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:08:46,892 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-09-10 08:08:47,199 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:08:47,434 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:08:47,614 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:08:47,754 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:08:47,947 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:08:48,129 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:08:48,296 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:08:48,465 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:08:48,648 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:08:48,799 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:08:48,989 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:08:49,149 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:08:49,434 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-09-10 08:08:49,573 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:08:49,889 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:08:50,282 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 08:08:50,439 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:08:50,587 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:08:50,776 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:08:50,953 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:08:51,135 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:08:51,268 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:08:51,467 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:08:51,630 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:08:51,930 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:08:52,127 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:08:52,307 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:08:52,483 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:08:52,638 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:08:52,805 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 08:08:53,532 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:08:53,674 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:08:53,874 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:08:54,184 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:08:54,349 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:54,486 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:08:54,740 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:08:54,979 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:08:55,185 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:08:55,392 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:08:55,690 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:08:55,904 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:08:56,062 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 08:08:56,236 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:08:56,423 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:08:56,910 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:08:57,078 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:08:58,286 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:58,616 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:58,904 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:08:59,102 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:08:59,426 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 08:08:59,650 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:08:59,824 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:09:00,037 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:09:00,214 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:09:00,358 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-10 08:09:00,542 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:09:00,698 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 08:09:00,887 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:09:01,215 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:09:01,489 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:09:01,658 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:09:01,818 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:09:01,963 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:09:02,365 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 08:09:02,541 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:09:02,792 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:09:03,119 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:09:03,307 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:09:03,603 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:09:03,749 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:09:03,921 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:09:04,089 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:09:04,295 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:09:04,456 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 08:09:04,669 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:09:04,836 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:09:05,040 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:09:05,181 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:09:05,642 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:09:05,788 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:09:06,095 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:09:06,498 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:09:06,804 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:09:07,160 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:09:07,357 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 08:09:07,594 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:09:07,755 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 08:09:08,074 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:09:08,452 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:09:08,677 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:09:08,831 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:09:09,120 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:09:09,279 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:09:09,449 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:09:09,597 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:09:09,888 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:09:10,069 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:09:10,379 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:09:10,794 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:09:11,175 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:09:11,348 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:09:11,523 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:09:11,696 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:09:11,898 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:09:12,086 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:09:12,283 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:09:12,436 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:09:12,597 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:09:12,781 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:09:12,992 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:09:13,139 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:09:13,352 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:09:13,641 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:09:13,957 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:09:14,141 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:09:14,304 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:09:14,513 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:09:14,687 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:09:14,864 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:09:15,016 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:09:15,190 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:09:15,380 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 08:09:15,723 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:09:15,912 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:09:16,248 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:09:16,744 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:09:17,191 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:09:17,485 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 08:09:17,667 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:09:17,870 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:09:18,081 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:09:18,245 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:09:18,465 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-09-10 08:09:18,673 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 08:09:19,038 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:09:20,686 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:09:21,034 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:09:21,355 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:09:21,841 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:09:21,980 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:09:22,479 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:09:22,666 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:09:22,829 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:09:22,985 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:09:23,565 WARN L188 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 08:09:23,778 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:09:24,091 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-10 08:09:24,361 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:09:24,634 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:09:24,828 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:09:24,989 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:09:25,141 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:09:25,304 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 08:09:25,466 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:09:25,699 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:09:25,867 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:09:26,030 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:09:26,250 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:09:26,479 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:09:26,799 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:09:26,997 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 08:09:27,175 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:09:27,573 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:09:28,131 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:09:28,437 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:09:29,094 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 08:09:29,269 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:09:29,740 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:09:29,924 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:09:30,237 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-10 08:09:30,466 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:09:30,841 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 08:09:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:09:32,418 INFO L93 Difference]: Finished difference Result 838908 states and 1096976 transitions. [2019-09-10 08:09:32,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2019-09-10 08:09:32,419 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 153 [2019-09-10 08:09:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:09:33,920 INFO L225 Difference]: With dead ends: 838908 [2019-09-10 08:09:33,920 INFO L226 Difference]: Without dead ends: 838908 [2019-09-10 08:09:33,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 245 SyntacticMatches, 44 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52426 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=15646, Invalid=110024, Unknown=0, NotChecked=0, Total=125670 [2019-09-10 08:09:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838908 states. [2019-09-10 08:09:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838908 to 177471. [2019-09-10 08:09:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177471 states. [2019-09-10 08:09:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177471 states to 177471 states and 235715 transitions. [2019-09-10 08:09:44,796 INFO L78 Accepts]: Start accepts. Automaton has 177471 states and 235715 transitions. Word has length 153 [2019-09-10 08:09:44,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:09:44,796 INFO L475 AbstractCegarLoop]: Abstraction has 177471 states and 235715 transitions. [2019-09-10 08:09:44,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:09:44,796 INFO L276 IsEmpty]: Start isEmpty. Operand 177471 states and 235715 transitions. [2019-09-10 08:09:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:09:44,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:09:44,811 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:44,812 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:09:44,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:44,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1186931537, now seen corresponding path program 1 times [2019-09-10 08:09:44,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:09:44,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:44,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:44,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:44,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:09:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:44,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:09:44,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:09:44,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:09:44,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:09:44,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:09:44,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:09:44,887 INFO L87 Difference]: Start difference. First operand 177471 states and 235715 transitions. Second operand 3 states. [2019-09-10 08:09:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:09:45,189 INFO L93 Difference]: Finished difference Result 164563 states and 213738 transitions. [2019-09-10 08:09:45,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:09:45,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-10 08:09:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:09:45,351 INFO L225 Difference]: With dead ends: 164563 [2019-09-10 08:09:45,351 INFO L226 Difference]: Without dead ends: 164563 [2019-09-10 08:09:45,351 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 08:09:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164563 states. [2019-09-10 08:09:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164563 to 164191. [2019-09-10 08:09:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164191 states. [2019-09-10 08:09:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164191 states to 164191 states and 213293 transitions. [2019-09-10 08:09:50,262 INFO L78 Accepts]: Start accepts. Automaton has 164191 states and 213293 transitions. Word has length 153 [2019-09-10 08:09:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:09:50,263 INFO L475 AbstractCegarLoop]: Abstraction has 164191 states and 213293 transitions. [2019-09-10 08:09:50,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:09:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 164191 states and 213293 transitions. [2019-09-10 08:09:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:09:50,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:09:50,278 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:50,279 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:09:50,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:50,279 INFO L82 PathProgramCache]: Analyzing trace with hash -646898186, now seen corresponding path program 1 times [2019-09-10 08:09:50,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:09:50,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:50,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:50,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:50,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:09:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:50,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:09:50,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:09:50,705 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2019-09-10 08:09:50,706 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [166], [170], [173], [176], [273], [313], [316], [319], [322], [397], [2269], [2271], [2274], [2279], [2282], [2286], [2299], [2301], [2379], [2382], [2385], [2388], [2445], [3287], [3290], [3291], [3293], [3373], [3376], [3379], [3382], [3423], [3852], [3855], [3889], [4083], [4086], [4090], [4093], [4096], [4100], [4102], [4105], [4110], [4112], [4115], [4120], [4123], [4129], [4131], [4134], [4149], [4151], [4153], [4156], [4171], [4173], [4175], [4178], [4193], [4195], [4197], [4200], [4203], [4208], [4211], [4217], [4220], [4223], [4226], [4234], [4236], [4239], [4242], [4250], [4252], [4255], [4258], [4266], [4268], [4271], [4274], [4282], [4284], [4287], [4290], [4298], [4344], [4345], [4349], [4350], [4351] [2019-09-10 08:09:50,709 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:09:50,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:09:50,801 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:09:51,496 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:09:51,497 INFO L272 AbstractInterpreter]: Visited 145 different actions 732 times. Merged at 58 different actions 516 times. Widened at 24 different actions 100 times. Performed 2605 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2605 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 59 fixpoints after 16 different actions. Largest state had 268 variables. [2019-09-10 08:09:51,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:51,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:09:51,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:09:51,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:09:51,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:51,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:09:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:51,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:09:51,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:09:51,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:51,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:51,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:52,650 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:09:53,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:53,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:53,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:53,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:53,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:53,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:53,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:53,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:53,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:53,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:53,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:09:53,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2019-09-10 08:09:53,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:09:53,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:09:53,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:09:53,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:09:53,087 INFO L87 Difference]: Start difference. First operand 164191 states and 213293 transitions. Second operand 20 states. [2019-09-10 08:09:55,576 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:09:55,843 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:09:56,352 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:09:56,985 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:09:57,205 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:09:57,347 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:09:57,684 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:09:57,845 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:09:57,990 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 08:09:58,156 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:09:58,312 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:09:58,458 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 08:09:58,616 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:09:59,022 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:09:59,199 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:09:59,372 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:09:59,527 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:09:59,691 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:10:00,343 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:10:00,498 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:10:01,059 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 08:10:01,256 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:10:01,418 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-09-10 08:10:01,583 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:10:01,769 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:10:01,914 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:10:02,156 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:10:02,354 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:10:02,893 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 08:10:03,061 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:10:03,228 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-10 08:10:03,365 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:10:03,763 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:10:04,075 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:10:04,295 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:10:04,489 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:10:04,714 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:10:04,892 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 08:10:05,213 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:10:05,414 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 08:10:05,638 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:10:05,807 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-09-10 08:10:05,992 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:10:06,451 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:10:06,668 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:10:06,835 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:10:07,293 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:10:08,397 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:10:08,584 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:10:08,783 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:10:09,166 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 08:10:09,339 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 08:10:09,549 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:10:09,764 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:10:09,962 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:10:10,154 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:10:10,318 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:10:10,504 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:10:10,670 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:10:10,891 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:10:11,078 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:10:11,260 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:10:11,602 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:10:11,884 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 08:10:12,151 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 08:10:12,380 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 08:10:12,677 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:10:12,854 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:10:13,411 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:10:13,645 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:10:13,849 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:10:14,018 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:10:14,187 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 08:10:14,392 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:10:14,591 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:10:14,812 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:10:15,096 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:10:15,265 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:10:15,426 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:10:15,625 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 08:10:15,816 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:10:16,100 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:10:16,254 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:10:16,505 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:10:16,680 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:10:16,879 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:10:17,088 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-09-10 08:10:17,278 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-09-10 08:10:17,523 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-09-10 08:10:17,757 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-09-10 08:10:18,091 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:10:18,289 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:10:18,506 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 08:10:18,693 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-10 08:10:20,468 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:10:20,692 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:10:20,853 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:10:21,045 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:10:21,237 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:10:21,397 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:10:21,581 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:10:21,788 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:10:22,011 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-09-10 08:10:22,200 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:10:22,418 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-10 08:10:22,586 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:10:22,763 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 08:10:22,942 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 08:10:23,117 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:10:23,458 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:10:23,633 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:10:23,824 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 08:10:24,156 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-10 08:10:24,322 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:10:24,552 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:10:24,782 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:10:24,977 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:10:25,149 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:10:25,440 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 08:10:25,775 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:10:26,312 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:10:26,490 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:10:26,670 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 08:10:26,864 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:10:27,048 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:10:27,513 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:10:27,852 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:10:28,006 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:10:28,172 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:10:28,628 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 08:10:28,780 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:10:28,941 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:10:29,395 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:10:29,565 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:10:29,755 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-09-10 08:10:29,942 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:10:30,126 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:10:30,304 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:10:30,758 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:10:30,939 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:10:31,147 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:10:31,488 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:10:31,690 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:10:31,990 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:10:32,644 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-10 08:10:32,965 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:10:33,159 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:10:33,317 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:10:35,097 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:10:35,266 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:10:35,435 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:10:35,627 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:10:35,949 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:10:36,152 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:10:36,459 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:10:37,967 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:10:38,169 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:10:38,321 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:10:38,607 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:10:38,992 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:10:39,187 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 08:10:39,487 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:10:39,772 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:10:39,929 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 08:10:40,342 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:10:40,652 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:10:40,827 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 08:10:40,987 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:10:41,192 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:10:41,370 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:10:41,558 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:10:41,834 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 08:10:42,185 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:10:42,420 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:10:42,594 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:10:42,915 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:10:43,263 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 08:10:43,444 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 08:10:43,765 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:10:44,152 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:10:44,621 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:10:44,854 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:10:45,083 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:10:45,338 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:10:45,556 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:10:45,728 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:10:45,943 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:10:46,139 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:10:46,318 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:10:47,266 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:10:47,574 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:10:47,891 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:10:48,092 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:10:49,034 WARN L188 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:10:49,246 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:10:49,500 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:10:49,693 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:10:49,859 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:10:50,024 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:10:50,431 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:10:50,918 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:10:51,122 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:10:51,301 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:10:51,479 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:10:51,780 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:10:51,957 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:10:52,122 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 08:10:52,349 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:10:52,599 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:10:52,803 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:10:53,021 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:10:53,209 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:10:53,537 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:10:54,265 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:10:54,518 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:10:54,822 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:10:55,005 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:10:55,367 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:10:55,547 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:10:55,754 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 08:10:55,939 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:10:56,133 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 08:10:56,319 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 08:10:56,486 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 08:10:56,739 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:10:57,242 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 08:10:57,509 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-10 08:10:57,706 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-09-10 08:10:57,978 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 08:10:58,195 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-09-10 08:10:58,495 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:10:58,734 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 08:11:01,369 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:11:01,588 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:11:01,844 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:11:02,004 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:11:02,162 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 08:11:02,351 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:11:02,684 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:11:02,841 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:11:03,032 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:11:03,263 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 08:11:03,481 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:11:03,656 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 08:11:03,832 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:11:04,039 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 08:11:04,248 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:11:04,484 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:11:04,799 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:11:05,113 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 08:11:05,340 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 08:11:05,611 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:11:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:15,754 INFO L93 Difference]: Finished difference Result 1637819 states and 2095176 transitions. [2019-09-10 08:11:15,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 355 states. [2019-09-10 08:11:15,755 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 154 [2019-09-10 08:11:15,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:18,491 INFO L225 Difference]: With dead ends: 1637819 [2019-09-10 08:11:18,491 INFO L226 Difference]: Without dead ends: 1637819 [2019-09-10 08:11:18,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 291 SyntacticMatches, 2 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60995 ImplicationChecksByTransitivity, 61.0s TimeCoverageRelationStatistics Valid=17905, Invalid=126875, Unknown=0, NotChecked=0, Total=144780 [2019-09-10 08:11:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637819 states. [2019-09-10 08:11:40,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637819 to 394505. [2019-09-10 08:11:40,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394505 states. [2019-09-10 08:11:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394505 states to 394505 states and 512117 transitions. [2019-09-10 08:11:47,923 INFO L78 Accepts]: Start accepts. Automaton has 394505 states and 512117 transitions. Word has length 154 [2019-09-10 08:11:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:47,923 INFO L475 AbstractCegarLoop]: Abstraction has 394505 states and 512117 transitions. [2019-09-10 08:11:47,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:11:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 394505 states and 512117 transitions. [2019-09-10 08:11:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:11:47,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:47,947 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:11:47,947 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:47,948 INFO L82 PathProgramCache]: Analyzing trace with hash 332171814, now seen corresponding path program 1 times [2019-09-10 08:11:47,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:47,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:47,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:47,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:47,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:11:48,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:48,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:48,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:48,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:48,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:48,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:48,108 INFO L87 Difference]: Start difference. First operand 394505 states and 512117 transitions. Second operand 9 states. [2019-09-10 08:11:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:56,614 INFO L93 Difference]: Finished difference Result 563489 states and 730124 transitions. [2019-09-10 08:11:56,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:11:56,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-09-10 08:11:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:57,334 INFO L225 Difference]: With dead ends: 563489 [2019-09-10 08:11:57,334 INFO L226 Difference]: Without dead ends: 563489 [2019-09-10 08:11:57,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:11:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563489 states. [2019-09-10 08:12:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563489 to 394505. [2019-09-10 08:12:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394505 states. [2019-09-10 08:12:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394505 states to 394505 states and 512109 transitions. [2019-09-10 08:12:02,739 INFO L78 Accepts]: Start accepts. Automaton has 394505 states and 512109 transitions. Word has length 155 [2019-09-10 08:12:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:02,739 INFO L475 AbstractCegarLoop]: Abstraction has 394505 states and 512109 transitions. [2019-09-10 08:12:02,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 394505 states and 512109 transitions. [2019-09-10 08:12:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:12:02,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:02,755 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:12:02,755 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:02,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1545212667, now seen corresponding path program 1 times [2019-09-10 08:12:02,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:02,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:02,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:02,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:02,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:03,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:12:03,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:12:03,037 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2019-09-10 08:12:03,038 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [166], [170], [173], [176], [273], [313], [316], [319], [322], [397], [2269], [2271], [2274], [2279], [2282], [2286], [2299], [2301], [2379], [2382], [2385], [2388], [2445], [3287], [3290], [3291], [3293], [3373], [3376], [3379], [3382], [3423], [3852], [3855], [3858], [3861], [3887], [4083], [4086], [4090], [4093], [4096], [4100], [4102], [4105], [4110], [4112], [4127], [4129], [4131], [4134], [4149], [4151], [4153], [4156], [4171], [4173], [4175], [4178], [4181], [4186], [4189], [4195], [4197], [4200], [4203], [4208], [4211], [4217], [4220], [4223], [4226], [4234], [4236], [4239], [4242], [4250], [4252], [4255], [4258], [4266], [4268], [4271], [4274], [4282], [4284], [4287], [4290], [4298], [4344], [4345], [4349], [4350], [4351] [2019-09-10 08:12:03,040 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:12:03,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:12:03,087 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:12:04,692 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:12:04,692 INFO L272 AbstractInterpreter]: Visited 147 different actions 860 times. Merged at 58 different actions 628 times. Widened at 23 different actions 125 times. Performed 2946 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2946 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 69 fixpoints after 17 different actions. Largest state had 268 variables. [2019-09-10 08:12:04,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:04,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:12:04,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:12:04,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:12:04,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:04,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:12:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:04,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 08:12:04,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:12:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:05,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:12:05,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:05,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:05,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:05,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:08,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:08,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:12:08,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2019-09-10 08:12:08,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:12:08,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:12:08,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:12:08,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:12:08,846 INFO L87 Difference]: Start difference. First operand 394505 states and 512109 transitions. Second operand 20 states. [2019-09-10 08:12:13,472 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:12:13,785 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:12:14,546 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 08:12:14,784 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:12:15,082 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:12:15,302 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:12:15,716 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:12:16,629 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:12:16,916 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:12:18,341 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:12:18,528 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:12:18,764 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:12:18,917 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:12:19,637 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 08:12:19,967 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:12:20,423 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:12:20,641 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 08:12:21,502 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 08:12:22,079 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:12:22,600 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 08:12:22,884 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:12:23,203 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 08:12:23,397 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:12:23,732 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 08:12:24,121 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 08:12:25,097 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:12:25,300 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:12:25,553 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:12:25,880 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:12:27,103 WARN L188 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 08:12:27,572 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 08:12:27,846 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:12:28,102 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:12:28,438 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:12:28,729 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:12:29,291 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 08:12:29,710 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 08:12:29,919 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:12:30,211 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 08:12:30,481 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:12:30,759 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:12:30,938 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:12:31,136 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:12:31,476 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:12:32,477 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-09-10 08:12:33,273 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 08:12:33,537 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 08:12:33,750 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:12:34,999 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:12:35,265 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:12:35,717 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 08:12:35,938 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 08:12:36,409 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:12:36,592 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:12:36,837 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:12:38,161 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:12:38,568 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:12:39,326 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-09-10 08:12:39,587 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:12:39,807 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:12:44,418 WARN L188 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 08:12:44,920 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 08:12:45,144 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 08:12:45,870 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:12:52,539 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 08:12:52,850 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:12:53,110 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:12:53,420 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:12:53,757 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 08:12:53,975 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:12:54,461 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 08:12:54,699 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:12:54,891 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:12:55,089 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:12:55,287 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:12:57,713 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:12:57,951 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 08:12:58,129 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:12:58,491 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:12:59,949 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:13:00,123 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 08:13:02,016 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:13:02,234 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:13:02,432 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:13:02,813 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 08:13:03,034 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:13:03,557 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 08:13:03,781 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 08:13:03,988 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:13:04,409 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:13:04,610 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:13:05,157 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-10 08:13:05,556 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:13:06,209 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:13:06,447 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:13:07,114 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 08:13:07,478 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 08:13:07,813 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:13:08,078 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:13:08,352 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:13:08,630 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:13:08,832 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:13:09,126 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:13:09,402 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 08:13:10,281 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:13:10,542 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:13:10,780 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 08:13:10,978 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 08:13:11,246 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 08:13:11,442 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:13:11,772 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:13:12,079 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:13:14,267 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:13:14,739 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:13:15,020 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:13:15,998 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:13:18,103 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 08:13:18,331 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:13:18,623 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:13:19,005 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:13:19,251 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:13:19,638 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:13:20,064 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:13:20,512 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 08:13:20,828 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:13:35,625 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-10 08:13:36,311 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-10 08:13:37,745 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:13:38,018 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 08:13:38,262 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:13:39,719 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-10 08:13:42,487 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-09-10 08:13:44,690 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:13:47,764 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:13:48,092 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-10 08:13:52,098 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-10 08:13:53,040 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 08:13:53,267 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:13:53,943 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:13:54,271 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:13:54,596 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 08:13:54,860 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:13:55,869 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:13:56,187 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:13:56,560 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:13:56,877 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:13:57,536 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:13:58,174 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 08:13:58,502 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:13:58,746 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 08:13:59,011 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:14:00,266 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:14:10,983 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:14:11,502 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 08:14:11,833 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 08:14:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:51,766 INFO L93 Difference]: Finished difference Result 5660669 states and 7264606 transitions. [2019-09-10 08:14:51,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2019-09-10 08:14:51,767 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 156 [2019-09-10 08:14:51,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:01,121 INFO L225 Difference]: With dead ends: 5660669 [2019-09-10 08:15:01,121 INFO L226 Difference]: Without dead ends: 5660669 [2019-09-10 08:15:01,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 245 SyntacticMatches, 51 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25729 ImplicationChecksByTransitivity, 77.4s TimeCoverageRelationStatistics Valid=9167, Invalid=56113, Unknown=0, NotChecked=0, Total=65280 [2019-09-10 08:15:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5660669 states.