java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:04:53,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:04:53,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:04:53,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:04:53,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:04:53,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:04:53,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:04:53,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:04:53,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:04:53,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:04:53,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:04:53,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:04:53,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:04:53,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:04:53,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:04:53,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:04:53,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:04:53,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:04:53,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:04:53,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:04:53,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:04:53,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:04:53,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:04:53,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:04:53,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:04:53,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:04:53,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:04:53,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:04:53,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:04:53,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:04:53,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:04:53,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:04:53,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:04:53,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:04:53,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:04:53,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:04:53,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:04:53,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:04:53,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:04:53,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:04:53,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:04:53,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:04:53,408 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:04:53,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:04:53,408 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:04:53,409 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:04:53,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:04:53,410 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:04:53,410 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:04:53,411 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:04:53,411 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:04:53,411 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:04:53,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:04:53,412 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:04:53,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:04:53,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:04:53,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:04:53,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:04:53,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:04:53,414 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:04:53,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:04:53,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:04:53,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:04:53,415 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:04:53,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:04:53,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:04:53,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:04:53,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:04:53,417 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:04:53,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:04:53,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:04:53,417 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:04:53,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:04:53,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:04:53,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:04:53,480 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:04:53,480 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:04:53,481 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:04:53,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308b441fe/da6c2d2f865e46e5ae40829fd8664c02/FLAG9c2bcee9d [2019-09-10 07:04:54,409 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:04:54,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:04:54,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308b441fe/da6c2d2f865e46e5ae40829fd8664c02/FLAG9c2bcee9d [2019-09-10 07:04:54,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308b441fe/da6c2d2f865e46e5ae40829fd8664c02 [2019-09-10 07:04:54,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:04:54,848 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:04:54,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:04:54,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:04:54,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:04:54,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:04:54" (1/1) ... [2019-09-10 07:04:54,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b5712d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:04:54, skipping insertion in model container [2019-09-10 07:04:54,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:04:54" (1/1) ... [2019-09-10 07:04:54,865 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:04:55,170 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:04:57,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:04:57,342 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:04:58,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:04:58,368 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:04:58,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:04:58 WrapperNode [2019-09-10 07:04:58,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:04:58,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:04:58,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:04:58,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:04:58,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:04:58" (1/1) ... [2019-09-10 07:04:58,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:04:58" (1/1) ... [2019-09-10 07:04:58,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:04:58" (1/1) ... [2019-09-10 07:04:58,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:04:58" (1/1) ... [2019-09-10 07:04:58,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:04:58" (1/1) ... [2019-09-10 07:04:58,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:04:58" (1/1) ... [2019-09-10 07:04:58,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:04:58" (1/1) ... [2019-09-10 07:04:58,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:04:58,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:04:58,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:04:58,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:04:58,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:04:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:04:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:04:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:04:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:04:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:04:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:04:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:04:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:04:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:04:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:04:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:04:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:04:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:04:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:04:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:04:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:04:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:04:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:04:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:04:58,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:04:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:05:07,646 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:05:07,647 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:05:07,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:05:07 BoogieIcfgContainer [2019-09-10 07:05:07,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:05:07,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:05:07,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:05:07,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:05:07,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:04:54" (1/3) ... [2019-09-10 07:05:07,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9093d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:05:07, skipping insertion in model container [2019-09-10 07:05:07,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:04:58" (2/3) ... [2019-09-10 07:05:07,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9093d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:05:07, skipping insertion in model container [2019-09-10 07:05:07,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:05:07" (3/3) ... [2019-09-10 07:05:07,669 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:05:07,685 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:05:07,714 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-10 07:05:07,738 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-10 07:05:07,771 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:05:07,772 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:05:07,772 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:05:07,772 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:05:07,772 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:05:07,772 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:05:07,772 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:05:07,773 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:05:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states. [2019-09-10 07:05:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:05:07,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:07,907 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] [2019-09-10 07:05:07,909 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:07,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:07,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1063639787, now seen corresponding path program 1 times [2019-09-10 07:05:07,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:07,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:07,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:07,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:07,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:08,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:08,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:05:08,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:08,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:05:08,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:05:08,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:05:08,640 INFO L87 Difference]: Start difference. First operand 3537 states. Second operand 5 states. [2019-09-10 07:05:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:14,093 INFO L93 Difference]: Finished difference Result 4221 states and 7399 transitions. [2019-09-10 07:05:14,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:05:14,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 07:05:14,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:14,134 INFO L225 Difference]: With dead ends: 4221 [2019-09-10 07:05:14,134 INFO L226 Difference]: Without dead ends: 4209 [2019-09-10 07:05:14,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:05:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4209 states. [2019-09-10 07:05:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4209 to 4185. [2019-09-10 07:05:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4185 states. [2019-09-10 07:05:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 5586 transitions. [2019-09-10 07:05:14,305 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 5586 transitions. Word has length 68 [2019-09-10 07:05:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:14,306 INFO L475 AbstractCegarLoop]: Abstraction has 4185 states and 5586 transitions. [2019-09-10 07:05:14,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:05:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 5586 transitions. [2019-09-10 07:05:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:05:14,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:14,317 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] [2019-09-10 07:05:14,317 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:14,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1562022184, now seen corresponding path program 1 times [2019-09-10 07:05:14,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:14,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:14,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:14,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:14,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:14,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:05:14,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:14,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:05:14,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:05:14,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:05:14,613 INFO L87 Difference]: Start difference. First operand 4185 states and 5586 transitions. Second operand 6 states. [2019-09-10 07:05:17,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:17,943 INFO L93 Difference]: Finished difference Result 5990 states and 8081 transitions. [2019-09-10 07:05:17,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:05:17,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 07:05:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:17,980 INFO L225 Difference]: With dead ends: 5990 [2019-09-10 07:05:17,981 INFO L226 Difference]: Without dead ends: 5990 [2019-09-10 07:05:17,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:05:17,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2019-09-10 07:05:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 5949. [2019-09-10 07:05:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5949 states. [2019-09-10 07:05:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5949 states to 5949 states and 8054 transitions. [2019-09-10 07:05:18,130 INFO L78 Accepts]: Start accepts. Automaton has 5949 states and 8054 transitions. Word has length 69 [2019-09-10 07:05:18,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:18,131 INFO L475 AbstractCegarLoop]: Abstraction has 5949 states and 8054 transitions. [2019-09-10 07:05:18,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:05:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 5949 states and 8054 transitions. [2019-09-10 07:05:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:05:18,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:18,143 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] [2019-09-10 07:05:18,145 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:18,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:18,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1710248159, now seen corresponding path program 1 times [2019-09-10 07:05:18,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:18,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:18,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:18,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:18,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:18,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:18,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:05:18,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:18,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:05:18,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:05:18,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:05:18,384 INFO L87 Difference]: Start difference. First operand 5949 states and 8054 transitions. Second operand 6 states. [2019-09-10 07:05:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:21,457 INFO L93 Difference]: Finished difference Result 9003 states and 12226 transitions. [2019-09-10 07:05:21,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:05:21,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 07:05:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:21,499 INFO L225 Difference]: With dead ends: 9003 [2019-09-10 07:05:21,499 INFO L226 Difference]: Without dead ends: 9003 [2019-09-10 07:05:21,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:05:21,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9003 states. [2019-09-10 07:05:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9003 to 8971. [2019-09-10 07:05:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8971 states. [2019-09-10 07:05:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8971 states to 8971 states and 12208 transitions. [2019-09-10 07:05:21,699 INFO L78 Accepts]: Start accepts. Automaton has 8971 states and 12208 transitions. Word has length 69 [2019-09-10 07:05:21,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:21,700 INFO L475 AbstractCegarLoop]: Abstraction has 8971 states and 12208 transitions. [2019-09-10 07:05:21,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:05:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12208 transitions. [2019-09-10 07:05:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:05:21,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:21,713 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:05:21,714 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:21,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:21,715 INFO L82 PathProgramCache]: Analyzing trace with hash -20519424, now seen corresponding path program 1 times [2019-09-10 07:05:21,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:21,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:21,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:21,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:21,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:22,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:22,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:05:22,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:22,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:05:22,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:05:22,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:05:22,013 INFO L87 Difference]: Start difference. First operand 8971 states and 12208 transitions. Second operand 8 states. [2019-09-10 07:05:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:27,654 INFO L93 Difference]: Finished difference Result 13921 states and 19948 transitions. [2019-09-10 07:05:27,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:05:27,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-09-10 07:05:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:27,711 INFO L225 Difference]: With dead ends: 13921 [2019-09-10 07:05:27,712 INFO L226 Difference]: Without dead ends: 13921 [2019-09-10 07:05:27,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:05:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13921 states. [2019-09-10 07:05:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13921 to 8865. [2019-09-10 07:05:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8865 states. [2019-09-10 07:05:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8865 states to 8865 states and 12057 transitions. [2019-09-10 07:05:27,964 INFO L78 Accepts]: Start accepts. Automaton has 8865 states and 12057 transitions. Word has length 70 [2019-09-10 07:05:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:27,965 INFO L475 AbstractCegarLoop]: Abstraction has 8865 states and 12057 transitions. [2019-09-10 07:05:27,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:05:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 8865 states and 12057 transitions. [2019-09-10 07:05:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:05:27,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:27,975 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] [2019-09-10 07:05:27,976 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:27,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:27,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1266244003, now seen corresponding path program 1 times [2019-09-10 07:05:27,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:27,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:27,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:27,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:27,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:28,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 07:05:28,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:28,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:05:28,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:28,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:05:28,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:05:28,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:05:28,117 INFO L87 Difference]: Start difference. First operand 8865 states and 12057 transitions. Second operand 6 states. [2019-09-10 07:05:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:30,360 INFO L93 Difference]: Finished difference Result 14474 states and 20054 transitions. [2019-09-10 07:05:30,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:05:30,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 07:05:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:30,391 INFO L225 Difference]: With dead ends: 14474 [2019-09-10 07:05:30,391 INFO L226 Difference]: Without dead ends: 14474 [2019-09-10 07:05:30,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:05:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14474 states. [2019-09-10 07:05:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14474 to 14429. [2019-09-10 07:05:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14429 states. [2019-09-10 07:05:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14429 states to 14429 states and 20022 transitions. [2019-09-10 07:05:30,638 INFO L78 Accepts]: Start accepts. Automaton has 14429 states and 20022 transitions. Word has length 70 [2019-09-10 07:05:30,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:30,638 INFO L475 AbstractCegarLoop]: Abstraction has 14429 states and 20022 transitions. [2019-09-10 07:05:30,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:05:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 14429 states and 20022 transitions. [2019-09-10 07:05:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:05:30,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:30,654 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] [2019-09-10 07:05:30,655 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:30,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:30,655 INFO L82 PathProgramCache]: Analyzing trace with hash 451335994, now seen corresponding path program 1 times [2019-09-10 07:05:30,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:30,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:30,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:30,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:30,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:30,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:30,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:05:30,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:30,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:05:30,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:05:30,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:05:30,954 INFO L87 Difference]: Start difference. First operand 14429 states and 20022 transitions. Second operand 9 states. [2019-09-10 07:05:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:39,526 INFO L93 Difference]: Finished difference Result 40572 states and 58671 transitions. [2019-09-10 07:05:39,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:05:39,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:05:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:39,605 INFO L225 Difference]: With dead ends: 40572 [2019-09-10 07:05:39,605 INFO L226 Difference]: Without dead ends: 40572 [2019-09-10 07:05:39,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:05:39,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40572 states. [2019-09-10 07:05:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40572 to 14347. [2019-09-10 07:05:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14347 states. [2019-09-10 07:05:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14347 states to 14347 states and 19905 transitions. [2019-09-10 07:05:40,088 INFO L78 Accepts]: Start accepts. Automaton has 14347 states and 19905 transitions. Word has length 70 [2019-09-10 07:05:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:40,091 INFO L475 AbstractCegarLoop]: Abstraction has 14347 states and 19905 transitions. [2019-09-10 07:05:40,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:05:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 19905 transitions. [2019-09-10 07:05:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:05:40,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:40,105 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] [2019-09-10 07:05:40,106 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:40,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:40,113 INFO L82 PathProgramCache]: Analyzing trace with hash 870882905, now seen corresponding path program 1 times [2019-09-10 07:05:40,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:40,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:40,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:40,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:40,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:40,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:40,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:05:40,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:40,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:05:40,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:05:40,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:05:40,609 INFO L87 Difference]: Start difference. First operand 14347 states and 19905 transitions. Second operand 12 states. [2019-09-10 07:05:41,492 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-09-10 07:05:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:45,033 INFO L93 Difference]: Finished difference Result 56885 states and 85752 transitions. [2019-09-10 07:05:45,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:05:45,034 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-10 07:05:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:45,144 INFO L225 Difference]: With dead ends: 56885 [2019-09-10 07:05:45,145 INFO L226 Difference]: Without dead ends: 56885 [2019-09-10 07:05:45,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:05:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56885 states. [2019-09-10 07:05:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56885 to 14261. [2019-09-10 07:05:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14261 states. [2019-09-10 07:05:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14261 states to 14261 states and 19779 transitions. [2019-09-10 07:05:45,683 INFO L78 Accepts]: Start accepts. Automaton has 14261 states and 19779 transitions. Word has length 71 [2019-09-10 07:05:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:45,683 INFO L475 AbstractCegarLoop]: Abstraction has 14261 states and 19779 transitions. [2019-09-10 07:05:45,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:05:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 14261 states and 19779 transitions. [2019-09-10 07:05:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:05:45,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:45,694 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] [2019-09-10 07:05:45,695 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:45,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:45,696 INFO L82 PathProgramCache]: Analyzing trace with hash 350453109, now seen corresponding path program 1 times [2019-09-10 07:05:45,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:45,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:45,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:45,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:45,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:46,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:46,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:05:46,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:46,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:05:46,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:05:46,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:05:46,025 INFO L87 Difference]: Start difference. First operand 14261 states and 19779 transitions. Second operand 9 states. [2019-09-10 07:05:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:50,799 INFO L93 Difference]: Finished difference Result 22292 states and 32209 transitions. [2019-09-10 07:05:50,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:05:50,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-10 07:05:50,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:50,830 INFO L225 Difference]: With dead ends: 22292 [2019-09-10 07:05:50,831 INFO L226 Difference]: Without dead ends: 22292 [2019-09-10 07:05:50,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:05:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22292 states. [2019-09-10 07:05:51,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22292 to 14261. [2019-09-10 07:05:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14261 states. [2019-09-10 07:05:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14261 states to 14261 states and 19778 transitions. [2019-09-10 07:05:51,114 INFO L78 Accepts]: Start accepts. Automaton has 14261 states and 19778 transitions. Word has length 71 [2019-09-10 07:05:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:51,114 INFO L475 AbstractCegarLoop]: Abstraction has 14261 states and 19778 transitions. [2019-09-10 07:05:51,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:05:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 14261 states and 19778 transitions. [2019-09-10 07:05:51,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:05:51,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:51,127 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] [2019-09-10 07:05:51,128 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:51,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:51,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2100398418, now seen corresponding path program 1 times [2019-09-10 07:05:51,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:51,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:51,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:51,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:51,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:51,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:05:51,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:51,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:05:51,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:05:51,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:05:51,405 INFO L87 Difference]: Start difference. First operand 14261 states and 19778 transitions. Second operand 9 states. [2019-09-10 07:05:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:58,098 INFO L93 Difference]: Finished difference Result 22652 states and 32416 transitions. [2019-09-10 07:05:58,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:05:58,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-10 07:05:58,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:58,118 INFO L225 Difference]: With dead ends: 22652 [2019-09-10 07:05:58,119 INFO L226 Difference]: Without dead ends: 22652 [2019-09-10 07:05:58,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:05:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22652 states. [2019-09-10 07:05:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22652 to 14261. [2019-09-10 07:05:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14261 states. [2019-09-10 07:05:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14261 states to 14261 states and 19777 transitions. [2019-09-10 07:05:58,368 INFO L78 Accepts]: Start accepts. Automaton has 14261 states and 19777 transitions. Word has length 71 [2019-09-10 07:05:58,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:58,368 INFO L475 AbstractCegarLoop]: Abstraction has 14261 states and 19777 transitions. [2019-09-10 07:05:58,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:05:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 14261 states and 19777 transitions. [2019-09-10 07:05:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:05:58,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:58,381 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] [2019-09-10 07:05:58,381 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:58,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:58,382 INFO L82 PathProgramCache]: Analyzing trace with hash 343354784, now seen corresponding path program 1 times [2019-09-10 07:05:58,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:58,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:58,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:58,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:58,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:58,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 07:05:58,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:58,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:05:58,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:58,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:05:58,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:05:58,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:05:58,904 INFO L87 Difference]: Start difference. First operand 14261 states and 19777 transitions. Second operand 11 states. [2019-09-10 07:05:59,543 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:06:00,178 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 07:06:00,564 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 07:06:01,169 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 07:06:02,633 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:06:05,018 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-09-10 07:06:05,587 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:06:07,470 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-10 07:06:07,614 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:06:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:07,941 INFO L93 Difference]: Finished difference Result 85040 states and 129278 transitions. [2019-09-10 07:06:07,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 07:06:07,942 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-09-10 07:06:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:08,023 INFO L225 Difference]: With dead ends: 85040 [2019-09-10 07:06:08,024 INFO L226 Difference]: Without dead ends: 85040 [2019-09-10 07:06:08,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=519, Invalid=1461, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 07:06:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85040 states. [2019-09-10 07:06:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85040 to 14172. [2019-09-10 07:06:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14172 states. [2019-09-10 07:06:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14172 states to 14172 states and 19654 transitions. [2019-09-10 07:06:08,460 INFO L78 Accepts]: Start accepts. Automaton has 14172 states and 19654 transitions. Word has length 71 [2019-09-10 07:06:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:08,460 INFO L475 AbstractCegarLoop]: Abstraction has 14172 states and 19654 transitions. [2019-09-10 07:06:08,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:06:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 14172 states and 19654 transitions. [2019-09-10 07:06:08,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:06:08,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:08,469 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] [2019-09-10 07:06:08,470 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:08,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:08,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1658925808, now seen corresponding path program 1 times [2019-09-10 07:06:08,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:08,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:08,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:08,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:08,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:09,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:09,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:06:09,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:09,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:06:09,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:06:09,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:06:09,020 INFO L87 Difference]: Start difference. First operand 14172 states and 19654 transitions. Second operand 12 states. [2019-09-10 07:06:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:13,862 INFO L93 Difference]: Finished difference Result 56826 states and 85680 transitions. [2019-09-10 07:06:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:06:13,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-09-10 07:06:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:13,926 INFO L225 Difference]: With dead ends: 56826 [2019-09-10 07:06:13,927 INFO L226 Difference]: Without dead ends: 56826 [2019-09-10 07:06:13,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:06:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56826 states. [2019-09-10 07:06:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56826 to 14164. [2019-09-10 07:06:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14164 states. [2019-09-10 07:06:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14164 states to 14164 states and 19645 transitions. [2019-09-10 07:06:14,243 INFO L78 Accepts]: Start accepts. Automaton has 14164 states and 19645 transitions. Word has length 72 [2019-09-10 07:06:14,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:14,243 INFO L475 AbstractCegarLoop]: Abstraction has 14164 states and 19645 transitions. [2019-09-10 07:06:14,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:06:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14164 states and 19645 transitions. [2019-09-10 07:06:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:06:14,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:14,250 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] [2019-09-10 07:06:14,250 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:14,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1364499548, now seen corresponding path program 1 times [2019-09-10 07:06:14,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:14,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:14,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:14,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:14,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:06:14,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:14,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:06:14,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:06:14,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:06:14,419 INFO L87 Difference]: Start difference. First operand 14164 states and 19645 transitions. Second operand 9 states. [2019-09-10 07:06:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:22,343 INFO L93 Difference]: Finished difference Result 40351 states and 58371 transitions. [2019-09-10 07:06:22,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:06:22,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 07:06:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:22,383 INFO L225 Difference]: With dead ends: 40351 [2019-09-10 07:06:22,383 INFO L226 Difference]: Without dead ends: 40351 [2019-09-10 07:06:22,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:06:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40351 states. [2019-09-10 07:06:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40351 to 14164. [2019-09-10 07:06:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14164 states. [2019-09-10 07:06:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14164 states to 14164 states and 19644 transitions. [2019-09-10 07:06:22,788 INFO L78 Accepts]: Start accepts. Automaton has 14164 states and 19644 transitions. Word has length 72 [2019-09-10 07:06:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:22,788 INFO L475 AbstractCegarLoop]: Abstraction has 14164 states and 19644 transitions. [2019-09-10 07:06:22,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:06:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 14164 states and 19644 transitions. [2019-09-10 07:06:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:06:22,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:22,794 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] [2019-09-10 07:06:22,795 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:22,795 INFO L82 PathProgramCache]: Analyzing trace with hash -313639877, now seen corresponding path program 1 times [2019-09-10 07:06:22,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:22,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:22,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:22,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:22,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:22,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 07:06:22,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:22,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:06:22,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:22,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:06:22,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:06:22,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:06:22,982 INFO L87 Difference]: Start difference. First operand 14164 states and 19644 transitions. Second operand 9 states. [2019-09-10 07:06:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:29,821 INFO L93 Difference]: Finished difference Result 31888 states and 46748 transitions. [2019-09-10 07:06:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:06:29,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 07:06:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:29,956 INFO L225 Difference]: With dead ends: 31888 [2019-09-10 07:06:29,956 INFO L226 Difference]: Without dead ends: 31888 [2019-09-10 07:06:29,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:06:29,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31888 states. [2019-09-10 07:06:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31888 to 14164. [2019-09-10 07:06:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14164 states. [2019-09-10 07:06:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14164 states to 14164 states and 19643 transitions. [2019-09-10 07:06:30,147 INFO L78 Accepts]: Start accepts. Automaton has 14164 states and 19643 transitions. Word has length 72 [2019-09-10 07:06:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:30,147 INFO L475 AbstractCegarLoop]: Abstraction has 14164 states and 19643 transitions. [2019-09-10 07:06:30,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:06:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 14164 states and 19643 transitions. [2019-09-10 07:06:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:06:30,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:30,154 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:30,155 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:30,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:30,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1017120245, now seen corresponding path program 1 times [2019-09-10 07:06:30,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:30,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:30,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:30,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:30,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:30,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:30,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:06:30,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:30,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:06:30,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:06:30,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:06:30,329 INFO L87 Difference]: Start difference. First operand 14164 states and 19643 transitions. Second operand 8 states. [2019-09-10 07:06:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:34,454 INFO L93 Difference]: Finished difference Result 33927 states and 50425 transitions. [2019-09-10 07:06:34,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:06:34,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-09-10 07:06:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:34,491 INFO L225 Difference]: With dead ends: 33927 [2019-09-10 07:06:34,491 INFO L226 Difference]: Without dead ends: 33927 [2019-09-10 07:06:34,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:06:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33927 states. [2019-09-10 07:06:34,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33927 to 14164. [2019-09-10 07:06:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14164 states. [2019-09-10 07:06:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14164 states to 14164 states and 19642 transitions. [2019-09-10 07:06:34,709 INFO L78 Accepts]: Start accepts. Automaton has 14164 states and 19642 transitions. Word has length 72 [2019-09-10 07:06:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:34,709 INFO L475 AbstractCegarLoop]: Abstraction has 14164 states and 19642 transitions. [2019-09-10 07:06:34,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:06:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 14164 states and 19642 transitions. [2019-09-10 07:06:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:06:34,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:34,717 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] [2019-09-10 07:06:34,717 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:34,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:34,718 INFO L82 PathProgramCache]: Analyzing trace with hash 98934365, now seen corresponding path program 1 times [2019-09-10 07:06:34,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:34,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:34,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:34,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:34,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:35,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:35,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:06:35,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:35,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:06:35,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:06:35,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:06:35,206 INFO L87 Difference]: Start difference. First operand 14164 states and 19642 transitions. Second operand 11 states. [2019-09-10 07:06:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:39,584 INFO L93 Difference]: Finished difference Result 62405 states and 94442 transitions. [2019-09-10 07:06:39,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:06:39,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-09-10 07:06:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:39,679 INFO L225 Difference]: With dead ends: 62405 [2019-09-10 07:06:39,679 INFO L226 Difference]: Without dead ends: 62405 [2019-09-10 07:06:39,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:06:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62405 states. [2019-09-10 07:06:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62405 to 14121. [2019-09-10 07:06:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14121 states. [2019-09-10 07:06:40,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14121 states to 14121 states and 19591 transitions. [2019-09-10 07:06:40,042 INFO L78 Accepts]: Start accepts. Automaton has 14121 states and 19591 transitions. Word has length 72 [2019-09-10 07:06:40,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:40,043 INFO L475 AbstractCegarLoop]: Abstraction has 14121 states and 19591 transitions. [2019-09-10 07:06:40,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:06:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand 14121 states and 19591 transitions. [2019-09-10 07:06:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:06:40,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:40,048 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] [2019-09-10 07:06:40,049 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:40,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:40,049 INFO L82 PathProgramCache]: Analyzing trace with hash 997156317, now seen corresponding path program 1 times [2019-09-10 07:06:40,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:40,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:40,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:40,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:40,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:40,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:40,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:40,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:40,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:40,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:40,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:40,152 INFO L87 Difference]: Start difference. First operand 14121 states and 19591 transitions. Second operand 3 states. [2019-09-10 07:06:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:40,319 INFO L93 Difference]: Finished difference Result 13395 states and 19126 transitions. [2019-09-10 07:06:40,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:40,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-10 07:06:40,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:40,335 INFO L225 Difference]: With dead ends: 13395 [2019-09-10 07:06:40,335 INFO L226 Difference]: Without dead ends: 13395 [2019-09-10 07:06:40,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13395 states. [2019-09-10 07:06:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13395 to 13377. [2019-09-10 07:06:40,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13377 states. [2019-09-10 07:06:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13377 states to 13377 states and 19114 transitions. [2019-09-10 07:06:40,460 INFO L78 Accepts]: Start accepts. Automaton has 13377 states and 19114 transitions. Word has length 72 [2019-09-10 07:06:40,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:40,460 INFO L475 AbstractCegarLoop]: Abstraction has 13377 states and 19114 transitions. [2019-09-10 07:06:40,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 13377 states and 19114 transitions. [2019-09-10 07:06:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:06:40,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:40,465 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] [2019-09-10 07:06:40,465 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:40,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:40,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2144380542, now seen corresponding path program 1 times [2019-09-10 07:06:40,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:40,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:40,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:40,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:40,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:40,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:40,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:40,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:40,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:40,566 INFO L87 Difference]: Start difference. First operand 13377 states and 19114 transitions. Second operand 3 states. [2019-09-10 07:06:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:40,738 INFO L93 Difference]: Finished difference Result 20999 states and 30238 transitions. [2019-09-10 07:06:40,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:40,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 07:06:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:40,756 INFO L225 Difference]: With dead ends: 20999 [2019-09-10 07:06:40,756 INFO L226 Difference]: Without dead ends: 20999 [2019-09-10 07:06:40,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:40,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20999 states. [2019-09-10 07:06:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20999 to 18856. [2019-09-10 07:06:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18856 states. [2019-09-10 07:06:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18856 states to 18856 states and 26966 transitions. [2019-09-10 07:06:40,988 INFO L78 Accepts]: Start accepts. Automaton has 18856 states and 26966 transitions. Word has length 73 [2019-09-10 07:06:40,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:40,988 INFO L475 AbstractCegarLoop]: Abstraction has 18856 states and 26966 transitions. [2019-09-10 07:06:40,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 18856 states and 26966 transitions. [2019-09-10 07:06:40,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:06:40,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:40,994 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] [2019-09-10 07:06:40,994 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:40,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:40,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1936130210, now seen corresponding path program 1 times [2019-09-10 07:06:40,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:40,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:40,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:40,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:40,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:41,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:41,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:41,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:41,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:41,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:41,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:41,114 INFO L87 Difference]: Start difference. First operand 18856 states and 26966 transitions. Second operand 3 states. [2019-09-10 07:06:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:41,246 INFO L93 Difference]: Finished difference Result 26623 states and 38927 transitions. [2019-09-10 07:06:41,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:41,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 07:06:41,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:41,278 INFO L225 Difference]: With dead ends: 26623 [2019-09-10 07:06:41,278 INFO L226 Difference]: Without dead ends: 26623 [2019-09-10 07:06:41,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26623 states. [2019-09-10 07:06:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26623 to 20591. [2019-09-10 07:06:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20591 states. [2019-09-10 07:06:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20591 states to 20591 states and 29758 transitions. [2019-09-10 07:06:41,616 INFO L78 Accepts]: Start accepts. Automaton has 20591 states and 29758 transitions. Word has length 73 [2019-09-10 07:06:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:41,616 INFO L475 AbstractCegarLoop]: Abstraction has 20591 states and 29758 transitions. [2019-09-10 07:06:41,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 20591 states and 29758 transitions. [2019-09-10 07:06:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:06:41,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:41,622 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] [2019-09-10 07:06:41,623 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:41,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:41,623 INFO L82 PathProgramCache]: Analyzing trace with hash -2045368516, now seen corresponding path program 1 times [2019-09-10 07:06:41,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:41,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:41,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:41,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:41,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:41,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:41,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:41,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:41,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:41,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:41,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:41,729 INFO L87 Difference]: Start difference. First operand 20591 states and 29758 transitions. Second operand 3 states. [2019-09-10 07:06:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:41,998 INFO L93 Difference]: Finished difference Result 32610 states and 47161 transitions. [2019-09-10 07:06:41,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:41,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 07:06:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:42,038 INFO L225 Difference]: With dead ends: 32610 [2019-09-10 07:06:42,039 INFO L226 Difference]: Without dead ends: 32610 [2019-09-10 07:06:42,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32610 states. [2019-09-10 07:06:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32610 to 32602. [2019-09-10 07:06:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32602 states. [2019-09-10 07:06:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32602 states to 32602 states and 47157 transitions. [2019-09-10 07:06:42,318 INFO L78 Accepts]: Start accepts. Automaton has 32602 states and 47157 transitions. Word has length 73 [2019-09-10 07:06:42,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:42,318 INFO L475 AbstractCegarLoop]: Abstraction has 32602 states and 47157 transitions. [2019-09-10 07:06:42,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:42,318 INFO L276 IsEmpty]: Start isEmpty. Operand 32602 states and 47157 transitions. [2019-09-10 07:06:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:06:42,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:42,323 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] [2019-09-10 07:06:42,324 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:42,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:42,324 INFO L82 PathProgramCache]: Analyzing trace with hash 466736798, now seen corresponding path program 1 times [2019-09-10 07:06:42,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:42,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:42,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:42,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:42,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:42,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 07:06:42,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:42,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:42,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:42,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:42,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:42,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:42,406 INFO L87 Difference]: Start difference. First operand 32602 states and 47157 transitions. Second operand 3 states. [2019-09-10 07:06:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:42,628 INFO L93 Difference]: Finished difference Result 45897 states and 67510 transitions. [2019-09-10 07:06:42,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:42,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 07:06:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:42,675 INFO L225 Difference]: With dead ends: 45897 [2019-09-10 07:06:42,676 INFO L226 Difference]: Without dead ends: 45897 [2019-09-10 07:06:42,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45897 states. [2019-09-10 07:06:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45897 to 45889. [2019-09-10 07:06:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45889 states. [2019-09-10 07:06:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45889 states to 45889 states and 67506 transitions. [2019-09-10 07:06:44,402 INFO L78 Accepts]: Start accepts. Automaton has 45889 states and 67506 transitions. Word has length 73 [2019-09-10 07:06:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:44,402 INFO L475 AbstractCegarLoop]: Abstraction has 45889 states and 67506 transitions. [2019-09-10 07:06:44,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 45889 states and 67506 transitions. [2019-09-10 07:06:44,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:06:44,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:44,407 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] [2019-09-10 07:06:44,408 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:44,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:44,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1267420457, now seen corresponding path program 1 times [2019-09-10 07:06:44,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:44,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:44,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:44,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:44,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:44,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 07:06:44,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:44,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:44,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:44,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:44,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:44,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:44,493 INFO L87 Difference]: Start difference. First operand 45889 states and 67506 transitions. Second operand 3 states. [2019-09-10 07:06:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:44,822 INFO L93 Difference]: Finished difference Result 53559 states and 79077 transitions. [2019-09-10 07:06:44,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:44,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 07:06:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:44,888 INFO L225 Difference]: With dead ends: 53559 [2019-09-10 07:06:44,888 INFO L226 Difference]: Without dead ends: 53559 [2019-09-10 07:06:44,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53559 states. [2019-09-10 07:06:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53559 to 42604. [2019-09-10 07:06:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42604 states. [2019-09-10 07:06:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42604 states to 42604 states and 63106 transitions. [2019-09-10 07:06:45,309 INFO L78 Accepts]: Start accepts. Automaton has 42604 states and 63106 transitions. Word has length 74 [2019-09-10 07:06:45,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:45,309 INFO L475 AbstractCegarLoop]: Abstraction has 42604 states and 63106 transitions. [2019-09-10 07:06:45,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 42604 states and 63106 transitions. [2019-09-10 07:06:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:06:45,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:45,312 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] [2019-09-10 07:06:45,313 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:45,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:45,313 INFO L82 PathProgramCache]: Analyzing trace with hash -993095660, now seen corresponding path program 1 times [2019-09-10 07:06:45,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:45,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:45,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:45,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:45,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:45,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:45,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:45,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:45,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:45,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:45,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:45,401 INFO L87 Difference]: Start difference. First operand 42604 states and 63106 transitions. Second operand 3 states. [2019-09-10 07:06:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:45,659 INFO L93 Difference]: Finished difference Result 72255 states and 107928 transitions. [2019-09-10 07:06:45,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:45,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 07:06:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:45,735 INFO L225 Difference]: With dead ends: 72255 [2019-09-10 07:06:45,735 INFO L226 Difference]: Without dead ends: 72255 [2019-09-10 07:06:45,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72255 states. [2019-09-10 07:06:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72255 to 55859. [2019-09-10 07:06:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-10 07:06:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83395 transitions. [2019-09-10 07:06:46,320 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83395 transitions. Word has length 74 [2019-09-10 07:06:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:46,320 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83395 transitions. [2019-09-10 07:06:46,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83395 transitions. [2019-09-10 07:06:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:06:46,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:46,323 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] [2019-09-10 07:06:46,323 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:46,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1708157951, now seen corresponding path program 1 times [2019-09-10 07:06:46,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:46,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:46,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:46,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:46,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:47,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:47,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:06:47,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:47,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:06:47,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:06:47,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:06:47,905 INFO L87 Difference]: Start difference. First operand 55859 states and 83395 transitions. Second operand 9 states. [2019-09-10 07:06:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:51,095 INFO L93 Difference]: Finished difference Result 130530 states and 194966 transitions. [2019-09-10 07:06:51,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:06:51,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 07:06:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:51,261 INFO L225 Difference]: With dead ends: 130530 [2019-09-10 07:06:51,261 INFO L226 Difference]: Without dead ends: 130530 [2019-09-10 07:06:51,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:06:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130530 states. [2019-09-10 07:06:52,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130530 to 55859. [2019-09-10 07:06:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-10 07:06:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83394 transitions. [2019-09-10 07:06:52,554 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83394 transitions. Word has length 75 [2019-09-10 07:06:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:52,555 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83394 transitions. [2019-09-10 07:06:52,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:06:52,555 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83394 transitions. [2019-09-10 07:06:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:06:52,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:52,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] [2019-09-10 07:06:52,558 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:52,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:52,558 INFO L82 PathProgramCache]: Analyzing trace with hash -592179090, now seen corresponding path program 1 times [2019-09-10 07:06:52,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:52,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:52,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:52,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:52,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:52,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:52,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:06:52,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:52,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:06:52,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:06:52,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:06:52,733 INFO L87 Difference]: Start difference. First operand 55859 states and 83394 transitions. Second operand 9 states. [2019-09-10 07:06:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:55,801 INFO L93 Difference]: Finished difference Result 98669 states and 146966 transitions. [2019-09-10 07:06:55,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:06:55,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 07:06:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:55,916 INFO L225 Difference]: With dead ends: 98669 [2019-09-10 07:06:55,916 INFO L226 Difference]: Without dead ends: 98669 [2019-09-10 07:06:55,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:06:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98669 states. [2019-09-10 07:06:56,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98669 to 55859. [2019-09-10 07:06:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-10 07:06:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83393 transitions. [2019-09-10 07:06:56,715 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83393 transitions. Word has length 75 [2019-09-10 07:06:56,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:56,716 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83393 transitions. [2019-09-10 07:06:56,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:06:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83393 transitions. [2019-09-10 07:06:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:06:56,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:56,718 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] [2019-09-10 07:06:56,718 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash 129580343, now seen corresponding path program 1 times [2019-09-10 07:06:56,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:56,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:56,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:56,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:56,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:56,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:56,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:06:56,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:56,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:06:56,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:06:56,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:06:56,882 INFO L87 Difference]: Start difference. First operand 55859 states and 83393 transitions. Second operand 9 states. [2019-09-10 07:07:01,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:01,094 INFO L93 Difference]: Finished difference Result 155702 states and 231024 transitions. [2019-09-10 07:07:01,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:07:01,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 07:07:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:01,273 INFO L225 Difference]: With dead ends: 155702 [2019-09-10 07:07:01,273 INFO L226 Difference]: Without dead ends: 155702 [2019-09-10 07:07:01,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:07:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155702 states. [2019-09-10 07:07:02,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155702 to 55859. [2019-09-10 07:07:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-10 07:07:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83392 transitions. [2019-09-10 07:07:02,851 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83392 transitions. Word has length 75 [2019-09-10 07:07:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:02,851 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83392 transitions. [2019-09-10 07:07:02,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:07:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83392 transitions. [2019-09-10 07:07:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:07:02,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:02,853 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] [2019-09-10 07:07:02,853 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1422892121, now seen corresponding path program 1 times [2019-09-10 07:07:02,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:02,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:02,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:02,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:02,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:03,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 07:07:03,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:03,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:07:03,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:03,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:07:03,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:07:03,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:07:03,011 INFO L87 Difference]: Start difference. First operand 55859 states and 83392 transitions. Second operand 9 states. [2019-09-10 07:07:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:06,056 INFO L93 Difference]: Finished difference Result 98644 states and 146937 transitions. [2019-09-10 07:07:06,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:07:06,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 07:07:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:06,168 INFO L225 Difference]: With dead ends: 98644 [2019-09-10 07:07:06,168 INFO L226 Difference]: Without dead ends: 98644 [2019-09-10 07:07:06,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:07:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98644 states. [2019-09-10 07:07:06,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98644 to 55859. [2019-09-10 07:07:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-10 07:07:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83390 transitions. [2019-09-10 07:07:06,921 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83390 transitions. Word has length 75 [2019-09-10 07:07:06,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:06,921 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83390 transitions. [2019-09-10 07:07:06,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:07:06,922 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83390 transitions. [2019-09-10 07:07:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:07:06,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:06,924 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] [2019-09-10 07:07:06,924 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:06,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:06,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1817625223, now seen corresponding path program 1 times [2019-09-10 07:07:06,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:06,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:06,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:06,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:06,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:07,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:07,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:07:07,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:07,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:07:07,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:07:07,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:07:07,111 INFO L87 Difference]: Start difference. First operand 55859 states and 83390 transitions. Second operand 9 states. [2019-09-10 07:07:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:11,259 INFO L93 Difference]: Finished difference Result 98644 states and 146935 transitions. [2019-09-10 07:07:11,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:07:11,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 07:07:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:11,379 INFO L225 Difference]: With dead ends: 98644 [2019-09-10 07:07:11,379 INFO L226 Difference]: Without dead ends: 98644 [2019-09-10 07:07:11,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:07:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98644 states. [2019-09-10 07:07:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98644 to 55859. [2019-09-10 07:07:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-10 07:07:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83388 transitions. [2019-09-10 07:07:12,135 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83388 transitions. Word has length 75 [2019-09-10 07:07:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:12,136 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83388 transitions. [2019-09-10 07:07:12,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:07:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83388 transitions. [2019-09-10 07:07:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:07:12,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:12,139 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] [2019-09-10 07:07:12,140 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:12,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:12,140 INFO L82 PathProgramCache]: Analyzing trace with hash -182574823, now seen corresponding path program 1 times [2019-09-10 07:07:12,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:12,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:12,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:12,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:12,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:12,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:12,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:07:12,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:12,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:07:12,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:07:12,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:07:12,309 INFO L87 Difference]: Start difference. First operand 55859 states and 83388 transitions. Second operand 9 states. [2019-09-10 07:07:15,404 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 21 [2019-09-10 07:07:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:15,901 INFO L93 Difference]: Finished difference Result 98669 states and 146959 transitions. [2019-09-10 07:07:15,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:07:15,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 07:07:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:16,039 INFO L225 Difference]: With dead ends: 98669 [2019-09-10 07:07:16,039 INFO L226 Difference]: Without dead ends: 98669 [2019-09-10 07:07:16,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:07:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98669 states. [2019-09-10 07:07:16,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98669 to 55859. [2019-09-10 07:07:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-10 07:07:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83386 transitions. [2019-09-10 07:07:16,854 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83386 transitions. Word has length 75 [2019-09-10 07:07:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:16,855 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83386 transitions. [2019-09-10 07:07:16,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:07:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83386 transitions. [2019-09-10 07:07:16,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:07:16,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:16,857 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 07:07:16,858 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:16,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:16,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1398382405, now seen corresponding path program 1 times [2019-09-10 07:07:16,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:16,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:16,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:16,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:16,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:16,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 07:07:16,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:16,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:07:16,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:16,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:07:16,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:07:16,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:16,951 INFO L87 Difference]: Start difference. First operand 55859 states and 83386 transitions. Second operand 3 states. [2019-09-10 07:07:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:17,232 INFO L93 Difference]: Finished difference Result 101490 states and 150183 transitions. [2019-09-10 07:07:17,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:07:17,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 07:07:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:17,349 INFO L225 Difference]: With dead ends: 101490 [2019-09-10 07:07:17,350 INFO L226 Difference]: Without dead ends: 101490 [2019-09-10 07:07:17,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:07:17,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101490 states. [2019-09-10 07:07:18,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101490 to 70170. [2019-09-10 07:07:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70170 states. [2019-09-10 07:07:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70170 states to 70170 states and 103786 transitions. [2019-09-10 07:07:18,841 INFO L78 Accepts]: Start accepts. Automaton has 70170 states and 103786 transitions. Word has length 76 [2019-09-10 07:07:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:18,842 INFO L475 AbstractCegarLoop]: Abstraction has 70170 states and 103786 transitions. [2019-09-10 07:07:18,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:07:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 70170 states and 103786 transitions. [2019-09-10 07:07:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:07:18,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:18,844 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 07:07:18,845 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:18,845 INFO L82 PathProgramCache]: Analyzing trace with hash 589063280, now seen corresponding path program 1 times [2019-09-10 07:07:18,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:18,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:18,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:18,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:18,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:19,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:19,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:07:19,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:19,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:07:19,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:07:19,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:07:19,023 INFO L87 Difference]: Start difference. First operand 70170 states and 103786 transitions. Second operand 9 states. [2019-09-10 07:07:22,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:22,035 INFO L93 Difference]: Finished difference Result 123167 states and 181613 transitions. [2019-09-10 07:07:22,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:07:22,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-09-10 07:07:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:22,193 INFO L225 Difference]: With dead ends: 123167 [2019-09-10 07:07:22,193 INFO L226 Difference]: Without dead ends: 123167 [2019-09-10 07:07:22,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:07:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123167 states. [2019-09-10 07:07:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123167 to 70165. [2019-09-10 07:07:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70165 states. [2019-09-10 07:07:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70165 states to 70165 states and 103777 transitions. [2019-09-10 07:07:23,170 INFO L78 Accepts]: Start accepts. Automaton has 70165 states and 103777 transitions. Word has length 76 [2019-09-10 07:07:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:23,170 INFO L475 AbstractCegarLoop]: Abstraction has 70165 states and 103777 transitions. [2019-09-10 07:07:23,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:07:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 70165 states and 103777 transitions. [2019-09-10 07:07:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:07:23,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:23,173 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 07:07:23,174 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:23,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:23,174 INFO L82 PathProgramCache]: Analyzing trace with hash 543542166, now seen corresponding path program 1 times [2019-09-10 07:07:23,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:23,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:23,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:23,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:23,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:24,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:24,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:07:24,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:24,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:07:24,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:07:24,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:07:24,680 INFO L87 Difference]: Start difference. First operand 70165 states and 103777 transitions. Second operand 18 states. [2019-09-10 07:07:25,465 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-09-10 07:07:25,804 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 07:07:26,201 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 07:07:26,441 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 07:07:26,828 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 07:07:31,503 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:07:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:35,318 INFO L93 Difference]: Finished difference Result 110946 states and 163239 transitions. [2019-09-10 07:07:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 07:07:35,319 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-09-10 07:07:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:35,440 INFO L225 Difference]: With dead ends: 110946 [2019-09-10 07:07:35,440 INFO L226 Difference]: Without dead ends: 110946 [2019-09-10 07:07:35,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:07:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110946 states. [2019-09-10 07:07:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110946 to 70183. [2019-09-10 07:07:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70183 states. [2019-09-10 07:07:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70183 states to 70183 states and 103801 transitions. [2019-09-10 07:07:36,586 INFO L78 Accepts]: Start accepts. Automaton has 70183 states and 103801 transitions. Word has length 78 [2019-09-10 07:07:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:36,586 INFO L475 AbstractCegarLoop]: Abstraction has 70183 states and 103801 transitions. [2019-09-10 07:07:36,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:07:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 70183 states and 103801 transitions. [2019-09-10 07:07:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:07:36,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:36,589 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 07:07:36,589 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:36,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:36,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1012544164, now seen corresponding path program 1 times [2019-09-10 07:07:36,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:36,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:36,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:36,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:36,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:37,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:37,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:07:37,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:37,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:07:37,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:07:37,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:07:37,368 INFO L87 Difference]: Start difference. First operand 70183 states and 103801 transitions. Second operand 17 states. [2019-09-10 07:07:38,002 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 07:07:40,927 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 07:07:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:42,354 INFO L93 Difference]: Finished difference Result 90951 states and 133367 transitions. [2019-09-10 07:07:42,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:07:42,355 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 78 [2019-09-10 07:07:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:42,460 INFO L225 Difference]: With dead ends: 90951 [2019-09-10 07:07:42,461 INFO L226 Difference]: Without dead ends: 90951 [2019-09-10 07:07:42,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:07:42,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90951 states. [2019-09-10 07:07:43,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90951 to 70145. [2019-09-10 07:07:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70145 states. [2019-09-10 07:07:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70145 states to 70145 states and 103751 transitions. [2019-09-10 07:07:43,317 INFO L78 Accepts]: Start accepts. Automaton has 70145 states and 103751 transitions. Word has length 78 [2019-09-10 07:07:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:43,317 INFO L475 AbstractCegarLoop]: Abstraction has 70145 states and 103751 transitions. [2019-09-10 07:07:43,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:07:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 70145 states and 103751 transitions. [2019-09-10 07:07:43,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:07:43,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:43,320 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 07:07:43,321 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:43,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:43,321 INFO L82 PathProgramCache]: Analyzing trace with hash -65158486, now seen corresponding path program 1 times [2019-09-10 07:07:43,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:43,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:43,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:43,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:43,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:45,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:45,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:07:45,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:45,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:07:45,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:07:45,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:07:45,013 INFO L87 Difference]: Start difference. First operand 70145 states and 103751 transitions. Second operand 21 states. [2019-09-10 07:07:46,138 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-10 07:07:46,430 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-10 07:07:46,852 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-09-10 07:07:47,177 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:07:47,807 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:07:48,336 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 07:07:48,599 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:07:48,867 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 07:07:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:54,623 INFO L93 Difference]: Finished difference Result 133300 states and 197576 transitions. [2019-09-10 07:07:54,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:07:54,623 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2019-09-10 07:07:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:54,770 INFO L225 Difference]: With dead ends: 133300 [2019-09-10 07:07:54,770 INFO L226 Difference]: Without dead ends: 133300 [2019-09-10 07:07:54,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=352, Invalid=1130, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:07:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133300 states. [2019-09-10 07:07:56,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133300 to 70137. [2019-09-10 07:07:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70137 states. [2019-09-10 07:07:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70137 states to 70137 states and 103737 transitions. [2019-09-10 07:07:56,137 INFO L78 Accepts]: Start accepts. Automaton has 70137 states and 103737 transitions. Word has length 78 [2019-09-10 07:07:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:56,137 INFO L475 AbstractCegarLoop]: Abstraction has 70137 states and 103737 transitions. [2019-09-10 07:07:56,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:07:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 70137 states and 103737 transitions. [2019-09-10 07:07:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:07:56,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:56,140 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 07:07:56,141 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:56,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:56,141 INFO L82 PathProgramCache]: Analyzing trace with hash 104506293, now seen corresponding path program 1 times [2019-09-10 07:07:56,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:56,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:56,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:56,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:56,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:56,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:56,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:07:56,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:56,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:07:56,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:07:56,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:07:56,989 INFO L87 Difference]: Start difference. First operand 70137 states and 103737 transitions. Second operand 18 states. [2019-09-10 07:07:57,888 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 07:07:58,370 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-10 07:07:58,795 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 07:07:58,971 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 07:07:59,206 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-10 07:07:59,798 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 07:08:04,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:04,659 INFO L93 Difference]: Finished difference Result 94542 states and 139117 transitions. [2019-09-10 07:08:04,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:08:04,659 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-09-10 07:08:04,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:04,757 INFO L225 Difference]: With dead ends: 94542 [2019-09-10 07:08:04,757 INFO L226 Difference]: Without dead ends: 94542 [2019-09-10 07:08:04,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=242, Invalid=750, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:08:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94542 states. [2019-09-10 07:08:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94542 to 70101. [2019-09-10 07:08:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70101 states. [2019-09-10 07:08:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70101 states to 70101 states and 103688 transitions. [2019-09-10 07:08:05,938 INFO L78 Accepts]: Start accepts. Automaton has 70101 states and 103688 transitions. Word has length 78 [2019-09-10 07:08:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:05,938 INFO L475 AbstractCegarLoop]: Abstraction has 70101 states and 103688 transitions. [2019-09-10 07:08:05,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:08:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 70101 states and 103688 transitions. [2019-09-10 07:08:05,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:08:05,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:05,941 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 07:08:05,941 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:05,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1381605597, now seen corresponding path program 1 times [2019-09-10 07:08:05,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:05,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:05,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:05,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:05,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:06,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:06,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:08:06,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:06,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:08:06,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:08:06,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:08:06,323 INFO L87 Difference]: Start difference. First operand 70101 states and 103688 transitions. Second operand 11 states. [2019-09-10 07:08:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:08,201 INFO L93 Difference]: Finished difference Result 190189 states and 281738 transitions. [2019-09-10 07:08:08,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:08:08,202 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2019-09-10 07:08:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:08,427 INFO L225 Difference]: With dead ends: 190189 [2019-09-10 07:08:08,427 INFO L226 Difference]: Without dead ends: 190189 [2019-09-10 07:08:08,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:08:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190189 states. [2019-09-10 07:08:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190189 to 70047. [2019-09-10 07:08:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70047 states. [2019-09-10 07:08:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70047 states to 70047 states and 103619 transitions. [2019-09-10 07:08:10,449 INFO L78 Accepts]: Start accepts. Automaton has 70047 states and 103619 transitions. Word has length 79 [2019-09-10 07:08:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:10,449 INFO L475 AbstractCegarLoop]: Abstraction has 70047 states and 103619 transitions. [2019-09-10 07:08:10,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:08:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 70047 states and 103619 transitions. [2019-09-10 07:08:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:08:10,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:10,452 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 07:08:10,453 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1027193831, now seen corresponding path program 1 times [2019-09-10 07:08:10,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:10,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:10,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:10,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:10,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:10,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:10,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:08:10,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:10,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:08:10,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:08:10,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:08:10,853 INFO L87 Difference]: Start difference. First operand 70047 states and 103619 transitions. Second operand 12 states. [2019-09-10 07:08:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:13,028 INFO L93 Difference]: Finished difference Result 122583 states and 181091 transitions. [2019-09-10 07:08:13,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:08:13,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2019-09-10 07:08:13,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:13,178 INFO L225 Difference]: With dead ends: 122583 [2019-09-10 07:08:13,178 INFO L226 Difference]: Without dead ends: 122583 [2019-09-10 07:08:13,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:08:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122583 states. [2019-09-10 07:08:14,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122583 to 70043. [2019-09-10 07:08:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70043 states. [2019-09-10 07:08:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70043 states to 70043 states and 103614 transitions. [2019-09-10 07:08:14,147 INFO L78 Accepts]: Start accepts. Automaton has 70043 states and 103614 transitions. Word has length 79 [2019-09-10 07:08:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:14,147 INFO L475 AbstractCegarLoop]: Abstraction has 70043 states and 103614 transitions. [2019-09-10 07:08:14,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:08:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 70043 states and 103614 transitions. [2019-09-10 07:08:14,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:08:14,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:14,151 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 07:08:14,151 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:14,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:14,151 INFO L82 PathProgramCache]: Analyzing trace with hash 390723336, now seen corresponding path program 1 times [2019-09-10 07:08:14,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:14,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:14,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:14,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:14,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:14,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:14,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:08:14,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:14,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:08:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:08:14,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:08:14,653 INFO L87 Difference]: Start difference. First operand 70043 states and 103614 transitions. Second operand 14 states. [2019-09-10 07:08:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:17,810 INFO L93 Difference]: Finished difference Result 102478 states and 151413 transitions. [2019-09-10 07:08:17,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:08:17,810 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 79 [2019-09-10 07:08:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:17,930 INFO L225 Difference]: With dead ends: 102478 [2019-09-10 07:08:17,930 INFO L226 Difference]: Without dead ends: 102478 [2019-09-10 07:08:17,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:08:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102478 states. [2019-09-10 07:08:18,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102478 to 70042. [2019-09-10 07:08:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70042 states. [2019-09-10 07:08:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70042 states to 70042 states and 103611 transitions. [2019-09-10 07:08:18,798 INFO L78 Accepts]: Start accepts. Automaton has 70042 states and 103611 transitions. Word has length 79 [2019-09-10 07:08:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:18,798 INFO L475 AbstractCegarLoop]: Abstraction has 70042 states and 103611 transitions. [2019-09-10 07:08:18,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:08:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 70042 states and 103611 transitions. [2019-09-10 07:08:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:08:18,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:18,802 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 07:08:18,802 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:18,803 INFO L82 PathProgramCache]: Analyzing trace with hash -941577444, now seen corresponding path program 1 times [2019-09-10 07:08:18,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:18,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:18,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:18,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:18,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:19,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:19,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:08:19,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:19,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:08:19,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:08:19,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:08:19,178 INFO L87 Difference]: Start difference. First operand 70042 states and 103611 transitions. Second operand 10 states. [2019-09-10 07:08:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:21,293 INFO L93 Difference]: Finished difference Result 232225 states and 343661 transitions. [2019-09-10 07:08:21,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:08:21,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2019-09-10 07:08:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:21,585 INFO L225 Difference]: With dead ends: 232225 [2019-09-10 07:08:21,585 INFO L226 Difference]: Without dead ends: 232225 [2019-09-10 07:08:21,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:08:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232225 states. [2019-09-10 07:08:23,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232225 to 69902. [2019-09-10 07:08:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69902 states. [2019-09-10 07:08:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69902 states to 69902 states and 103440 transitions. [2019-09-10 07:08:23,738 INFO L78 Accepts]: Start accepts. Automaton has 69902 states and 103440 transitions. Word has length 79 [2019-09-10 07:08:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:23,738 INFO L475 AbstractCegarLoop]: Abstraction has 69902 states and 103440 transitions. [2019-09-10 07:08:23,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:08:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 69902 states and 103440 transitions. [2019-09-10 07:08:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:08:23,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:23,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:23,743 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:23,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:23,744 INFO L82 PathProgramCache]: Analyzing trace with hash 296346175, now seen corresponding path program 1 times [2019-09-10 07:08:23,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:23,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:23,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:23,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:23,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:23,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:23,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:08:23,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:23,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:08:23,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:08:23,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:08:23,864 INFO L87 Difference]: Start difference. First operand 69902 states and 103440 transitions. Second operand 7 states. [2019-09-10 07:08:24,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:24,827 INFO L93 Difference]: Finished difference Result 316123 states and 456618 transitions. [2019-09-10 07:08:24,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:08:24,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-09-10 07:08:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:25,252 INFO L225 Difference]: With dead ends: 316123 [2019-09-10 07:08:25,252 INFO L226 Difference]: Without dead ends: 316123 [2019-09-10 07:08:25,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:08:25,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316123 states. [2019-09-10 07:08:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316123 to 244555. [2019-09-10 07:08:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244555 states. [2019-09-10 07:08:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244555 states to 244555 states and 354108 transitions. [2019-09-10 07:08:30,018 INFO L78 Accepts]: Start accepts. Automaton has 244555 states and 354108 transitions. Word has length 84 [2019-09-10 07:08:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:30,019 INFO L475 AbstractCegarLoop]: Abstraction has 244555 states and 354108 transitions. [2019-09-10 07:08:30,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:08:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 244555 states and 354108 transitions. [2019-09-10 07:08:30,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:08:30,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:30,026 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:30,026 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:30,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:30,026 INFO L82 PathProgramCache]: Analyzing trace with hash 77571385, now seen corresponding path program 1 times [2019-09-10 07:08:30,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:30,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:30,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:30,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:30,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:30,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:30,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:08:30,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:30,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:08:30,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:08:30,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:08:30,195 INFO L87 Difference]: Start difference. First operand 244555 states and 354108 transitions. Second operand 6 states. [2019-09-10 07:08:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:30,885 INFO L93 Difference]: Finished difference Result 158518 states and 224344 transitions. [2019-09-10 07:08:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:08:30,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-09-10 07:08:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:31,060 INFO L225 Difference]: With dead ends: 158518 [2019-09-10 07:08:31,060 INFO L226 Difference]: Without dead ends: 158518 [2019-09-10 07:08:31,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:08:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158518 states. [2019-09-10 07:08:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158518 to 142580. [2019-09-10 07:08:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142580 states. [2019-09-10 07:08:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142580 states to 142580 states and 202361 transitions. [2019-09-10 07:08:37,306 INFO L78 Accepts]: Start accepts. Automaton has 142580 states and 202361 transitions. Word has length 85 [2019-09-10 07:08:37,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:37,306 INFO L475 AbstractCegarLoop]: Abstraction has 142580 states and 202361 transitions. [2019-09-10 07:08:37,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:08:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 142580 states and 202361 transitions. [2019-09-10 07:08:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:08:37,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:37,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:37,317 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:37,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1594901541, now seen corresponding path program 1 times [2019-09-10 07:08:37,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:37,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:37,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:37,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:37,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:37,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:37,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:08:37,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:37,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:08:37,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:08:37,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:08:37,443 INFO L87 Difference]: Start difference. First operand 142580 states and 202361 transitions. Second operand 6 states. [2019-09-10 07:08:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:38,213 INFO L93 Difference]: Finished difference Result 248388 states and 347053 transitions. [2019-09-10 07:08:38,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:08:38,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-09-10 07:08:38,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:38,575 INFO L225 Difference]: With dead ends: 248388 [2019-09-10 07:08:38,576 INFO L226 Difference]: Without dead ends: 248388 [2019-09-10 07:08:38,576 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 07:08:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248388 states. [2019-09-10 07:08:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248388 to 146498. [2019-09-10 07:08:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146498 states. [2019-09-10 07:08:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146498 states to 146498 states and 205418 transitions. [2019-09-10 07:08:42,915 INFO L78 Accepts]: Start accepts. Automaton has 146498 states and 205418 transitions. Word has length 87 [2019-09-10 07:08:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:42,916 INFO L475 AbstractCegarLoop]: Abstraction has 146498 states and 205418 transitions. [2019-09-10 07:08:42,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:08:42,916 INFO L276 IsEmpty]: Start isEmpty. Operand 146498 states and 205418 transitions. [2019-09-10 07:08:42,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:08:42,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:42,926 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:42,926 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:42,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:42,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2113983979, now seen corresponding path program 1 times [2019-09-10 07:08:42,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:42,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:42,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:42,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:42,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:43,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:43,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:43,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:43,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:43,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:43,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:43,019 INFO L87 Difference]: Start difference. First operand 146498 states and 205418 transitions. Second operand 3 states. [2019-09-10 07:08:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:43,956 INFO L93 Difference]: Finished difference Result 265629 states and 368160 transitions. [2019-09-10 07:08:43,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:43,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:08:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:44,308 INFO L225 Difference]: With dead ends: 265629 [2019-09-10 07:08:44,308 INFO L226 Difference]: Without dead ends: 265629 [2019-09-10 07:08:44,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265629 states. [2019-09-10 07:08:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265629 to 262837. [2019-09-10 07:08:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262837 states. [2019-09-10 07:08:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262837 states to 262837 states and 365369 transitions. [2019-09-10 07:08:49,083 INFO L78 Accepts]: Start accepts. Automaton has 262837 states and 365369 transitions. Word has length 88 [2019-09-10 07:08:49,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:49,083 INFO L475 AbstractCegarLoop]: Abstraction has 262837 states and 365369 transitions. [2019-09-10 07:08:49,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 262837 states and 365369 transitions. [2019-09-10 07:08:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:08:49,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:49,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:49,096 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:49,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:49,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1328266356, now seen corresponding path program 1 times [2019-09-10 07:08:49,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:49,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:49,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:49,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:49,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:49,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:49,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:08:49,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:49,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:08:49,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:08:49,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:08:49,179 INFO L87 Difference]: Start difference. First operand 262837 states and 365369 transitions. Second operand 5 states. [2019-09-10 07:08:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:52,999 INFO L93 Difference]: Finished difference Result 792485 states and 1088101 transitions. [2019-09-10 07:08:59,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:08:59,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-10 07:08:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:00,660 INFO L225 Difference]: With dead ends: 792485 [2019-09-10 07:09:00,660 INFO L226 Difference]: Without dead ends: 792485 [2019-09-10 07:09:00,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:09:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792485 states. [2019-09-10 07:09:07,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792485 to 480078. [2019-09-10 07:09:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480078 states. [2019-09-10 07:09:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480078 states to 480078 states and 662837 transitions. [2019-09-10 07:09:16,458 INFO L78 Accepts]: Start accepts. Automaton has 480078 states and 662837 transitions. Word has length 89 [2019-09-10 07:09:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:16,459 INFO L475 AbstractCegarLoop]: Abstraction has 480078 states and 662837 transitions. [2019-09-10 07:09:16,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:09:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 480078 states and 662837 transitions. [2019-09-10 07:09:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:09:16,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:16,469 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:16,469 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:16,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:16,469 INFO L82 PathProgramCache]: Analyzing trace with hash 32135098, now seen corresponding path program 1 times [2019-09-10 07:09:16,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:16,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:16,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:16,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:16,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:16,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:16,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:09:16,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:16,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:09:16,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:09:16,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:09:16,556 INFO L87 Difference]: Start difference. First operand 480078 states and 662837 transitions. Second operand 5 states. [2019-09-10 07:09:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:26,831 INFO L93 Difference]: Finished difference Result 1039395 states and 1421549 transitions. [2019-09-10 07:09:26,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:09:26,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-10 07:09:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:28,268 INFO L225 Difference]: With dead ends: 1039395 [2019-09-10 07:09:28,268 INFO L226 Difference]: Without dead ends: 1039395 [2019-09-10 07:09:28,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:09:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039395 states. [2019-09-10 07:09:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039395 to 475589. [2019-09-10 07:09:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475589 states. [2019-09-10 07:09:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475589 states to 475589 states and 651384 transitions. [2019-09-10 07:09:45,586 INFO L78 Accepts]: Start accepts. Automaton has 475589 states and 651384 transitions. Word has length 89 [2019-09-10 07:09:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:45,587 INFO L475 AbstractCegarLoop]: Abstraction has 475589 states and 651384 transitions. [2019-09-10 07:09:45,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:09:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 475589 states and 651384 transitions. [2019-09-10 07:09:45,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:09:45,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:45,596 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:45,597 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:45,597 INFO L82 PathProgramCache]: Analyzing trace with hash 212814183, now seen corresponding path program 1 times [2019-09-10 07:09:45,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:45,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:45,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:45,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:45,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:45,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:45,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:09:45,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:45,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:09:45,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:09:45,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:09:45,666 INFO L87 Difference]: Start difference. First operand 475589 states and 651384 transitions. Second operand 5 states. [2019-09-10 07:09:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:51,010 INFO L93 Difference]: Finished difference Result 1054373 states and 1441787 transitions. [2019-09-10 07:09:51,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:09:51,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-10 07:09:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:52,701 INFO L225 Difference]: With dead ends: 1054373 [2019-09-10 07:09:52,702 INFO L226 Difference]: Without dead ends: 1054373 [2019-09-10 07:09:52,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:10:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054373 states. [2019-09-10 07:10:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054373 to 475569. [2019-09-10 07:10:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475569 states. [2019-09-10 07:10:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475569 states to 475569 states and 651352 transitions. [2019-09-10 07:10:11,847 INFO L78 Accepts]: Start accepts. Automaton has 475569 states and 651352 transitions. Word has length 89 [2019-09-10 07:10:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:11,848 INFO L475 AbstractCegarLoop]: Abstraction has 475569 states and 651352 transitions. [2019-09-10 07:10:11,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:10:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 475569 states and 651352 transitions. [2019-09-10 07:10:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:10:11,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:11,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, 1, 1, 1] [2019-09-10 07:10:11,858 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:11,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:11,858 INFO L82 PathProgramCache]: Analyzing trace with hash 292604995, now seen corresponding path program 1 times [2019-09-10 07:10:11,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:11,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:11,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:11,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:11,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:10:11,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:11,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:10:11,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:11,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:10:11,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:10:11,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:10:11,942 INFO L87 Difference]: Start difference. First operand 475569 states and 651352 transitions. Second operand 3 states. [2019-09-10 07:10:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:18,503 INFO L93 Difference]: Finished difference Result 475555 states and 646983 transitions. [2019-09-10 07:10:18,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:10:18,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 07:10:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:19,095 INFO L225 Difference]: With dead ends: 475555 [2019-09-10 07:10:19,095 INFO L226 Difference]: Without dead ends: 475555 [2019-09-10 07:10:19,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:10:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475555 states. [2019-09-10 07:10:24,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475555 to 439144. [2019-09-10 07:10:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439144 states. [2019-09-10 07:10:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439144 states to 439144 states and 598278 transitions. [2019-09-10 07:10:25,061 INFO L78 Accepts]: Start accepts. Automaton has 439144 states and 598278 transitions. Word has length 89 [2019-09-10 07:10:25,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:25,062 INFO L475 AbstractCegarLoop]: Abstraction has 439144 states and 598278 transitions. [2019-09-10 07:10:25,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:10:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 439144 states and 598278 transitions. [2019-09-10 07:10:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:10:25,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:25,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:10:25,076 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:25,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:25,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1264470514, now seen corresponding path program 1 times [2019-09-10 07:10:25,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:25,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:25,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:25,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:25,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:10:25,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:25,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:10:25,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:25,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:10:25,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:10:25,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:10:25,159 INFO L87 Difference]: Start difference. First operand 439144 states and 598278 transitions. Second operand 5 states. [2019-09-10 07:10:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:36,980 INFO L93 Difference]: Finished difference Result 1089448 states and 1470514 transitions. [2019-09-10 07:10:36,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:10:36,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 07:10:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:38,461 INFO L225 Difference]: With dead ends: 1089448 [2019-09-10 07:10:38,461 INFO L226 Difference]: Without dead ends: 1089448 [2019-09-10 07:10:38,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:10:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089448 states. [2019-09-10 07:10:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089448 to 674457. [2019-09-10 07:10:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674457 states. [2019-09-10 07:10:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674457 states to 674457 states and 915223 transitions. [2019-09-10 07:10:55,621 INFO L78 Accepts]: Start accepts. Automaton has 674457 states and 915223 transitions. Word has length 91 [2019-09-10 07:10:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:55,621 INFO L475 AbstractCegarLoop]: Abstraction has 674457 states and 915223 transitions. [2019-09-10 07:10:55,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:10:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 674457 states and 915223 transitions. [2019-09-10 07:10:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:10:55,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:55,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:10:55,630 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash 70157973, now seen corresponding path program 1 times [2019-09-10 07:10:55,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:55,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:55,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:55,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:55,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:10:55,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:55,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:10:55,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:55,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:10:55,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:10:55,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:10:55,710 INFO L87 Difference]: Start difference. First operand 674457 states and 915223 transitions. Second operand 5 states. [2019-09-10 07:11:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:12,273 INFO L93 Difference]: Finished difference Result 1686850 states and 2253581 transitions. [2019-09-10 07:11:12,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:11:12,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-10 07:11:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:14,703 INFO L225 Difference]: With dead ends: 1686850 [2019-09-10 07:11:14,703 INFO L226 Difference]: Without dead ends: 1686850 [2019-09-10 07:11:14,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:11:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686850 states. [2019-09-10 07:11:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686850 to 1151466. [2019-09-10 07:11:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151466 states. [2019-09-10 07:11:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151466 states to 1151466 states and 1553945 transitions. [2019-09-10 07:11:55,279 INFO L78 Accepts]: Start accepts. Automaton has 1151466 states and 1553945 transitions. Word has length 92 [2019-09-10 07:11:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:55,279 INFO L475 AbstractCegarLoop]: Abstraction has 1151466 states and 1553945 transitions. [2019-09-10 07:11:55,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:11:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1151466 states and 1553945 transitions. [2019-09-10 07:11:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:11:55,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:55,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:55,291 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:55,291 INFO L82 PathProgramCache]: Analyzing trace with hash 45778772, now seen corresponding path program 1 times [2019-09-10 07:11:55,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:55,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:55,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:55,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:55,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:11:55,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:55,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:11:55,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:55,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:11:55,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:11:55,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:11:55,420 INFO L87 Difference]: Start difference. First operand 1151466 states and 1553945 transitions. Second operand 7 states. [2019-09-10 07:12:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:13,066 INFO L93 Difference]: Finished difference Result 1635064 states and 2203196 transitions. [2019-09-10 07:12:13,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:12:13,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-09-10 07:12:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:16,145 INFO L225 Difference]: With dead ends: 1635064 [2019-09-10 07:12:16,146 INFO L226 Difference]: Without dead ends: 1635064 [2019-09-10 07:12:16,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:12:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635064 states. [2019-09-10 07:13:02,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635064 to 1591346. [2019-09-10 07:13:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591346 states.