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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:22:36,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:22:36,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:22:36,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:22:36,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:22:36,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:22:36,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:22:36,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:22:36,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:22:36,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:22:36,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:22:36,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:22:36,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:22:36,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:22:36,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:22:36,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:22:36,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:22:36,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:22:36,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:22:36,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:22:36,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:22:36,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:22:36,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:22:36,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:22:36,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:22:36,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:22:36,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:22:36,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:22:36,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:22:36,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:22:36,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:22:36,691 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:22:36,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:22:36,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:22:36,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:22:36,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:22:36,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:22:36,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:22:36,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:22:36,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:22:36,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:22:36,699 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:22:36,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:22:36,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:22:36,716 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:22:36,716 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:22:36,717 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:22:36,717 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:22:36,717 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:22:36,718 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:22:36,718 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:22:36,718 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:22:36,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:22:36,719 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:22:36,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:22:36,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:22:36,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:22:36,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:22:36,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:22:36,721 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:22:36,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:22:36,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:22:36,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:22:36,722 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:22:36,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:22:36,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:22:36,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:22:36,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:22:36,723 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:22:36,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:22:36,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:22:36,724 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:22:36,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:22:36,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:22:36,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:22:36,771 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:22:36,772 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:22:36,773 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2019-09-10 08:22:36,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9543da4/54bd19c128c94b1fb2ac0f1d072c1543/FLAGf7cd9af7b [2019-09-10 08:22:37,640 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:22:37,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2019-09-10 08:22:37,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9543da4/54bd19c128c94b1fb2ac0f1d072c1543/FLAGf7cd9af7b [2019-09-10 08:22:38,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9543da4/54bd19c128c94b1fb2ac0f1d072c1543 [2019-09-10 08:22:38,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:22:38,178 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:22:38,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:22:38,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:22:38,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:22:38,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:22:38" (1/1) ... [2019-09-10 08:22:38,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d5c9c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:38, skipping insertion in model container [2019-09-10 08:22:38,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:22:38" (1/1) ... [2019-09-10 08:22:38,198 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:22:38,450 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:22:40,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:22:40,766 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:22:42,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:22:42,119 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:22:42,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:42 WrapperNode [2019-09-10 08:22:42,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:22:42,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:22:42,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:22:42,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:22:42,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:42" (1/1) ... [2019-09-10 08:22:42,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:42" (1/1) ... [2019-09-10 08:22:42,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:42" (1/1) ... [2019-09-10 08:22:42,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:42" (1/1) ... [2019-09-10 08:22:42,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:42" (1/1) ... [2019-09-10 08:22:42,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:42" (1/1) ... [2019-09-10 08:22:42,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:42" (1/1) ... [2019-09-10 08:22:42,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:22:42,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:22:42,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:22:42,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:22:42,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:22:42,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:22:42,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:22:42,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:22:42,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:22:42,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:22:42,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:22:42,598 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:22:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:22:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:22:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:22:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:22:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:22:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:22:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:22:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:22:42,602 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:22:42,602 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:22:42,602 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:22:42,602 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:22:42,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:22:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:22:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:22:48,371 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:22:48,372 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:22:48,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:22:48 BoogieIcfgContainer [2019-09-10 08:22:48,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:22:48,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:22:48,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:22:48,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:22:48,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:22:38" (1/3) ... [2019-09-10 08:22:48,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66782173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:22:48, skipping insertion in model container [2019-09-10 08:22:48,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:42" (2/3) ... [2019-09-10 08:22:48,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66782173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:22:48, skipping insertion in model container [2019-09-10 08:22:48,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:22:48" (3/3) ... [2019-09-10 08:22:48,387 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2019-09-10 08:22:48,398 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:22:48,417 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-09-10 08:22:48,434 INFO L252 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-09-10 08:22:48,461 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:22:48,461 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:22:48,461 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:22:48,462 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:22:48,462 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:22:48,462 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:22:48,462 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:22:48,462 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:22:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states. [2019-09-10 08:22:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:22:48,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:48,563 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:48,565 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:48,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:48,572 INFO L82 PathProgramCache]: Analyzing trace with hash 215023617, now seen corresponding path program 1 times [2019-09-10 08:22:48,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:48,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:48,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:48,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:48,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:49,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:49,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:49,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:49,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:49,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:49,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:49,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:49,447 INFO L87 Difference]: Start difference. First operand 2087 states. Second operand 5 states. [2019-09-10 08:22:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:51,553 INFO L93 Difference]: Finished difference Result 2172 states and 3724 transitions. [2019-09-10 08:22:51,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:51,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 08:22:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:51,593 INFO L225 Difference]: With dead ends: 2172 [2019-09-10 08:22:51,594 INFO L226 Difference]: Without dead ends: 2160 [2019-09-10 08:22:51,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:22:51,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2019-09-10 08:22:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2058. [2019-09-10 08:22:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-09-10 08:22:51,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2776 transitions. [2019-09-10 08:22:51,751 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2776 transitions. Word has length 105 [2019-09-10 08:22:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:51,752 INFO L475 AbstractCegarLoop]: Abstraction has 2058 states and 2776 transitions. [2019-09-10 08:22:51,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:51,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2776 transitions. [2019-09-10 08:22:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:22:51,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:51,764 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:51,765 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:51,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:51,767 INFO L82 PathProgramCache]: Analyzing trace with hash -650934382, now seen corresponding path program 1 times [2019-09-10 08:22:51,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:51,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:51,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:51,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:51,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:52,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:52,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:52,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:52,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:52,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:52,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:52,108 INFO L87 Difference]: Start difference. First operand 2058 states and 2776 transitions. Second operand 5 states. [2019-09-10 08:22:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:53,218 INFO L93 Difference]: Finished difference Result 1805 states and 2489 transitions. [2019-09-10 08:22:53,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:53,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 08:22:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:53,228 INFO L225 Difference]: With dead ends: 1805 [2019-09-10 08:22:53,228 INFO L226 Difference]: Without dead ends: 1805 [2019-09-10 08:22:53,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:22:53,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-09-10 08:22:53,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1805. [2019-09-10 08:22:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1805 states. [2019-09-10 08:22:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2489 transitions. [2019-09-10 08:22:53,268 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2489 transitions. Word has length 106 [2019-09-10 08:22:53,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:53,268 INFO L475 AbstractCegarLoop]: Abstraction has 1805 states and 2489 transitions. [2019-09-10 08:22:53,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2489 transitions. [2019-09-10 08:22:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:22:53,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:53,273 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:53,274 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:53,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:53,275 INFO L82 PathProgramCache]: Analyzing trace with hash 813965667, now seen corresponding path program 1 times [2019-09-10 08:22:53,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:53,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:53,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:53,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:53,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:53,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:53,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:53,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:53,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:53,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:53,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:53,460 INFO L87 Difference]: Start difference. First operand 1805 states and 2489 transitions. Second operand 5 states. [2019-09-10 08:22:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:54,984 INFO L93 Difference]: Finished difference Result 1725 states and 2391 transitions. [2019-09-10 08:22:54,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:54,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-10 08:22:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:54,994 INFO L225 Difference]: With dead ends: 1725 [2019-09-10 08:22:54,994 INFO L226 Difference]: Without dead ends: 1725 [2019-09-10 08:22:54,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:22:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2019-09-10 08:22:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1725. [2019-09-10 08:22:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-09-10 08:22:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2391 transitions. [2019-09-10 08:22:55,029 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2391 transitions. Word has length 107 [2019-09-10 08:22:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:55,030 INFO L475 AbstractCegarLoop]: Abstraction has 1725 states and 2391 transitions. [2019-09-10 08:22:55,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2391 transitions. [2019-09-10 08:22:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:22:55,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:55,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:55,036 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:55,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:55,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1237924957, now seen corresponding path program 1 times [2019-09-10 08:22:55,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:55,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:55,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:55,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:55,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:55,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:55,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:55,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:55,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:55,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:55,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:55,213 INFO L87 Difference]: Start difference. First operand 1725 states and 2391 transitions. Second operand 5 states. [2019-09-10 08:22:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:56,185 INFO L93 Difference]: Finished difference Result 1643 states and 2299 transitions. [2019-09-10 08:22:56,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:56,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-10 08:22:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:56,199 INFO L225 Difference]: With dead ends: 1643 [2019-09-10 08:22:56,200 INFO L226 Difference]: Without dead ends: 1643 [2019-09-10 08:22:56,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:22:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2019-09-10 08:22:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1643. [2019-09-10 08:22:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1643 states. [2019-09-10 08:22:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2299 transitions. [2019-09-10 08:22:56,236 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2299 transitions. Word has length 108 [2019-09-10 08:22:56,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:56,236 INFO L475 AbstractCegarLoop]: Abstraction has 1643 states and 2299 transitions. [2019-09-10 08:22:56,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2299 transitions. [2019-09-10 08:22:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:22:56,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:56,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:56,244 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:56,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:56,245 INFO L82 PathProgramCache]: Analyzing trace with hash 525572155, now seen corresponding path program 1 times [2019-09-10 08:22:56,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:56,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:56,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:56,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:56,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:56,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:56,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:56,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:56,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:56,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:56,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:56,495 INFO L87 Difference]: Start difference. First operand 1643 states and 2299 transitions. Second operand 5 states. [2019-09-10 08:22:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:57,490 INFO L93 Difference]: Finished difference Result 1605 states and 2255 transitions. [2019-09-10 08:22:57,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:57,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 08:22:57,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:57,501 INFO L225 Difference]: With dead ends: 1605 [2019-09-10 08:22:57,501 INFO L226 Difference]: Without dead ends: 1605 [2019-09-10 08:22:57,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:22:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-09-10 08:22:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2019-09-10 08:22:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-09-10 08:22:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2255 transitions. [2019-09-10 08:22:57,534 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2255 transitions. Word has length 109 [2019-09-10 08:22:57,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:57,534 INFO L475 AbstractCegarLoop]: Abstraction has 1605 states and 2255 transitions. [2019-09-10 08:22:57,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2255 transitions. [2019-09-10 08:22:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:22:57,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:57,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:57,539 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:57,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1784526045, now seen corresponding path program 1 times [2019-09-10 08:22:57,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:57,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:57,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:57,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:57,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:57,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:57,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:57,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:57,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:57,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:57,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:57,745 INFO L87 Difference]: Start difference. First operand 1605 states and 2255 transitions. Second operand 5 states. [2019-09-10 08:22:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:58,674 INFO L93 Difference]: Finished difference Result 1580 states and 2226 transitions. [2019-09-10 08:22:58,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:58,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-10 08:22:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:58,684 INFO L225 Difference]: With dead ends: 1580 [2019-09-10 08:22:58,684 INFO L226 Difference]: Without dead ends: 1580 [2019-09-10 08:22:58,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:22:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2019-09-10 08:22:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2019-09-10 08:22:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2019-09-10 08:22:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2226 transitions. [2019-09-10 08:22:58,728 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2226 transitions. Word has length 110 [2019-09-10 08:22:58,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:58,730 INFO L475 AbstractCegarLoop]: Abstraction has 1580 states and 2226 transitions. [2019-09-10 08:22:58,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2226 transitions. [2019-09-10 08:22:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:22:58,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:58,751 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:58,752 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1947358668, now seen corresponding path program 1 times [2019-09-10 08:22:58,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:58,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:58,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:58,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:58,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:58,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:58,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:58,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:58,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:58,970 INFO L87 Difference]: Start difference. First operand 1580 states and 2226 transitions. Second operand 5 states. [2019-09-10 08:22:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:59,984 INFO L93 Difference]: Finished difference Result 1572 states and 2215 transitions. [2019-09-10 08:22:59,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:59,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-10 08:22:59,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:59,993 INFO L225 Difference]: With dead ends: 1572 [2019-09-10 08:22:59,993 INFO L226 Difference]: Without dead ends: 1572 [2019-09-10 08:22:59,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:22:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2019-09-10 08:23:00,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2019-09-10 08:23:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2215 transitions. [2019-09-10 08:23:00,021 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2215 transitions. Word has length 111 [2019-09-10 08:23:00,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:00,022 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2215 transitions. [2019-09-10 08:23:00,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:23:00,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2215 transitions. [2019-09-10 08:23:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:23:00,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:00,026 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:00,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:00,027 INFO L82 PathProgramCache]: Analyzing trace with hash 386796312, now seen corresponding path program 1 times [2019-09-10 08:23:00,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:00,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:00,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:00,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:00,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:23:00,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:00,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:23:00,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:23:00,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:23:00,341 INFO L87 Difference]: Start difference. First operand 1572 states and 2215 transitions. Second operand 8 states. [2019-09-10 08:23:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:02,496 INFO L93 Difference]: Finished difference Result 2055 states and 2774 transitions. [2019-09-10 08:23:02,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:23:02,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-09-10 08:23:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:02,504 INFO L225 Difference]: With dead ends: 2055 [2019-09-10 08:23:02,505 INFO L226 Difference]: Without dead ends: 2055 [2019-09-10 08:23:02,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:23:02,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2019-09-10 08:23:02,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1572. [2019-09-10 08:23:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2214 transitions. [2019-09-10 08:23:02,537 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2214 transitions. Word has length 112 [2019-09-10 08:23:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:02,537 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2214 transitions. [2019-09-10 08:23:02,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:23:02,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2214 transitions. [2019-09-10 08:23:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:23:02,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:02,541 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:02,547 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:02,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:02,548 INFO L82 PathProgramCache]: Analyzing trace with hash -47028881, now seen corresponding path program 1 times [2019-09-10 08:23:02,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:02,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:02,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:02,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:02,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:02,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:02,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:02,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:02,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:02,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:02,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:02,837 INFO L87 Difference]: Start difference. First operand 1572 states and 2214 transitions. Second operand 9 states. [2019-09-10 08:23:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:05,704 INFO L93 Difference]: Finished difference Result 2009 states and 2854 transitions. [2019-09-10 08:23:05,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:23:05,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-10 08:23:05,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:05,713 INFO L225 Difference]: With dead ends: 2009 [2019-09-10 08:23:05,713 INFO L226 Difference]: Without dead ends: 2009 [2019-09-10 08:23:05,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:23:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2019-09-10 08:23:05,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1572. [2019-09-10 08:23:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2213 transitions. [2019-09-10 08:23:05,745 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2213 transitions. Word has length 112 [2019-09-10 08:23:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:05,746 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2213 transitions. [2019-09-10 08:23:05,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2213 transitions. [2019-09-10 08:23:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:23:05,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:05,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:05,750 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:05,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1133415737, now seen corresponding path program 1 times [2019-09-10 08:23:05,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:05,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:05,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:05,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:05,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:05,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:05,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:05,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:05,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:05,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:05,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:05,997 INFO L87 Difference]: Start difference. First operand 1572 states and 2213 transitions. Second operand 9 states. [2019-09-10 08:23:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:09,267 INFO L93 Difference]: Finished difference Result 2801 states and 3970 transitions. [2019-09-10 08:23:09,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:09,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-10 08:23:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:09,280 INFO L225 Difference]: With dead ends: 2801 [2019-09-10 08:23:09,280 INFO L226 Difference]: Without dead ends: 2801 [2019-09-10 08:23:09,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2019-09-10 08:23:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 1572. [2019-09-10 08:23:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2212 transitions. [2019-09-10 08:23:09,312 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2212 transitions. Word has length 112 [2019-09-10 08:23:09,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:09,313 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2212 transitions. [2019-09-10 08:23:09,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2212 transitions. [2019-09-10 08:23:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:23:09,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:09,317 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:09,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:09,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1339963100, now seen corresponding path program 1 times [2019-09-10 08:23:09,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:09,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:09,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:09,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:09,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:09,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:09,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:09,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:09,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:09,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:09,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:09,561 INFO L87 Difference]: Start difference. First operand 1572 states and 2212 transitions. Second operand 9 states. [2019-09-10 08:23:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:12,357 INFO L93 Difference]: Finished difference Result 2009 states and 2851 transitions. [2019-09-10 08:23:12,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:23:12,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:23:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:12,367 INFO L225 Difference]: With dead ends: 2009 [2019-09-10 08:23:12,367 INFO L226 Difference]: Without dead ends: 2009 [2019-09-10 08:23:12,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:23:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2019-09-10 08:23:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1572. [2019-09-10 08:23:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2210 transitions. [2019-09-10 08:23:12,428 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2210 transitions. Word has length 114 [2019-09-10 08:23:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:12,428 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2210 transitions. [2019-09-10 08:23:12,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2210 transitions. [2019-09-10 08:23:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:23:12,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:12,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:12,432 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:12,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:12,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1679335211, now seen corresponding path program 1 times [2019-09-10 08:23:12,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:12,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:12,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:12,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:12,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:12,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:12,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:12,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:12,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:12,761 INFO L87 Difference]: Start difference. First operand 1572 states and 2210 transitions. Second operand 9 states. [2019-09-10 08:23:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:15,773 INFO L93 Difference]: Finished difference Result 2769 states and 3913 transitions. [2019-09-10 08:23:15,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:15,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:23:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:15,786 INFO L225 Difference]: With dead ends: 2769 [2019-09-10 08:23:15,786 INFO L226 Difference]: Without dead ends: 2769 [2019-09-10 08:23:15,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:15,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-10 08:23:15,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-10 08:23:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2208 transitions. [2019-09-10 08:23:15,818 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2208 transitions. Word has length 114 [2019-09-10 08:23:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:15,819 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2208 transitions. [2019-09-10 08:23:15,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2208 transitions. [2019-09-10 08:23:15,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:23:15,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:15,823 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:15,823 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:15,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:15,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1092834862, now seen corresponding path program 1 times [2019-09-10 08:23:15,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:15,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:15,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:15,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:15,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:16,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:16,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:16,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:16,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:16,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:16,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:16,119 INFO L87 Difference]: Start difference. First operand 1572 states and 2208 transitions. Second operand 9 states. [2019-09-10 08:23:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:19,758 INFO L93 Difference]: Finished difference Result 2801 states and 3964 transitions. [2019-09-10 08:23:19,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:19,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:23:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:19,770 INFO L225 Difference]: With dead ends: 2801 [2019-09-10 08:23:19,771 INFO L226 Difference]: Without dead ends: 2801 [2019-09-10 08:23:19,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:19,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2019-09-10 08:23:19,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 1572. [2019-09-10 08:23:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2206 transitions. [2019-09-10 08:23:19,804 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2206 transitions. Word has length 114 [2019-09-10 08:23:19,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:19,804 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2206 transitions. [2019-09-10 08:23:19,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2206 transitions. [2019-09-10 08:23:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:23:19,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:19,808 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:19,808 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:19,809 INFO L82 PathProgramCache]: Analyzing trace with hash -739954808, now seen corresponding path program 1 times [2019-09-10 08:23:19,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:19,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:19,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:19,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:19,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:20,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:20,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:20,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:20,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:20,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:20,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:20,074 INFO L87 Difference]: Start difference. First operand 1572 states and 2206 transitions. Second operand 9 states. [2019-09-10 08:23:23,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:23,314 INFO L93 Difference]: Finished difference Result 2609 states and 3625 transitions. [2019-09-10 08:23:23,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:23,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:23:23,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:23,322 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:23:23,323 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:23:23,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:23:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:23:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:23:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2205 transitions. [2019-09-10 08:23:23,350 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2205 transitions. Word has length 114 [2019-09-10 08:23:23,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:23,350 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2205 transitions. [2019-09-10 08:23:23,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2205 transitions. [2019-09-10 08:23:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:23:23,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:23,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:23,355 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:23,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1250335121, now seen corresponding path program 1 times [2019-09-10 08:23:23,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:23,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:23,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:23,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:23,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:23,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:23,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:23,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:23,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:23,586 INFO L87 Difference]: Start difference. First operand 1572 states and 2205 transitions. Second operand 9 states. [2019-09-10 08:23:27,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:27,603 INFO L93 Difference]: Finished difference Result 2801 states and 3960 transitions. [2019-09-10 08:23:27,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:27,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:23:27,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:27,610 INFO L225 Difference]: With dead ends: 2801 [2019-09-10 08:23:27,611 INFO L226 Difference]: Without dead ends: 2801 [2019-09-10 08:23:27,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2019-09-10 08:23:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 1572. [2019-09-10 08:23:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2204 transitions. [2019-09-10 08:23:27,637 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2204 transitions. Word has length 114 [2019-09-10 08:23:27,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:27,638 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2204 transitions. [2019-09-10 08:23:27,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2204 transitions. [2019-09-10 08:23:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:23:27,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:27,641 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:27,641 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:27,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:27,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1364856601, now seen corresponding path program 1 times [2019-09-10 08:23:27,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:27,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:27,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:27,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:27,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:27,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:27,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:27,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:27,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:27,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:27,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:27,869 INFO L87 Difference]: Start difference. First operand 1572 states and 2204 transitions. Second operand 9 states. [2019-09-10 08:23:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:31,839 INFO L93 Difference]: Finished difference Result 2769 states and 3907 transitions. [2019-09-10 08:23:31,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:31,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:23:31,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:31,846 INFO L225 Difference]: With dead ends: 2769 [2019-09-10 08:23:31,846 INFO L226 Difference]: Without dead ends: 2769 [2019-09-10 08:23:31,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-10 08:23:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-10 08:23:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2203 transitions. [2019-09-10 08:23:31,874 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2203 transitions. Word has length 114 [2019-09-10 08:23:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:31,874 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2203 transitions. [2019-09-10 08:23:31,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2203 transitions. [2019-09-10 08:23:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:23:31,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:31,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:31,879 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash -855035479, now seen corresponding path program 1 times [2019-09-10 08:23:31,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:31,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:31,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:32,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:32,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:32,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:32,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:32,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:32,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:32,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:32,132 INFO L87 Difference]: Start difference. First operand 1572 states and 2203 transitions. Second operand 9 states. [2019-09-10 08:23:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:35,405 INFO L93 Difference]: Finished difference Result 2609 states and 3621 transitions. [2019-09-10 08:23:35,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:35,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:23:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:35,413 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:23:35,413 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:23:35,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:23:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:23:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:23:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2202 transitions. [2019-09-10 08:23:35,438 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2202 transitions. Word has length 114 [2019-09-10 08:23:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:35,439 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2202 transitions. [2019-09-10 08:23:35,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2202 transitions. [2019-09-10 08:23:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:23:35,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:35,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:35,443 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:35,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:35,443 INFO L82 PathProgramCache]: Analyzing trace with hash -327442449, now seen corresponding path program 1 times [2019-09-10 08:23:35,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:35,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:35,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:35,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:35,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:35,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:35,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:35,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:35,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:35,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:35,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:35,698 INFO L87 Difference]: Start difference. First operand 1572 states and 2202 transitions. Second operand 9 states. [2019-09-10 08:23:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:39,225 INFO L93 Difference]: Finished difference Result 2769 states and 3904 transitions. [2019-09-10 08:23:39,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:39,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-10 08:23:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:39,231 INFO L225 Difference]: With dead ends: 2769 [2019-09-10 08:23:39,232 INFO L226 Difference]: Without dead ends: 2769 [2019-09-10 08:23:39,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-10 08:23:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-10 08:23:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2201 transitions. [2019-09-10 08:23:39,256 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2201 transitions. Word has length 114 [2019-09-10 08:23:39,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:39,257 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2201 transitions. [2019-09-10 08:23:39,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2201 transitions. [2019-09-10 08:23:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:23:39,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:39,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:39,261 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:39,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:39,262 INFO L82 PathProgramCache]: Analyzing trace with hash -577271375, now seen corresponding path program 1 times [2019-09-10 08:23:39,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:39,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:39,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:39,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:39,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:39,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:39,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:39,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:39,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:39,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:39,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:39,527 INFO L87 Difference]: Start difference. First operand 1572 states and 2201 transitions. Second operand 9 states. [2019-09-10 08:23:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:42,672 INFO L93 Difference]: Finished difference Result 2745 states and 3861 transitions. [2019-09-10 08:23:42,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:42,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:23:42,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:42,678 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:23:42,678 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:23:42,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:23:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:23:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2199 transitions. [2019-09-10 08:23:42,704 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2199 transitions. Word has length 116 [2019-09-10 08:23:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:42,705 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2199 transitions. [2019-09-10 08:23:42,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2199 transitions. [2019-09-10 08:23:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:23:42,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:42,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:42,710 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:42,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1087651688, now seen corresponding path program 1 times [2019-09-10 08:23:42,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:42,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:42,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:42,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:42,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:42,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:42,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:42,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:42,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:42,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:42,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:42,986 INFO L87 Difference]: Start difference. First operand 1572 states and 2199 transitions. Second operand 9 states. [2019-09-10 08:23:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:46,948 INFO L93 Difference]: Finished difference Result 2769 states and 3900 transitions. [2019-09-10 08:23:46,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:46,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:23:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:46,953 INFO L225 Difference]: With dead ends: 2769 [2019-09-10 08:23:46,953 INFO L226 Difference]: Without dead ends: 2769 [2019-09-10 08:23:46,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-10 08:23:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-10 08:23:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2197 transitions. [2019-09-10 08:23:46,975 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2197 transitions. Word has length 116 [2019-09-10 08:23:46,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:46,976 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2197 transitions. [2019-09-10 08:23:46,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:46,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2197 transitions. [2019-09-10 08:23:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:23:46,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:46,981 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:46,981 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:46,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:46,982 INFO L82 PathProgramCache]: Analyzing trace with hash -831066789, now seen corresponding path program 1 times [2019-09-10 08:23:46,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:46,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:46,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:46,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:46,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:47,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:47,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:47,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:47,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:47,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:47,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:47,241 INFO L87 Difference]: Start difference. First operand 1572 states and 2197 transitions. Second operand 9 states. [2019-09-10 08:23:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:50,785 INFO L93 Difference]: Finished difference Result 2801 states and 3944 transitions. [2019-09-10 08:23:50,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:50,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:23:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:50,790 INFO L225 Difference]: With dead ends: 2801 [2019-09-10 08:23:50,790 INFO L226 Difference]: Without dead ends: 2801 [2019-09-10 08:23:50,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2019-09-10 08:23:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 1572. [2019-09-10 08:23:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2195 transitions. [2019-09-10 08:23:50,813 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2195 transitions. Word has length 116 [2019-09-10 08:23:50,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:50,814 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2195 transitions. [2019-09-10 08:23:50,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:50,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2195 transitions. [2019-09-10 08:23:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:23:50,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:50,817 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:50,817 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:50,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:50,818 INFO L82 PathProgramCache]: Analyzing trace with hash 755251996, now seen corresponding path program 1 times [2019-09-10 08:23:50,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:50,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:50,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:50,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:50,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:51,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:51,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:51,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:51,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:51,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:51,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:51,061 INFO L87 Difference]: Start difference. First operand 1572 states and 2195 transitions. Second operand 9 states. [2019-09-10 08:23:54,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:54,305 INFO L93 Difference]: Finished difference Result 2609 states and 3610 transitions. [2019-09-10 08:23:54,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:54,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:23:54,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:54,310 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:23:54,311 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:23:54,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:23:54,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:23:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:23:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2193 transitions. [2019-09-10 08:23:54,328 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2193 transitions. Word has length 116 [2019-09-10 08:23:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:54,329 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2193 transitions. [2019-09-10 08:23:54,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2193 transitions. [2019-09-10 08:23:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:23:54,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:54,332 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:54,332 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:54,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1390122634, now seen corresponding path program 1 times [2019-09-10 08:23:54,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:54,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:54,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:54,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:54,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:54,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 08:23:54,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:54,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:54,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:54,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:54,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:54,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:54,565 INFO L87 Difference]: Start difference. First operand 1572 states and 2193 transitions. Second operand 9 states. [2019-09-10 08:23:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:58,334 INFO L93 Difference]: Finished difference Result 2745 states and 3851 transitions. [2019-09-10 08:23:58,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:58,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:23:58,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:58,339 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:23:58,339 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:23:58,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:23:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:23:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:23:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2191 transitions. [2019-09-10 08:23:58,378 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2191 transitions. Word has length 116 [2019-09-10 08:23:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:58,378 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2191 transitions. [2019-09-10 08:23:58,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2191 transitions. [2019-09-10 08:23:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:23:58,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:58,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:58,383 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:58,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:58,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2105565842, now seen corresponding path program 1 times [2019-09-10 08:23:58,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:58,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:58,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:58,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:58,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:58,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:58,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:58,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:58,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:58,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:58,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:58,612 INFO L87 Difference]: Start difference. First operand 1572 states and 2191 transitions. Second operand 9 states. [2019-09-10 08:24:02,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:02,290 INFO L93 Difference]: Finished difference Result 2769 states and 3890 transitions. [2019-09-10 08:24:02,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:02,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:24:02,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:02,295 INFO L225 Difference]: With dead ends: 2769 [2019-09-10 08:24:02,295 INFO L226 Difference]: Without dead ends: 2769 [2019-09-10 08:24:02,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:02,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-10 08:24:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-10 08:24:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2189 transitions. [2019-09-10 08:24:02,311 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2189 transitions. Word has length 116 [2019-09-10 08:24:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:02,312 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2189 transitions. [2019-09-10 08:24:02,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2189 transitions. [2019-09-10 08:24:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:24:02,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:02,315 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:02,315 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:02,316 INFO L82 PathProgramCache]: Analyzing trace with hash 708861456, now seen corresponding path program 1 times [2019-09-10 08:24:02,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:02,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:02,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:02,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:02,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:02,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:02,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:02,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:02,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:02,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:02,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:02,555 INFO L87 Difference]: Start difference. First operand 1572 states and 2189 transitions. Second operand 9 states. [2019-09-10 08:24:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:05,786 INFO L93 Difference]: Finished difference Result 2609 states and 3602 transitions. [2019-09-10 08:24:05,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:05,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:24:05,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:05,791 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:24:05,791 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:24:05,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:24:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:24:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:24:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2187 transitions. [2019-09-10 08:24:05,811 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2187 transitions. Word has length 116 [2019-09-10 08:24:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:05,812 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2187 transitions. [2019-09-10 08:24:05,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2187 transitions. [2019-09-10 08:24:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:24:05,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:05,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:05,815 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:05,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:05,815 INFO L82 PathProgramCache]: Analyzing trace with hash 629608632, now seen corresponding path program 1 times [2019-09-10 08:24:05,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:05,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:05,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:05,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:05,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:06,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:06,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:06,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:06,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:06,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:06,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:06,094 INFO L87 Difference]: Start difference. First operand 1572 states and 2187 transitions. Second operand 9 states. [2019-09-10 08:24:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:10,280 INFO L93 Difference]: Finished difference Result 2769 states and 3884 transitions. [2019-09-10 08:24:10,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:10,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:24:10,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:10,285 INFO L225 Difference]: With dead ends: 2769 [2019-09-10 08:24:10,285 INFO L226 Difference]: Without dead ends: 2769 [2019-09-10 08:24:10,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:10,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-10 08:24:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-10 08:24:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2186 transitions. [2019-09-10 08:24:10,302 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2186 transitions. Word has length 116 [2019-09-10 08:24:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:10,303 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2186 transitions. [2019-09-10 08:24:10,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2186 transitions. [2019-09-10 08:24:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:24:10,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:10,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:10,305 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:10,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1794515206, now seen corresponding path program 1 times [2019-09-10 08:24:10,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:10,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:10,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:10,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:10,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:10,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:10,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:10,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:10,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:10,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:10,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:10,517 INFO L87 Difference]: Start difference. First operand 1572 states and 2186 transitions. Second operand 9 states. [2019-09-10 08:24:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:14,580 INFO L93 Difference]: Finished difference Result 2745 states and 3845 transitions. [2019-09-10 08:24:14,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:14,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:24:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:14,583 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:24:14,584 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:24:14,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:24:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:24:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2185 transitions. [2019-09-10 08:24:14,598 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2185 transitions. Word has length 116 [2019-09-10 08:24:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:14,599 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2185 transitions. [2019-09-10 08:24:14,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2185 transitions. [2019-09-10 08:24:14,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:24:14,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:14,601 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:14,601 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:14,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:14,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1410611137, now seen corresponding path program 1 times [2019-09-10 08:24:14,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:14,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:14,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:14,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:14,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:14,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:14,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:14,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:14,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:14,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:14,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:14,828 INFO L87 Difference]: Start difference. First operand 1572 states and 2185 transitions. Second operand 9 states. [2019-09-10 08:24:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:18,269 INFO L93 Difference]: Finished difference Result 2745 states and 3843 transitions. [2019-09-10 08:24:18,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:18,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:24:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:18,273 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:24:18,273 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:24:18,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:24:18,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:24:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2184 transitions. [2019-09-10 08:24:18,289 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2184 transitions. Word has length 116 [2019-09-10 08:24:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:18,289 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2184 transitions. [2019-09-10 08:24:18,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2184 transitions. [2019-09-10 08:24:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:24:18,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:18,292 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:18,292 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:18,292 INFO L82 PathProgramCache]: Analyzing trace with hash -996349276, now seen corresponding path program 1 times [2019-09-10 08:24:18,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:18,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:18,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:18,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:18,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:18,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:18,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:18,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:18,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:18,546 INFO L87 Difference]: Start difference. First operand 1572 states and 2184 transitions. Second operand 9 states. [2019-09-10 08:24:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:22,577 INFO L93 Difference]: Finished difference Result 2769 states and 3880 transitions. [2019-09-10 08:24:22,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:22,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:24:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:22,581 INFO L225 Difference]: With dead ends: 2769 [2019-09-10 08:24:22,581 INFO L226 Difference]: Without dead ends: 2769 [2019-09-10 08:24:22,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-10 08:24:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-10 08:24:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2183 transitions. [2019-09-10 08:24:22,603 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2183 transitions. Word has length 116 [2019-09-10 08:24:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:22,603 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2183 transitions. [2019-09-10 08:24:22,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2183 transitions. [2019-09-10 08:24:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:24:22,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:22,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:22,606 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:22,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:22,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1027968626, now seen corresponding path program 1 times [2019-09-10 08:24:22,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:22,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:22,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:22,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:22,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:22,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:22,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:22,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:22,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:22,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:22,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:22,807 INFO L87 Difference]: Start difference. First operand 1572 states and 2183 transitions. Second operand 9 states. [2019-09-10 08:24:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:26,835 INFO L93 Difference]: Finished difference Result 2745 states and 3841 transitions. [2019-09-10 08:24:26,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:26,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:24:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:26,839 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:24:26,839 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:24:26,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:24:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:24:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2182 transitions. [2019-09-10 08:24:26,855 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2182 transitions. Word has length 116 [2019-09-10 08:24:26,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:26,855 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2182 transitions. [2019-09-10 08:24:26,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2182 transitions. [2019-09-10 08:24:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:24:26,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:26,858 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:26,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:26,859 INFO L82 PathProgramCache]: Analyzing trace with hash -926819479, now seen corresponding path program 1 times [2019-09-10 08:24:26,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:26,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:26,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:26,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:26,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:27,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:27,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:27,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:27,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:27,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:27,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:27,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:27,077 INFO L87 Difference]: Start difference. First operand 1572 states and 2182 transitions. Second operand 9 states. [2019-09-10 08:24:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:31,136 INFO L93 Difference]: Finished difference Result 2745 states and 3840 transitions. [2019-09-10 08:24:31,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:31,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:24:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:31,139 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:24:31,139 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:24:31,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:24:31,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:24:31,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2181 transitions. [2019-09-10 08:24:31,159 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2181 transitions. Word has length 116 [2019-09-10 08:24:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:31,159 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2181 transitions. [2019-09-10 08:24:31,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2181 transitions. [2019-09-10 08:24:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:24:31,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:31,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:31,162 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:31,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:31,162 INFO L82 PathProgramCache]: Analyzing trace with hash 579223384, now seen corresponding path program 1 times [2019-09-10 08:24:31,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:31,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:31,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:31,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:31,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:31,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:31,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:31,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:31,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:31,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:31,427 INFO L87 Difference]: Start difference. First operand 1572 states and 2181 transitions. Second operand 9 states. [2019-09-10 08:24:34,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:34,627 INFO L93 Difference]: Finished difference Result 2609 states and 3594 transitions. [2019-09-10 08:24:34,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:34,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:24:34,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:34,632 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:24:34,632 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:24:34,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:24:34,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:24:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:24:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2180 transitions. [2019-09-10 08:24:34,649 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2180 transitions. Word has length 116 [2019-09-10 08:24:34,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:34,649 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2180 transitions. [2019-09-10 08:24:34,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2180 transitions. [2019-09-10 08:24:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:24:34,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:34,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:34,651 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:34,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:34,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1137739447, now seen corresponding path program 1 times [2019-09-10 08:24:34,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:34,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:34,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:34,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:34,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:34,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:34,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:34,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:34,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:34,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:34,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:34,890 INFO L87 Difference]: Start difference. First operand 1572 states and 2180 transitions. Second operand 9 states. [2019-09-10 08:24:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:38,555 INFO L93 Difference]: Finished difference Result 2697 states and 3750 transitions. [2019-09-10 08:24:38,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:38,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:24:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:38,558 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:24:38,559 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:24:38,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:24:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:24:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2178 transitions. [2019-09-10 08:24:38,582 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2178 transitions. Word has length 118 [2019-09-10 08:24:38,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:38,582 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2178 transitions. [2019-09-10 08:24:38,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:38,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2178 transitions. [2019-09-10 08:24:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:24:38,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:38,585 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:38,585 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:38,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1008288702, now seen corresponding path program 1 times [2019-09-10 08:24:38,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:38,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:38,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:38,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:38,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:38,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:38,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:38,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:38,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:38,790 INFO L87 Difference]: Start difference. First operand 1572 states and 2178 transitions. Second operand 9 states. [2019-09-10 08:24:42,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:42,831 INFO L93 Difference]: Finished difference Result 2745 states and 3830 transitions. [2019-09-10 08:24:42,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:42,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:24:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:42,835 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:24:42,835 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:24:42,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:42,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:24:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:24:42,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2176 transitions. [2019-09-10 08:24:42,853 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2176 transitions. Word has length 118 [2019-09-10 08:24:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:42,853 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2176 transitions. [2019-09-10 08:24:42,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2176 transitions. [2019-09-10 08:24:42,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:24:42,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:42,856 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:42,857 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:42,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:42,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1568062438, now seen corresponding path program 1 times [2019-09-10 08:24:42,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:42,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:42,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:42,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:42,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:43,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:43,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:43,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:43,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:43,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:43,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:43,051 INFO L87 Difference]: Start difference. First operand 1572 states and 2176 transitions. Second operand 9 states. [2019-09-10 08:24:46,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:46,814 INFO L93 Difference]: Finished difference Result 2697 states and 3746 transitions. [2019-09-10 08:24:46,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:46,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:24:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:46,818 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:24:46,818 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:24:46,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:24:46,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:24:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2174 transitions. [2019-09-10 08:24:46,839 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2174 transitions. Word has length 118 [2019-09-10 08:24:46,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:46,839 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2174 transitions. [2019-09-10 08:24:46,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2174 transitions. [2019-09-10 08:24:46,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:24:46,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:46,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:46,842 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:46,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:46,843 INFO L82 PathProgramCache]: Analyzing trace with hash -530863933, now seen corresponding path program 1 times [2019-09-10 08:24:46,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:46,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:46,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:46,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:46,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:47,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:47,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:47,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:47,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:47,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:47,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:47,042 INFO L87 Difference]: Start difference. First operand 1572 states and 2174 transitions. Second operand 9 states. [2019-09-10 08:24:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:50,205 INFO L93 Difference]: Finished difference Result 2609 states and 3584 transitions. [2019-09-10 08:24:50,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:50,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:24:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:50,209 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:24:50,209 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:24:50,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:24:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:24:50,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:24:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2172 transitions. [2019-09-10 08:24:50,224 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2172 transitions. Word has length 118 [2019-09-10 08:24:50,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:50,225 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2172 transitions. [2019-09-10 08:24:50,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:50,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2172 transitions. [2019-09-10 08:24:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:24:50,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:50,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:50,227 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:50,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:50,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1463192374, now seen corresponding path program 1 times [2019-09-10 08:24:50,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:50,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:50,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:50,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:50,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:50,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:50,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:50,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:50,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:50,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:50,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:50,433 INFO L87 Difference]: Start difference. First operand 1572 states and 2172 transitions. Second operand 9 states. [2019-09-10 08:24:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:54,319 INFO L93 Difference]: Finished difference Result 2745 states and 3824 transitions. [2019-09-10 08:24:54,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:54,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:24:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:54,322 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:24:54,322 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:24:54,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:24:54,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:24:54,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:24:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:54,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2170 transitions. [2019-09-10 08:24:54,339 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2170 transitions. Word has length 118 [2019-09-10 08:24:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:54,339 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2170 transitions. [2019-09-10 08:24:54,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2170 transitions. [2019-09-10 08:24:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:24:54,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:54,342 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:54,342 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:54,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:54,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1333741629, now seen corresponding path program 1 times [2019-09-10 08:24:54,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:54,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:54,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:54,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:54,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:54,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:54,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:54,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:54,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:54,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:54,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:54,537 INFO L87 Difference]: Start difference. First operand 1572 states and 2170 transitions. Second operand 9 states. [2019-09-10 08:24:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:57,731 INFO L93 Difference]: Finished difference Result 2609 states and 3578 transitions. [2019-09-10 08:24:57,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:24:57,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:24:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:57,736 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:24:57,736 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:24:57,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:24:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:24:57,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:24:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:24:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2168 transitions. [2019-09-10 08:24:57,756 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2168 transitions. Word has length 118 [2019-09-10 08:24:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:57,757 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2168 transitions. [2019-09-10 08:24:57,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:24:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2168 transitions. [2019-09-10 08:24:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:24:57,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:57,759 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:57,759 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:57,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:57,759 INFO L82 PathProgramCache]: Analyzing trace with hash -872434601, now seen corresponding path program 1 times [2019-09-10 08:24:57,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:57,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:57,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:57,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:57,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:57,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:57,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:24:57,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:57,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:24:57,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:24:57,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:24:57,939 INFO L87 Difference]: Start difference. First operand 1572 states and 2168 transitions. Second operand 9 states. [2019-09-10 08:25:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:02,052 INFO L93 Difference]: Finished difference Result 2769 states and 3856 transitions. [2019-09-10 08:25:02,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:02,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:02,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:02,056 INFO L225 Difference]: With dead ends: 2769 [2019-09-10 08:25:02,056 INFO L226 Difference]: Without dead ends: 2769 [2019-09-10 08:25:02,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:25:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-09-10 08:25:02,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 1572. [2019-09-10 08:25:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2166 transitions. [2019-09-10 08:25:02,074 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2166 transitions. Word has length 118 [2019-09-10 08:25:02,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:02,074 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2166 transitions. [2019-09-10 08:25:02,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2166 transitions. [2019-09-10 08:25:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:02,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:02,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:02,077 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:02,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:02,077 INFO L82 PathProgramCache]: Analyzing trace with hash 302871591, now seen corresponding path program 1 times [2019-09-10 08:25:02,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:02,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:02,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:02,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:02,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:02,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:02,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:02,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:02,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:02,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:02,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:02,264 INFO L87 Difference]: Start difference. First operand 1572 states and 2166 transitions. Second operand 9 states. [2019-09-10 08:25:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:06,305 INFO L93 Difference]: Finished difference Result 2745 states and 3816 transitions. [2019-09-10 08:25:06,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:06,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:06,309 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:25:06,309 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:25:06,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:25:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:25:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:25:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2164 transitions. [2019-09-10 08:25:06,325 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2164 transitions. Word has length 118 [2019-09-10 08:25:06,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:06,326 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2164 transitions. [2019-09-10 08:25:06,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2164 transitions. [2019-09-10 08:25:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:06,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:06,328 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:06,329 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:06,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:06,329 INFO L82 PathProgramCache]: Analyzing trace with hash -663297848, now seen corresponding path program 1 times [2019-09-10 08:25:06,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:06,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:06,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:06,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:06,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:06,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:06,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:06,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:06,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:06,519 INFO L87 Difference]: Start difference. First operand 1572 states and 2164 transitions. Second operand 9 states. [2019-09-10 08:25:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:10,235 INFO L93 Difference]: Finished difference Result 2697 states and 3732 transitions. [2019-09-10 08:25:10,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:10,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:10,239 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:25:10,239 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:25:10,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:25:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:25:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:25:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2162 transitions. [2019-09-10 08:25:10,257 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2162 transitions. Word has length 118 [2019-09-10 08:25:10,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:10,258 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2162 transitions. [2019-09-10 08:25:10,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2162 transitions. [2019-09-10 08:25:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:10,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:10,260 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:10,261 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:10,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:10,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1456886781, now seen corresponding path program 1 times [2019-09-10 08:25:10,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:10,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:10,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:10,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:10,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:10,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:10,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:10,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:10,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:10,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:10,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:10,517 INFO L87 Difference]: Start difference. First operand 1572 states and 2162 transitions. Second operand 9 states. [2019-09-10 08:25:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:13,769 INFO L93 Difference]: Finished difference Result 2609 states and 3568 transitions. [2019-09-10 08:25:13,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:13,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:13,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:13,774 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:25:13,774 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:25:13,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:25:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:25:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:25:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2160 transitions. [2019-09-10 08:25:13,795 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2160 transitions. Word has length 118 [2019-09-10 08:25:13,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:13,795 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2160 transitions. [2019-09-10 08:25:13,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:13,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2160 transitions. [2019-09-10 08:25:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:13,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:13,798 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:13,798 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1609401380, now seen corresponding path program 1 times [2019-09-10 08:25:13,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:13,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:13,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:13,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:13,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:14,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:14,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:14,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:14,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:14,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:14,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:14,031 INFO L87 Difference]: Start difference. First operand 1572 states and 2160 transitions. Second operand 9 states. [2019-09-10 08:25:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:17,180 INFO L93 Difference]: Finished difference Result 2609 states and 3564 transitions. [2019-09-10 08:25:17,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:17,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:17,184 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:25:17,184 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:25:17,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:25:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:25:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:25:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2158 transitions. [2019-09-10 08:25:17,198 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2158 transitions. Word has length 118 [2019-09-10 08:25:17,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:17,198 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2158 transitions. [2019-09-10 08:25:17,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2158 transitions. [2019-09-10 08:25:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:17,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:17,200 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:17,200 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:17,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:17,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1328567384, now seen corresponding path program 1 times [2019-09-10 08:25:17,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:17,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:17,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:17,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:17,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:17,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 08:25:17,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:17,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:17,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:17,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:17,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:17,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:17,383 INFO L87 Difference]: Start difference. First operand 1572 states and 2158 transitions. Second operand 9 states. [2019-09-10 08:25:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:21,394 INFO L93 Difference]: Finished difference Result 2745 states and 3806 transitions. [2019-09-10 08:25:21,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:21,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:21,398 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:25:21,399 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:25:21,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:25:21,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:25:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:25:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2156 transitions. [2019-09-10 08:25:21,418 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2156 transitions. Word has length 118 [2019-09-10 08:25:21,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:21,418 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2156 transitions. [2019-09-10 08:25:21,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2156 transitions. [2019-09-10 08:25:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:21,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:21,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:21,421 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:21,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:21,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2000230473, now seen corresponding path program 1 times [2019-09-10 08:25:21,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:21,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:21,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:21,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:21,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:21,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:21,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:21,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:21,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:21,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:21,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:21,617 INFO L87 Difference]: Start difference. First operand 1572 states and 2156 transitions. Second operand 9 states. [2019-09-10 08:25:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:25,413 INFO L93 Difference]: Finished difference Result 2697 states and 3722 transitions. [2019-09-10 08:25:25,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:25,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:25,417 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:25:25,417 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:25:25,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:25:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:25:25,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:25:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2154 transitions. [2019-09-10 08:25:25,433 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2154 transitions. Word has length 118 [2019-09-10 08:25:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:25,433 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2154 transitions. [2019-09-10 08:25:25,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:25,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2154 transitions. [2019-09-10 08:25:25,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:25,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:25,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:25,436 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:25,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:25,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1344929323, now seen corresponding path program 1 times [2019-09-10 08:25:25,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:25,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:25,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:25,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:25,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:25,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:25,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:25,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:25,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:25,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:25,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:25,607 INFO L87 Difference]: Start difference. First operand 1572 states and 2154 transitions. Second operand 9 states. [2019-09-10 08:25:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:28,734 INFO L93 Difference]: Finished difference Result 2609 states and 3556 transitions. [2019-09-10 08:25:28,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:28,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:28,738 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:25:28,738 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:25:28,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:25:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:25:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:25:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2152 transitions. [2019-09-10 08:25:28,753 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2152 transitions. Word has length 118 [2019-09-10 08:25:28,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:28,753 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2152 transitions. [2019-09-10 08:25:28,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:28,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2152 transitions. [2019-09-10 08:25:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:28,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:28,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:28,756 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:28,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:28,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1214970847, now seen corresponding path program 1 times [2019-09-10 08:25:28,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:28,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:28,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:28,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:28,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:28,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:28,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:28,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:28,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:28,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:28,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:28,934 INFO L87 Difference]: Start difference. First operand 1572 states and 2152 transitions. Second operand 9 states. [2019-09-10 08:25:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:33,119 INFO L93 Difference]: Finished difference Result 2745 states and 3796 transitions. [2019-09-10 08:25:33,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:33,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:33,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:33,123 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:25:33,123 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:25:33,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:25:33,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:25:33,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:25:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2150 transitions. [2019-09-10 08:25:33,137 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2150 transitions. Word has length 118 [2019-09-10 08:25:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:33,137 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2150 transitions. [2019-09-10 08:25:33,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2150 transitions. [2019-09-10 08:25:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:33,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:33,139 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:33,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:33,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2137460873, now seen corresponding path program 1 times [2019-09-10 08:25:33,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:33,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:33,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:33,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:33,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:33,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:33,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:33,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:33,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:33,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:33,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:33,479 INFO L87 Difference]: Start difference. First operand 1572 states and 2150 transitions. Second operand 9 states. [2019-09-10 08:25:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:37,934 INFO L93 Difference]: Finished difference Result 2697 states and 3717 transitions. [2019-09-10 08:25:37,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:37,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:37,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:37,938 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:25:37,938 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:25:37,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:25:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:25:37,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:25:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2149 transitions. [2019-09-10 08:25:37,954 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2149 transitions. Word has length 118 [2019-09-10 08:25:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:37,954 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2149 transitions. [2019-09-10 08:25:37,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2149 transitions. [2019-09-10 08:25:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:37,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:37,955 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:37,955 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash 98899166, now seen corresponding path program 1 times [2019-09-10 08:25:37,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:37,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:37,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:37,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:37,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:38,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:38,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:38,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:38,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:38,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:38,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:38,107 INFO L87 Difference]: Start difference. First operand 1572 states and 2149 transitions. Second operand 9 states. [2019-09-10 08:25:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:41,249 INFO L93 Difference]: Finished difference Result 2609 states and 3552 transitions. [2019-09-10 08:25:41,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:41,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:41,253 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:25:41,253 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:25:41,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:25:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:25:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:25:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2148 transitions. [2019-09-10 08:25:41,272 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2148 transitions. Word has length 118 [2019-09-10 08:25:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:41,273 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2148 transitions. [2019-09-10 08:25:41,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2148 transitions. [2019-09-10 08:25:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:41,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:41,275 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:41,275 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:41,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:41,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2028055678, now seen corresponding path program 1 times [2019-09-10 08:25:41,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:41,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:41,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:41,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:41,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:41,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:41,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:41,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:41,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:41,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:41,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:41,444 INFO L87 Difference]: Start difference. First operand 1572 states and 2148 transitions. Second operand 9 states. [2019-09-10 08:25:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:45,515 INFO L93 Difference]: Finished difference Result 2745 states and 3790 transitions. [2019-09-10 08:25:45,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:45,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:45,519 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:25:45,519 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:25:45,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:25:45,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:25:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:25:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2147 transitions. [2019-09-10 08:25:45,540 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2147 transitions. Word has length 118 [2019-09-10 08:25:45,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:45,540 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2147 transitions. [2019-09-10 08:25:45,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2147 transitions. [2019-09-10 08:25:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:45,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:45,542 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:45,542 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:45,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:45,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1708413887, now seen corresponding path program 1 times [2019-09-10 08:25:45,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:45,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:45,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:45,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:45,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:45,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:45,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:45,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:45,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:45,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:45,734 INFO L87 Difference]: Start difference. First operand 1572 states and 2147 transitions. Second operand 9 states. [2019-09-10 08:25:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:49,626 INFO L93 Difference]: Finished difference Result 2697 states and 3713 transitions. [2019-09-10 08:25:49,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:49,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:49,630 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:25:49,630 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:25:49,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:25:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:25:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:25:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2146 transitions. [2019-09-10 08:25:49,652 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2146 transitions. Word has length 118 [2019-09-10 08:25:49,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:49,652 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2146 transitions. [2019-09-10 08:25:49,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2146 transitions. [2019-09-10 08:25:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:49,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:49,655 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:49,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1634117260, now seen corresponding path program 1 times [2019-09-10 08:25:49,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:49,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:49,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:49,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:49,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:49,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:49,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:49,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:49,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:49,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:49,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:49,821 INFO L87 Difference]: Start difference. First operand 1572 states and 2146 transitions. Second operand 9 states. [2019-09-10 08:25:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:53,786 INFO L93 Difference]: Finished difference Result 2745 states and 3788 transitions. [2019-09-10 08:25:53,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:53,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:53,789 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:25:53,790 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:25:53,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:25:53,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:25:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:25:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2145 transitions. [2019-09-10 08:25:53,804 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2145 transitions. Word has length 118 [2019-09-10 08:25:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:53,804 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2145 transitions. [2019-09-10 08:25:53,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2145 transitions. [2019-09-10 08:25:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:53,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:53,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:53,806 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:53,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:53,806 INFO L82 PathProgramCache]: Analyzing trace with hash 190374528, now seen corresponding path program 1 times [2019-09-10 08:25:53,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:53,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:53,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:53,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:53,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:53,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:53,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:53,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:53,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:53,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:53,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:53,968 INFO L87 Difference]: Start difference. First operand 1572 states and 2145 transitions. Second operand 9 states. [2019-09-10 08:25:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:57,899 INFO L93 Difference]: Finished difference Result 2697 states and 3710 transitions. [2019-09-10 08:25:57,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:25:57,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:25:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:57,903 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:25:57,903 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:25:57,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:25:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:25:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:25:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:25:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2144 transitions. [2019-09-10 08:25:57,917 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2144 transitions. Word has length 118 [2019-09-10 08:25:57,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:57,917 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2144 transitions. [2019-09-10 08:25:57,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:57,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2144 transitions. [2019-09-10 08:25:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:25:57,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:57,919 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:57,919 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:57,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:57,920 INFO L82 PathProgramCache]: Analyzing trace with hash 661276899, now seen corresponding path program 1 times [2019-09-10 08:25:57,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:57,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:57,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:57,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:57,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:58,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:58,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:58,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:58,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:58,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:58,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:58,133 INFO L87 Difference]: Start difference. First operand 1572 states and 2144 transitions. Second operand 9 states. [2019-09-10 08:26:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:02,068 INFO L93 Difference]: Finished difference Result 2697 states and 3709 transitions. [2019-09-10 08:26:02,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:02,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:02,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:02,072 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:26:02,073 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:26:02,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:26:02,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:26:02,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2143 transitions. [2019-09-10 08:26:02,106 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2143 transitions. Word has length 118 [2019-09-10 08:26:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:02,106 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2143 transitions. [2019-09-10 08:26:02,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2143 transitions. [2019-09-10 08:26:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:02,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:02,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:02,108 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:02,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:02,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1436168909, now seen corresponding path program 1 times [2019-09-10 08:26:02,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:02,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:02,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:02,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:02,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:02,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:02,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:02,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:02,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:02,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:02,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:02,267 INFO L87 Difference]: Start difference. First operand 1572 states and 2143 transitions. Second operand 9 states. [2019-09-10 08:26:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:06,184 INFO L93 Difference]: Finished difference Result 2697 states and 3707 transitions. [2019-09-10 08:26:06,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:06,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:06,188 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:26:06,188 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:26:06,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:26:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:26:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:06,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2142 transitions. [2019-09-10 08:26:06,204 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2142 transitions. Word has length 118 [2019-09-10 08:26:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:06,204 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2142 transitions. [2019-09-10 08:26:06,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2142 transitions. [2019-09-10 08:26:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:06,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:06,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:06,206 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1268958251, now seen corresponding path program 1 times [2019-09-10 08:26:06,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:06,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:06,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:06,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:06,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:06,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:06,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:06,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:06,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:06,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:06,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:06,352 INFO L87 Difference]: Start difference. First operand 1572 states and 2142 transitions. Second operand 9 states. [2019-09-10 08:26:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:10,240 INFO L93 Difference]: Finished difference Result 2745 states and 3781 transitions. [2019-09-10 08:26:10,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:10,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:10,243 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:26:10,244 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:26:10,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:26:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:26:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2141 transitions. [2019-09-10 08:26:10,260 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2141 transitions. Word has length 118 [2019-09-10 08:26:10,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:10,260 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2141 transitions. [2019-09-10 08:26:10,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2141 transitions. [2019-09-10 08:26:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:10,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:10,262 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:10,262 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:10,262 INFO L82 PathProgramCache]: Analyzing trace with hash 302788812, now seen corresponding path program 1 times [2019-09-10 08:26:10,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:10,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:10,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:10,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:10,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:10,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:10,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:10,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:10,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:10,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:10,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:10,405 INFO L87 Difference]: Start difference. First operand 1572 states and 2141 transitions. Second operand 9 states. [2019-09-10 08:26:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:14,259 INFO L93 Difference]: Finished difference Result 2697 states and 3705 transitions. [2019-09-10 08:26:14,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:14,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:14,263 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:26:14,263 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:26:14,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:26:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:26:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2140 transitions. [2019-09-10 08:26:14,276 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2140 transitions. Word has length 118 [2019-09-10 08:26:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:14,276 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2140 transitions. [2019-09-10 08:26:14,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2140 transitions. [2019-09-10 08:26:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:14,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:14,277 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:14,278 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1718311127, now seen corresponding path program 1 times [2019-09-10 08:26:14,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:14,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:14,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:14,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:14,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:14,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:14,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:14,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:14,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:14,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:14,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:14,441 INFO L87 Difference]: Start difference. First operand 1572 states and 2140 transitions. Second operand 9 states. [2019-09-10 08:26:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:18,393 INFO L93 Difference]: Finished difference Result 2697 states and 3704 transitions. [2019-09-10 08:26:18,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:18,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:18,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:18,397 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:26:18,397 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:26:18,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:18,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:26:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:26:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2139 transitions. [2019-09-10 08:26:18,412 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2139 transitions. Word has length 118 [2019-09-10 08:26:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:18,412 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2139 transitions. [2019-09-10 08:26:18,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:18,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2139 transitions. [2019-09-10 08:26:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:18,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:18,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:18,415 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:18,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:18,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1719479256, now seen corresponding path program 1 times [2019-09-10 08:26:18,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:18,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:18,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:18,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:18,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:18,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:18,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:18,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:18,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:18,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:18,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:18,576 INFO L87 Difference]: Start difference. First operand 1572 states and 2139 transitions. Second operand 9 states. [2019-09-10 08:26:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:22,610 INFO L93 Difference]: Finished difference Result 2697 states and 3702 transitions. [2019-09-10 08:26:22,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:22,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:22,613 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:26:22,614 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:26:22,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:26:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:26:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2138 transitions. [2019-09-10 08:26:22,629 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2138 transitions. Word has length 118 [2019-09-10 08:26:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:22,629 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2138 transitions. [2019-09-10 08:26:22,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2138 transitions. [2019-09-10 08:26:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:22,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:22,630 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:22,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:22,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1598048276, now seen corresponding path program 1 times [2019-09-10 08:26:22,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:22,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:22,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:22,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:22,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:22,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:22,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:22,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:22,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:22,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:22,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:22,808 INFO L87 Difference]: Start difference. First operand 1572 states and 2138 transitions. Second operand 9 states. [2019-09-10 08:26:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:26,746 INFO L93 Difference]: Finished difference Result 2697 states and 3700 transitions. [2019-09-10 08:26:26,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:26,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:26,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:26,750 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:26:26,750 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:26:26,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:26:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:26:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2137 transitions. [2019-09-10 08:26:26,790 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2137 transitions. Word has length 118 [2019-09-10 08:26:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:26,790 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2137 transitions. [2019-09-10 08:26:26,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2137 transitions. [2019-09-10 08:26:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:26,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:26,792 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:26,792 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:26,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:26,793 INFO L82 PathProgramCache]: Analyzing trace with hash -988448613, now seen corresponding path program 1 times [2019-09-10 08:26:26,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:26,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:26,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:26,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:26,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:26,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:26,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:26,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:26,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:26,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:26,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:26,950 INFO L87 Difference]: Start difference. First operand 1572 states and 2137 transitions. Second operand 9 states. [2019-09-10 08:26:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:30,787 INFO L93 Difference]: Finished difference Result 2697 states and 3699 transitions. [2019-09-10 08:26:30,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:30,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:30,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:30,790 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:26:30,790 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:26:30,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:26:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:26:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2136 transitions. [2019-09-10 08:26:30,805 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2136 transitions. Word has length 118 [2019-09-10 08:26:30,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:30,805 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2136 transitions. [2019-09-10 08:26:30,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2136 transitions. [2019-09-10 08:26:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:30,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:30,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:30,806 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:30,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:30,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1394299562, now seen corresponding path program 1 times [2019-09-10 08:26:30,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:30,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:30,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:30,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:30,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:30,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:30,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:30,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:30,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:30,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:30,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:30,952 INFO L87 Difference]: Start difference. First operand 1572 states and 2136 transitions. Second operand 9 states. [2019-09-10 08:26:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:34,982 INFO L93 Difference]: Finished difference Result 2745 states and 3772 transitions. [2019-09-10 08:26:34,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:34,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:34,986 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:26:34,986 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:26:34,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:26:34,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:26:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2135 transitions. [2019-09-10 08:26:35,001 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2135 transitions. Word has length 118 [2019-09-10 08:26:35,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:35,001 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2135 transitions. [2019-09-10 08:26:35,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2135 transitions. [2019-09-10 08:26:35,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:26:35,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:35,002 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:35,002 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:35,003 INFO L82 PathProgramCache]: Analyzing trace with hash -524771572, now seen corresponding path program 1 times [2019-09-10 08:26:35,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:35,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:35,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:35,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:35,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:35,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:35,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:35,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:35,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:35,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:35,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:35,184 INFO L87 Difference]: Start difference. First operand 1572 states and 2135 transitions. Second operand 9 states. [2019-09-10 08:26:38,816 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-09-10 08:26:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:38,928 INFO L93 Difference]: Finished difference Result 2609 states and 3537 transitions. [2019-09-10 08:26:38,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:38,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:26:38,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:38,932 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:26:38,932 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:26:38,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:26:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:26:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:26:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2134 transitions. [2019-09-10 08:26:38,947 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2134 transitions. Word has length 119 [2019-09-10 08:26:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:38,947 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2134 transitions. [2019-09-10 08:26:38,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2134 transitions. [2019-09-10 08:26:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:26:38,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:38,948 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:38,948 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:38,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash 438986769, now seen corresponding path program 1 times [2019-09-10 08:26:38,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:38,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:38,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:38,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:38,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:39,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:39,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:39,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:39,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:39,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:39,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:39,117 INFO L87 Difference]: Start difference. First operand 1572 states and 2134 transitions. Second operand 9 states. [2019-09-10 08:26:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:42,916 INFO L93 Difference]: Finished difference Result 2697 states and 3693 transitions. [2019-09-10 08:26:42,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:42,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:26:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:42,919 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:26:42,919 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:26:42,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:26:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:26:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2132 transitions. [2019-09-10 08:26:42,936 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2132 transitions. Word has length 120 [2019-09-10 08:26:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:42,936 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2132 transitions. [2019-09-10 08:26:42,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2132 transitions. [2019-09-10 08:26:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:26:42,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:42,938 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:42,939 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:42,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1490169743, now seen corresponding path program 1 times [2019-09-10 08:26:42,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:42,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:42,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:42,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:42,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:43,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:43,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:43,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:43,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:43,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:43,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:43,100 INFO L87 Difference]: Start difference. First operand 1572 states and 2132 transitions. Second operand 9 states. [2019-09-10 08:26:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:46,748 INFO L93 Difference]: Finished difference Result 2609 states and 3533 transitions. [2019-09-10 08:26:46,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:46,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:26:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:46,752 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:26:46,752 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:26:46,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:26:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:26:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2130 transitions. [2019-09-10 08:26:46,769 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2130 transitions. Word has length 120 [2019-09-10 08:26:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:46,769 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2130 transitions. [2019-09-10 08:26:46,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2130 transitions. [2019-09-10 08:26:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:26:46,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:46,771 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:46,771 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:46,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:46,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1643582949, now seen corresponding path program 1 times [2019-09-10 08:26:46,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:46,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:46,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:46,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:46,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:46,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:46,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:46,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:46,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:46,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:46,926 INFO L87 Difference]: Start difference. First operand 1572 states and 2130 transitions. Second operand 9 states. [2019-09-10 08:26:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:50,581 INFO L93 Difference]: Finished difference Result 2609 states and 3529 transitions. [2019-09-10 08:26:50,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:50,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:26:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:50,584 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:26:50,585 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:26:50,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:26:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:26:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2128 transitions. [2019-09-10 08:26:50,599 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2128 transitions. Word has length 120 [2019-09-10 08:26:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:50,600 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2128 transitions. [2019-09-10 08:26:50,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2128 transitions. [2019-09-10 08:26:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:26:50,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:50,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:50,602 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:50,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:50,602 INFO L82 PathProgramCache]: Analyzing trace with hash -526309723, now seen corresponding path program 1 times [2019-09-10 08:26:50,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:50,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:50,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:50,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:50,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:50,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:50,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:50,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:50,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:50,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:50,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:50,751 INFO L87 Difference]: Start difference. First operand 1572 states and 2128 transitions. Second operand 9 states. [2019-09-10 08:26:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:54,111 INFO L93 Difference]: Finished difference Result 2609 states and 3527 transitions. [2019-09-10 08:26:54,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:54,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:26:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:54,114 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:26:54,114 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:26:54,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:26:54,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:26:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:26:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2126 transitions. [2019-09-10 08:26:54,130 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2126 transitions. Word has length 120 [2019-09-10 08:26:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:54,130 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2126 transitions. [2019-09-10 08:26:54,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2126 transitions. [2019-09-10 08:26:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:26:54,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:54,132 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:54,132 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:54,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:54,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1818410374, now seen corresponding path program 1 times [2019-09-10 08:26:54,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:54,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:54,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:54,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:54,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:54,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:54,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:54,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:54,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:54,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:54,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:54,282 INFO L87 Difference]: Start difference. First operand 1572 states and 2126 transitions. Second operand 9 states. [2019-09-10 08:26:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:57,639 INFO L93 Difference]: Finished difference Result 2609 states and 3523 transitions. [2019-09-10 08:26:57,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:57,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:26:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:57,643 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:26:57,643 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:26:57,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:26:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:26:57,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:26:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:26:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2124 transitions. [2019-09-10 08:26:57,657 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2124 transitions. Word has length 120 [2019-09-10 08:26:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:57,657 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2124 transitions. [2019-09-10 08:26:57,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2124 transitions. [2019-09-10 08:26:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:26:57,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:57,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:57,659 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:57,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:57,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2031462205, now seen corresponding path program 1 times [2019-09-10 08:26:57,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:57,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:57,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:57,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:57,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:57,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:57,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:57,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:57,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:57,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:57,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:57,838 INFO L87 Difference]: Start difference. First operand 1572 states and 2124 transitions. Second operand 9 states. [2019-09-10 08:27:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:01,352 INFO L93 Difference]: Finished difference Result 2609 states and 3521 transitions. [2019-09-10 08:27:01,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:01,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:01,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:01,356 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:27:01,356 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:27:01,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:27:01,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:27:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2122 transitions. [2019-09-10 08:27:01,374 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2122 transitions. Word has length 120 [2019-09-10 08:27:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:01,374 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2122 transitions. [2019-09-10 08:27:01,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2122 transitions. [2019-09-10 08:27:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:01,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:01,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:01,376 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:01,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash -34663321, now seen corresponding path program 1 times [2019-09-10 08:27:01,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:01,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:01,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:01,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:01,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:01,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:01,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:01,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:01,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:01,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:01,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:01,524 INFO L87 Difference]: Start difference. First operand 1572 states and 2122 transitions. Second operand 9 states. [2019-09-10 08:27:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:05,537 INFO L93 Difference]: Finished difference Result 2697 states and 3675 transitions. [2019-09-10 08:27:05,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:05,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:05,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:05,541 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:27:05,541 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:27:05,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:05,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:27:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:27:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2120 transitions. [2019-09-10 08:27:05,557 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2120 transitions. Word has length 120 [2019-09-10 08:27:05,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:05,558 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2120 transitions. [2019-09-10 08:27:05,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2120 transitions. [2019-09-10 08:27:05,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:05,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:05,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:05,560 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:05,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:05,560 INFO L82 PathProgramCache]: Analyzing trace with hash 462579645, now seen corresponding path program 1 times [2019-09-10 08:27:05,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:05,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:05,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:05,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:05,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:05,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:05,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:05,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:05,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:05,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:05,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:05,709 INFO L87 Difference]: Start difference. First operand 1572 states and 2120 transitions. Second operand 9 states. [2019-09-10 08:27:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:09,473 INFO L93 Difference]: Finished difference Result 2697 states and 3671 transitions. [2019-09-10 08:27:09,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:09,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:09,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:09,477 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:27:09,477 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:27:09,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:27:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:27:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2118 transitions. [2019-09-10 08:27:09,491 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2118 transitions. Word has length 120 [2019-09-10 08:27:09,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:09,491 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2118 transitions. [2019-09-10 08:27:09,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2118 transitions. [2019-09-10 08:27:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:09,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:09,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:09,494 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1466576867, now seen corresponding path program 1 times [2019-09-10 08:27:09,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:09,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:09,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:09,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:09,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:09,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:09,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:09,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:09,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:09,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:09,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:09,659 INFO L87 Difference]: Start difference. First operand 1572 states and 2118 transitions. Second operand 9 states. [2019-09-10 08:27:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:13,193 INFO L93 Difference]: Finished difference Result 2609 states and 3515 transitions. [2019-09-10 08:27:13,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:13,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:13,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:13,196 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:27:13,197 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:27:13,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:27:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:27:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2116 transitions. [2019-09-10 08:27:13,210 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2116 transitions. Word has length 120 [2019-09-10 08:27:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:13,211 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2116 transitions. [2019-09-10 08:27:13,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2116 transitions. [2019-09-10 08:27:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:13,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:13,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:13,212 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:13,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:13,212 INFO L82 PathProgramCache]: Analyzing trace with hash -502475548, now seen corresponding path program 1 times [2019-09-10 08:27:13,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:13,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:13,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:13,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:13,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:13,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:13,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:13,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:13,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:13,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:13,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:13,358 INFO L87 Difference]: Start difference. First operand 1572 states and 2116 transitions. Second operand 9 states. [2019-09-10 08:27:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:16,615 INFO L93 Difference]: Finished difference Result 2609 states and 3513 transitions. [2019-09-10 08:27:16,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:16,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:16,619 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:27:16,619 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:27:16,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:27:16,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:27:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:27:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2114 transitions. [2019-09-10 08:27:16,634 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2114 transitions. Word has length 120 [2019-09-10 08:27:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:16,634 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2114 transitions. [2019-09-10 08:27:16,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2114 transitions. [2019-09-10 08:27:16,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:16,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:16,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:16,636 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:16,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1493972807, now seen corresponding path program 1 times [2019-09-10 08:27:16,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:16,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:16,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:16,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:16,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:16,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:16,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:16,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:16,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:16,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:16,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:16,782 INFO L87 Difference]: Start difference. First operand 1572 states and 2114 transitions. Second operand 9 states. [2019-09-10 08:27:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:20,586 INFO L93 Difference]: Finished difference Result 2697 states and 3663 transitions. [2019-09-10 08:27:20,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:20,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:20,589 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:27:20,589 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:27:20,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:27:20,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:27:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2112 transitions. [2019-09-10 08:27:20,603 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2112 transitions. Word has length 120 [2019-09-10 08:27:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:20,604 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2112 transitions. [2019-09-10 08:27:20,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:20,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2112 transitions. [2019-09-10 08:27:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:20,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:20,605 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:20,605 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:20,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:20,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2061061959, now seen corresponding path program 1 times [2019-09-10 08:27:20,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:20,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:20,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:20,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:20,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:20,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:20,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:20,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:20,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:20,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:20,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:20,750 INFO L87 Difference]: Start difference. First operand 1572 states and 2112 transitions. Second operand 9 states. [2019-09-10 08:27:24,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:24,603 INFO L93 Difference]: Finished difference Result 2745 states and 3737 transitions. [2019-09-10 08:27:24,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:24,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:24,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:24,606 INFO L225 Difference]: With dead ends: 2745 [2019-09-10 08:27:24,607 INFO L226 Difference]: Without dead ends: 2745 [2019-09-10 08:27:24,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:24,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-10 08:27:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1572. [2019-09-10 08:27:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2110 transitions. [2019-09-10 08:27:24,620 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2110 transitions. Word has length 120 [2019-09-10 08:27:24,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:24,620 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2110 transitions. [2019-09-10 08:27:24,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2110 transitions. [2019-09-10 08:27:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:24,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:24,622 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:24,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:24,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1566617361, now seen corresponding path program 1 times [2019-09-10 08:27:24,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:24,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:24,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:24,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:24,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:24,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:24,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:24,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:24,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:24,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:24,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:24,770 INFO L87 Difference]: Start difference. First operand 1572 states and 2110 transitions. Second operand 9 states. [2019-09-10 08:27:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:28,288 INFO L93 Difference]: Finished difference Result 2609 states and 3507 transitions. [2019-09-10 08:27:28,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:28,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:28,292 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:27:28,292 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:27:28,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:27:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:27:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2108 transitions. [2019-09-10 08:27:28,306 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2108 transitions. Word has length 120 [2019-09-10 08:27:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:28,306 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2108 transitions. [2019-09-10 08:27:28,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2108 transitions. [2019-09-10 08:27:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:28,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:28,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:28,308 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:28,308 INFO L82 PathProgramCache]: Analyzing trace with hash -799193423, now seen corresponding path program 1 times [2019-09-10 08:27:28,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:28,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:28,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:28,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:28,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:28,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:28,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:28,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:28,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:28,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:28,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:28,480 INFO L87 Difference]: Start difference. First operand 1572 states and 2108 transitions. Second operand 9 states. [2019-09-10 08:27:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:32,275 INFO L93 Difference]: Finished difference Result 2697 states and 3657 transitions. [2019-09-10 08:27:32,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:32,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:32,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:32,279 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:27:32,279 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:27:32,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:27:32,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:27:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2106 transitions. [2019-09-10 08:27:32,292 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2106 transitions. Word has length 120 [2019-09-10 08:27:32,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:32,292 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2106 transitions. [2019-09-10 08:27:32,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2106 transitions. [2019-09-10 08:27:32,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:32,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:32,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:32,294 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:32,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:32,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1289509032, now seen corresponding path program 1 times [2019-09-10 08:27:32,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:32,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:32,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:32,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:32,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:32,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:32,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:32,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:32,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:32,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:32,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:32,471 INFO L87 Difference]: Start difference. First operand 1572 states and 2106 transitions. Second operand 9 states. [2019-09-10 08:27:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:35,815 INFO L93 Difference]: Finished difference Result 2609 states and 3501 transitions. [2019-09-10 08:27:35,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:35,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:35,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:35,819 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:27:35,819 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:27:35,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:27:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:27:35,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:27:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2104 transitions. [2019-09-10 08:27:35,832 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2104 transitions. Word has length 120 [2019-09-10 08:27:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:35,833 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2104 transitions. [2019-09-10 08:27:35,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2104 transitions. [2019-09-10 08:27:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:35,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:35,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:35,834 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:35,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:35,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1774124078, now seen corresponding path program 1 times [2019-09-10 08:27:35,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:35,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:35,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:35,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:35,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:35,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:35,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:35,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:35,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:35,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:35,983 INFO L87 Difference]: Start difference. First operand 1572 states and 2104 transitions. Second operand 9 states. [2019-09-10 08:27:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:39,527 INFO L93 Difference]: Finished difference Result 2609 states and 3499 transitions. [2019-09-10 08:27:39,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:39,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:39,531 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:27:39,531 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:27:39,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:39,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:27:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:27:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2102 transitions. [2019-09-10 08:27:39,545 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2102 transitions. Word has length 120 [2019-09-10 08:27:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:39,546 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2102 transitions. [2019-09-10 08:27:39,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2102 transitions. [2019-09-10 08:27:39,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:39,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:39,547 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:39,547 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:39,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:39,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1734122598, now seen corresponding path program 1 times [2019-09-10 08:27:39,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:39,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:39,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:39,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:39,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:39,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:39,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:39,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:39,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:39,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:39,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:39,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:39,719 INFO L87 Difference]: Start difference. First operand 1572 states and 2102 transitions. Second operand 9 states. [2019-09-10 08:27:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:43,508 INFO L93 Difference]: Finished difference Result 2697 states and 3649 transitions. [2019-09-10 08:27:43,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:43,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:43,512 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:27:43,512 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:27:43,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:27:43,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:27:43,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2100 transitions. [2019-09-10 08:27:43,526 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2100 transitions. Word has length 120 [2019-09-10 08:27:43,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:43,526 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2100 transitions. [2019-09-10 08:27:43,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2100 transitions. [2019-09-10 08:27:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:43,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:43,528 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:43,528 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:43,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:43,528 INFO L82 PathProgramCache]: Analyzing trace with hash -928740028, now seen corresponding path program 1 times [2019-09-10 08:27:43,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:43,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:43,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:43,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:43,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:43,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:43,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:43,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:43,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:43,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:43,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:43,682 INFO L87 Difference]: Start difference. First operand 1572 states and 2100 transitions. Second operand 9 states. [2019-09-10 08:27:47,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:47,231 INFO L93 Difference]: Finished difference Result 2609 states and 3495 transitions. [2019-09-10 08:27:47,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:47,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:47,234 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:27:47,235 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:27:47,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:27:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:27:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2098 transitions. [2019-09-10 08:27:47,249 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2098 transitions. Word has length 120 [2019-09-10 08:27:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:47,249 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2098 transitions. [2019-09-10 08:27:47,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2098 transitions. [2019-09-10 08:27:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:47,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:47,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:47,252 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:47,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1993016462, now seen corresponding path program 1 times [2019-09-10 08:27:47,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:47,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:47,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:47,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:47,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:47,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:47,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:47,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:47,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:47,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:47,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:47,416 INFO L87 Difference]: Start difference. First operand 1572 states and 2098 transitions. Second operand 9 states. [2019-09-10 08:27:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:50,955 INFO L93 Difference]: Finished difference Result 2609 states and 3493 transitions. [2019-09-10 08:27:50,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:50,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:50,958 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:27:50,958 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:27:50,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:50,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:27:50,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:27:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2096 transitions. [2019-09-10 08:27:50,972 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2096 transitions. Word has length 120 [2019-09-10 08:27:50,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:50,972 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2096 transitions. [2019-09-10 08:27:50,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2096 transitions. [2019-09-10 08:27:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:50,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:50,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:50,974 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:50,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:50,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2093888074, now seen corresponding path program 1 times [2019-09-10 08:27:50,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:50,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:50,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:50,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:50,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:51,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:51,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:51,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:51,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:51,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:51,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:51,133 INFO L87 Difference]: Start difference. First operand 1572 states and 2096 transitions. Second operand 9 states. [2019-09-10 08:27:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:55,104 INFO L93 Difference]: Finished difference Result 2697 states and 3637 transitions. [2019-09-10 08:27:55,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:55,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:55,108 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:27:55,108 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:27:55,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:27:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:27:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2094 transitions. [2019-09-10 08:27:55,122 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2094 transitions. Word has length 120 [2019-09-10 08:27:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:55,123 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2094 transitions. [2019-09-10 08:27:55,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2094 transitions. [2019-09-10 08:27:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:55,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:55,124 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:55,124 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:55,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:55,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2079343493, now seen corresponding path program 1 times [2019-09-10 08:27:55,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:55,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:55,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:55,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:55,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:55,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:55,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:55,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:55,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:55,309 INFO L87 Difference]: Start difference. First operand 1572 states and 2094 transitions. Second operand 9 states. [2019-09-10 08:27:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:59,031 INFO L93 Difference]: Finished difference Result 2697 states and 3633 transitions. [2019-09-10 08:27:59,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:59,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:59,036 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:27:59,036 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:27:59,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:27:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:27:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:27:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2092 transitions. [2019-09-10 08:27:59,051 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2092 transitions. Word has length 120 [2019-09-10 08:27:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:59,051 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2092 transitions. [2019-09-10 08:27:59,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2092 transitions. [2019-09-10 08:27:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:59,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:59,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:59,052 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:59,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1273960923, now seen corresponding path program 1 times [2019-09-10 08:27:59,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:59,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:59,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:59,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:59,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:59,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:59,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:59,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:59,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:59,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:59,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:59,197 INFO L87 Difference]: Start difference. First operand 1572 states and 2092 transitions. Second operand 9 states. [2019-09-10 08:28:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:02,862 INFO L93 Difference]: Finished difference Result 2609 states and 3487 transitions. [2019-09-10 08:28:02,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:02,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:02,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:02,866 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:28:02,866 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:28:02,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:02,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:28:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:28:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2090 transitions. [2019-09-10 08:28:02,881 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2090 transitions. Word has length 120 [2019-09-10 08:28:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:02,882 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2090 transitions. [2019-09-10 08:28:02,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2090 transitions. [2019-09-10 08:28:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:02,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:02,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:02,884 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:02,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:02,884 INFO L82 PathProgramCache]: Analyzing trace with hash 944288137, now seen corresponding path program 1 times [2019-09-10 08:28:02,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:02,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:02,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:02,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:02,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:03,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:03,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:03,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:03,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:03,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:03,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:03,028 INFO L87 Difference]: Start difference. First operand 1572 states and 2090 transitions. Second operand 9 states. [2019-09-10 08:28:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:06,698 INFO L93 Difference]: Finished difference Result 2609 states and 3483 transitions. [2019-09-10 08:28:06,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:06,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:06,701 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:28:06,701 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:28:06,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:06,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:28:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:28:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2088 transitions. [2019-09-10 08:28:06,715 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2088 transitions. Word has length 120 [2019-09-10 08:28:06,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:06,715 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2088 transitions. [2019-09-10 08:28:06,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2088 transitions. [2019-09-10 08:28:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:06,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:06,717 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:06,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:06,717 INFO L82 PathProgramCache]: Analyzing trace with hash -349907354, now seen corresponding path program 1 times [2019-09-10 08:28:06,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:06,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:06,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:06,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:06,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:06,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:06,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:06,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:06,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:06,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:06,874 INFO L87 Difference]: Start difference. First operand 1572 states and 2088 transitions. Second operand 9 states. [2019-09-10 08:28:10,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:10,420 INFO L93 Difference]: Finished difference Result 2609 states and 3481 transitions. [2019-09-10 08:28:10,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:10,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:10,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:10,424 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:28:10,424 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:28:10,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:28:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:28:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2086 transitions. [2019-09-10 08:28:10,438 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2086 transitions. Word has length 120 [2019-09-10 08:28:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:10,438 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2086 transitions. [2019-09-10 08:28:10,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2086 transitions. [2019-09-10 08:28:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:10,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:10,439 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:10,440 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash -3622801, now seen corresponding path program 1 times [2019-09-10 08:28:10,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:10,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:10,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:10,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:10,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:10,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:10,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:10,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:10,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:10,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:10,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:10,617 INFO L87 Difference]: Start difference. First operand 1572 states and 2086 transitions. Second operand 9 states. [2019-09-10 08:28:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:14,458 INFO L93 Difference]: Finished difference Result 2697 states and 3621 transitions. [2019-09-10 08:28:14,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:14,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:14,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:14,461 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:28:14,461 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:28:14,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:28:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:28:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2084 transitions. [2019-09-10 08:28:14,475 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2084 transitions. Word has length 120 [2019-09-10 08:28:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:14,475 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2084 transitions. [2019-09-10 08:28:14,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2084 transitions. [2019-09-10 08:28:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:14,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:14,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:14,477 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:14,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:14,478 INFO L82 PathProgramCache]: Analyzing trace with hash 381425360, now seen corresponding path program 1 times [2019-09-10 08:28:14,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:14,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:14,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:14,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:14,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:14,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 08:28:14,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:14,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:14,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:14,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:14,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:14,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:14,665 INFO L87 Difference]: Start difference. First operand 1572 states and 2084 transitions. Second operand 9 states. [2019-09-10 08:28:18,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:18,198 INFO L93 Difference]: Finished difference Result 2609 states and 3477 transitions. [2019-09-10 08:28:18,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:18,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:18,202 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:28:18,202 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:28:18,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:28:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:28:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2082 transitions. [2019-09-10 08:28:18,216 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2082 transitions. Word has length 120 [2019-09-10 08:28:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:18,216 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2082 transitions. [2019-09-10 08:28:18,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2082 transitions. [2019-09-10 08:28:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:18,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:18,217 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:18,218 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:18,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:18,218 INFO L82 PathProgramCache]: Analyzing trace with hash 663554906, now seen corresponding path program 1 times [2019-09-10 08:28:18,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:18,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:18,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:18,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:18,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:18,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:18,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:18,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:18,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:18,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:18,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:18,367 INFO L87 Difference]: Start difference. First operand 1572 states and 2082 transitions. Second operand 9 states. [2019-09-10 08:28:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:22,032 INFO L93 Difference]: Finished difference Result 2697 states and 3615 transitions. [2019-09-10 08:28:22,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:22,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:22,036 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:28:22,036 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:28:22,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:28:22,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:28:22,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2080 transitions. [2019-09-10 08:28:22,051 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2080 transitions. Word has length 120 [2019-09-10 08:28:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:22,051 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2080 transitions. [2019-09-10 08:28:22,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2080 transitions. [2019-09-10 08:28:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:22,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:22,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:22,053 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:22,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:22,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1468937476, now seen corresponding path program 1 times [2019-09-10 08:28:22,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:22,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:22,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:22,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:22,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:22,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:22,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:22,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:22,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:22,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:22,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:22,217 INFO L87 Difference]: Start difference. First operand 1572 states and 2080 transitions. Second operand 9 states. [2019-09-10 08:28:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:25,834 INFO L93 Difference]: Finished difference Result 2609 states and 3473 transitions. [2019-09-10 08:28:25,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:25,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:25,837 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:28:25,838 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:28:25,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:28:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:28:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2078 transitions. [2019-09-10 08:28:25,851 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2078 transitions. Word has length 120 [2019-09-10 08:28:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:25,851 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2078 transitions. [2019-09-10 08:28:25,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2078 transitions. [2019-09-10 08:28:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:25,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:25,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:25,853 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:25,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:25,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1182548337, now seen corresponding path program 1 times [2019-09-10 08:28:25,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:25,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:25,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:25,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:25,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:25,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:25,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:25,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:25,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:25,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:25,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:25,994 INFO L87 Difference]: Start difference. First operand 1572 states and 2078 transitions. Second operand 9 states. [2019-09-10 08:28:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:29,813 INFO L93 Difference]: Finished difference Result 2697 states and 3611 transitions. [2019-09-10 08:28:29,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:29,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:29,817 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:28:29,818 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:28:29,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:28:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:28:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2077 transitions. [2019-09-10 08:28:29,865 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2077 transitions. Word has length 120 [2019-09-10 08:28:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:29,865 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2077 transitions. [2019-09-10 08:28:29,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2077 transitions. [2019-09-10 08:28:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:29,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:29,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:29,867 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:29,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:29,867 INFO L82 PathProgramCache]: Analyzing trace with hash 215975840, now seen corresponding path program 1 times [2019-09-10 08:28:29,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:29,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:29,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:29,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:29,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:30,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:30,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:30,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:30,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:30,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:30,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:30,011 INFO L87 Difference]: Start difference. First operand 1572 states and 2077 transitions. Second operand 9 states. [2019-09-10 08:28:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:33,648 INFO L93 Difference]: Finished difference Result 2609 states and 3471 transitions. [2019-09-10 08:28:33,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:33,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:33,652 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:28:33,652 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:28:33,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:28:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:28:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2076 transitions. [2019-09-10 08:28:33,671 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2076 transitions. Word has length 120 [2019-09-10 08:28:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:33,671 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2076 transitions. [2019-09-10 08:28:33,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2076 transitions. [2019-09-10 08:28:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:33,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:33,673 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:33,673 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:33,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:33,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1907822779, now seen corresponding path program 1 times [2019-09-10 08:28:33,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:33,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:33,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:33,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:33,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:33,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:33,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:33,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:33,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:33,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:33,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:33,831 INFO L87 Difference]: Start difference. First operand 1572 states and 2076 transitions. Second operand 9 states. [2019-09-10 08:28:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:37,597 INFO L93 Difference]: Finished difference Result 2609 states and 3469 transitions. [2019-09-10 08:28:37,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:37,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:37,600 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:28:37,600 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:28:37,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:28:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:28:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2075 transitions. [2019-09-10 08:28:37,614 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2075 transitions. Word has length 120 [2019-09-10 08:28:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:37,614 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2075 transitions. [2019-09-10 08:28:37,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2075 transitions. [2019-09-10 08:28:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:37,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:37,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:37,616 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:37,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:37,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1734271359, now seen corresponding path program 1 times [2019-09-10 08:28:37,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:37,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:37,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:37,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:37,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:37,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:37,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:37,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:37,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:37,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:37,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:37,762 INFO L87 Difference]: Start difference. First operand 1572 states and 2075 transitions. Second operand 9 states. [2019-09-10 08:28:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:41,427 INFO L93 Difference]: Finished difference Result 2609 states and 3467 transitions. [2019-09-10 08:28:41,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:41,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:41,431 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:28:41,431 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:28:41,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:28:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:28:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2074 transitions. [2019-09-10 08:28:41,445 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2074 transitions. Word has length 120 [2019-09-10 08:28:41,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:41,445 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2074 transitions. [2019-09-10 08:28:41,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2074 transitions. [2019-09-10 08:28:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:41,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:41,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:41,447 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:41,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:41,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1289176642, now seen corresponding path program 1 times [2019-09-10 08:28:41,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:41,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:41,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:41,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:41,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:41,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:41,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:41,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:41,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:41,603 INFO L87 Difference]: Start difference. First operand 1572 states and 2074 transitions. Second operand 9 states. [2019-09-10 08:28:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:44,795 INFO L93 Difference]: Finished difference Result 2609 states and 3466 transitions. [2019-09-10 08:28:44,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:44,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:44,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:44,800 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:28:44,800 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:28:44,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:28:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:28:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:28:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2073 transitions. [2019-09-10 08:28:44,814 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2073 transitions. Word has length 120 [2019-09-10 08:28:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:44,814 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2073 transitions. [2019-09-10 08:28:44,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2073 transitions. [2019-09-10 08:28:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:44,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:44,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:44,816 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:44,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash 708898247, now seen corresponding path program 1 times [2019-09-10 08:28:44,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:44,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:44,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:44,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:44,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:44,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:44,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:44,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:44,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:44,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:44,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:44,991 INFO L87 Difference]: Start difference. First operand 1572 states and 2073 transitions. Second operand 9 states. [2019-09-10 08:28:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:48,825 INFO L93 Difference]: Finished difference Result 2697 states and 3604 transitions. [2019-09-10 08:28:48,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:48,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:48,829 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:28:48,829 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:28:48,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:48,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:28:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:28:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2072 transitions. [2019-09-10 08:28:48,843 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2072 transitions. Word has length 120 [2019-09-10 08:28:48,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:48,843 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2072 transitions. [2019-09-10 08:28:48,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:48,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2072 transitions. [2019-09-10 08:28:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:48,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:48,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:48,845 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:48,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:48,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1239740929, now seen corresponding path program 1 times [2019-09-10 08:28:48,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:48,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:48,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:48,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:48,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:48,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:48,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:48,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:48,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:48,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:48,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:48,987 INFO L87 Difference]: Start difference. First operand 1572 states and 2072 transitions. Second operand 9 states. [2019-09-10 08:28:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:52,793 INFO L93 Difference]: Finished difference Result 2697 states and 3603 transitions. [2019-09-10 08:28:52,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:52,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:52,797 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:28:52,797 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:28:52,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:28:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:28:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2071 transitions. [2019-09-10 08:28:52,812 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2071 transitions. Word has length 120 [2019-09-10 08:28:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:52,812 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2071 transitions. [2019-09-10 08:28:52,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2071 transitions. [2019-09-10 08:28:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:52,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:52,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:52,813 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:52,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:52,814 INFO L82 PathProgramCache]: Analyzing trace with hash -2071805120, now seen corresponding path program 1 times [2019-09-10 08:28:52,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:52,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:52,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:52,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:52,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:52,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:52,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:52,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:52,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:52,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:52,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:52,958 INFO L87 Difference]: Start difference. First operand 1572 states and 2071 transitions. Second operand 9 states. [2019-09-10 08:28:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:56,444 INFO L93 Difference]: Finished difference Result 2609 states and 3462 transitions. [2019-09-10 08:28:56,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:56,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:56,448 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:28:56,448 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:28:56,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:28:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:28:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:28:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:28:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2070 transitions. [2019-09-10 08:28:56,495 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2070 transitions. Word has length 120 [2019-09-10 08:28:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:56,495 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2070 transitions. [2019-09-10 08:28:56,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2070 transitions. [2019-09-10 08:28:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:56,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:56,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:56,497 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:56,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:56,497 INFO L82 PathProgramCache]: Analyzing trace with hash -597710621, now seen corresponding path program 1 times [2019-09-10 08:28:56,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:56,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:56,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:56,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:56,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:56,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:56,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:56,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:56,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:56,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:56,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:56,650 INFO L87 Difference]: Start difference. First operand 1572 states and 2070 transitions. Second operand 9 states. [2019-09-10 08:29:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:00,060 INFO L93 Difference]: Finished difference Result 2609 states and 3460 transitions. [2019-09-10 08:29:00,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:00,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:00,064 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:00,064 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:00,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:29:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2069 transitions. [2019-09-10 08:29:00,083 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2069 transitions. Word has length 120 [2019-09-10 08:29:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:00,084 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2069 transitions. [2019-09-10 08:29:00,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2069 transitions. [2019-09-10 08:29:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:00,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:00,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:00,086 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:00,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2018866561, now seen corresponding path program 1 times [2019-09-10 08:29:00,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:00,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:00,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:00,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:00,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:00,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:00,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:00,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:00,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:00,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:00,241 INFO L87 Difference]: Start difference. First operand 1572 states and 2069 transitions. Second operand 9 states. [2019-09-10 08:29:03,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:03,888 INFO L93 Difference]: Finished difference Result 2609 states and 3458 transitions. [2019-09-10 08:29:03,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:03,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:03,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:03,892 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:03,892 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:03,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2068 transitions. [2019-09-10 08:29:03,906 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2068 transitions. Word has length 120 [2019-09-10 08:29:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:03,906 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2068 transitions. [2019-09-10 08:29:03,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2068 transitions. [2019-09-10 08:29:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:03,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:03,908 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:03,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:03,908 INFO L82 PathProgramCache]: Analyzing trace with hash -152615904, now seen corresponding path program 1 times [2019-09-10 08:29:03,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:03,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:03,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:03,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:04,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:04,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:04,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:04,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:04,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:04,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:04,057 INFO L87 Difference]: Start difference. First operand 1572 states and 2068 transitions. Second operand 9 states. [2019-09-10 08:29:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:07,729 INFO L93 Difference]: Finished difference Result 2609 states and 3457 transitions. [2019-09-10 08:29:07,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:07,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:07,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:07,732 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:07,733 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:07,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2067 transitions. [2019-09-10 08:29:07,746 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2067 transitions. Word has length 120 [2019-09-10 08:29:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:07,746 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2067 transitions. [2019-09-10 08:29:07,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2067 transitions. [2019-09-10 08:29:07,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:07,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:07,748 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:07,748 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:07,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:07,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1134633556, now seen corresponding path program 1 times [2019-09-10 08:29:07,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:07,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:07,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:07,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:07,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:07,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:07,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:07,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:07,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:07,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:07,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:07,896 INFO L87 Difference]: Start difference. First operand 1572 states and 2067 transitions. Second operand 9 states. [2019-09-10 08:29:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:11,172 INFO L93 Difference]: Finished difference Result 2609 states and 3455 transitions. [2019-09-10 08:29:11,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:11,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:11,176 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:11,176 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:11,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:29:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2066 transitions. [2019-09-10 08:29:11,190 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2066 transitions. Word has length 120 [2019-09-10 08:29:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:11,190 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2066 transitions. [2019-09-10 08:29:11,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2066 transitions. [2019-09-10 08:29:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:11,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:11,192 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:11,192 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:11,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1989155418, now seen corresponding path program 1 times [2019-09-10 08:29:11,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:11,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:11,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:11,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:11,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:11,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:11,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:11,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:11,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:11,344 INFO L87 Difference]: Start difference. First operand 1572 states and 2066 transitions. Second operand 9 states. [2019-09-10 08:29:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:14,541 INFO L93 Difference]: Finished difference Result 2609 states and 3454 transitions. [2019-09-10 08:29:14,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:14,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:14,544 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:14,544 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:14,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:29:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:14,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2065 transitions. [2019-09-10 08:29:14,558 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2065 transitions. Word has length 120 [2019-09-10 08:29:14,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:14,558 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2065 transitions. [2019-09-10 08:29:14,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2065 transitions. [2019-09-10 08:29:14,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:14,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:14,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:14,560 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:14,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:14,560 INFO L82 PathProgramCache]: Analyzing trace with hash 136702110, now seen corresponding path program 1 times [2019-09-10 08:29:14,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:14,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:14,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:14,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:14,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:14,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:14,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:14,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:14,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:14,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:14,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:14,720 INFO L87 Difference]: Start difference. First operand 1572 states and 2065 transitions. Second operand 9 states. [2019-09-10 08:29:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:18,314 INFO L93 Difference]: Finished difference Result 2697 states and 3592 transitions. [2019-09-10 08:29:18,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:18,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:18,317 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:29:18,318 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:29:18,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:29:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:29:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2064 transitions. [2019-09-10 08:29:18,332 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2064 transitions. Word has length 120 [2019-09-10 08:29:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:18,332 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2064 transitions. [2019-09-10 08:29:18,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2064 transitions. [2019-09-10 08:29:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:18,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:18,333 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:18,334 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:18,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:18,334 INFO L82 PathProgramCache]: Analyzing trace with hash 942084680, now seen corresponding path program 1 times [2019-09-10 08:29:18,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:18,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:18,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:18,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:18,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:18,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:18,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:18,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:18,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:18,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:18,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:18,518 INFO L87 Difference]: Start difference. First operand 1572 states and 2064 transitions. Second operand 9 states. [2019-09-10 08:29:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:21,807 INFO L93 Difference]: Finished difference Result 2609 states and 3452 transitions. [2019-09-10 08:29:21,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:21,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:21,811 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:21,811 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:21,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:29:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2063 transitions. [2019-09-10 08:29:21,826 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2063 transitions. Word has length 120 [2019-09-10 08:29:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:21,826 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2063 transitions. [2019-09-10 08:29:21,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2063 transitions. [2019-09-10 08:29:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:21,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:21,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:21,827 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:21,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1721896881, now seen corresponding path program 1 times [2019-09-10 08:29:21,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:21,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:21,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:21,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:21,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:21,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:21,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:21,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:21,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:21,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:21,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:21,973 INFO L87 Difference]: Start difference. First operand 1572 states and 2063 transitions. Second operand 9 states. [2019-09-10 08:29:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:25,707 INFO L93 Difference]: Finished difference Result 2609 states and 3450 transitions. [2019-09-10 08:29:25,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:25,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:25,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:25,710 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:25,711 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:25,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2062 transitions. [2019-09-10 08:29:25,725 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2062 transitions. Word has length 120 [2019-09-10 08:29:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:25,725 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2062 transitions. [2019-09-10 08:29:25,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2062 transitions. [2019-09-10 08:29:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:25,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:25,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:25,727 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:25,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1177456136, now seen corresponding path program 1 times [2019-09-10 08:29:25,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:25,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:25,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:25,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:25,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:25,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:25,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:25,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:25,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:25,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:25,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:25,876 INFO L87 Difference]: Start difference. First operand 1572 states and 2062 transitions. Second operand 9 states. [2019-09-10 08:29:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:29,149 INFO L93 Difference]: Finished difference Result 2609 states and 3448 transitions. [2019-09-10 08:29:29,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:29,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:29,153 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:29,154 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:29,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:29:29,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2061 transitions. [2019-09-10 08:29:29,168 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2061 transitions. Word has length 120 [2019-09-10 08:29:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:29,168 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2061 transitions. [2019-09-10 08:29:29,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2061 transitions. [2019-09-10 08:29:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:29,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:29,170 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:29,170 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:29,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:29,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1777985122, now seen corresponding path program 1 times [2019-09-10 08:29:29,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:29,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:29,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:29,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:29,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:29,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:29,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:29,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:29,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:29,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:29,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:29,317 INFO L87 Difference]: Start difference. First operand 1572 states and 2061 transitions. Second operand 9 states. [2019-09-10 08:29:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:32,823 INFO L93 Difference]: Finished difference Result 2609 states and 3447 transitions. [2019-09-10 08:29:32,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:32,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:32,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:32,827 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:32,827 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:32,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2060 transitions. [2019-09-10 08:29:32,841 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2060 transitions. Word has length 120 [2019-09-10 08:29:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:32,841 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2060 transitions. [2019-09-10 08:29:32,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2060 transitions. [2019-09-10 08:29:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:32,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:32,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:32,843 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:32,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:32,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1420258030, now seen corresponding path program 1 times [2019-09-10 08:29:32,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:32,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:32,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:32,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:32,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:32,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:32,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:32,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:33,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:33,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:33,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:33,000 INFO L87 Difference]: Start difference. First operand 1572 states and 2060 transitions. Second operand 9 states. [2019-09-10 08:29:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:36,745 INFO L93 Difference]: Finished difference Result 2697 states and 3584 transitions. [2019-09-10 08:29:36,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:36,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:36,748 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:29:36,748 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:29:36,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:29:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:29:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2059 transitions. [2019-09-10 08:29:36,762 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2059 transitions. Word has length 120 [2019-09-10 08:29:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:36,762 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2059 transitions. [2019-09-10 08:29:36,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2059 transitions. [2019-09-10 08:29:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:36,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:36,763 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:36,763 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:36,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:36,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1683439622, now seen corresponding path program 1 times [2019-09-10 08:29:36,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:36,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:36,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:36,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:36,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:36,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:36,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:36,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:36,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:36,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:36,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:36,907 INFO L87 Difference]: Start difference. First operand 1572 states and 2059 transitions. Second operand 9 states. [2019-09-10 08:29:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:40,614 INFO L93 Difference]: Finished difference Result 2609 states and 3444 transitions. [2019-09-10 08:29:40,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:40,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:40,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:40,618 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:40,618 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:40,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2058 transitions. [2019-09-10 08:29:40,632 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2058 transitions. Word has length 120 [2019-09-10 08:29:40,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:40,632 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2058 transitions. [2019-09-10 08:29:40,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2058 transitions. [2019-09-10 08:29:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:40,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:40,633 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:40,633 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:40,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1406863947, now seen corresponding path program 1 times [2019-09-10 08:29:40,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:40,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:40,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:40,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:40,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:40,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:40,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:40,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:40,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:40,776 INFO L87 Difference]: Start difference. First operand 1572 states and 2058 transitions. Second operand 9 states. [2019-09-10 08:29:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:44,404 INFO L93 Difference]: Finished difference Result 2609 states and 3442 transitions. [2019-09-10 08:29:44,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:44,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:44,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:44,407 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:44,408 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:44,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2057 transitions. [2019-09-10 08:29:44,422 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2057 transitions. Word has length 120 [2019-09-10 08:29:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:44,422 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2057 transitions. [2019-09-10 08:29:44,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2057 transitions. [2019-09-10 08:29:44,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:44,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:44,424 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:44,424 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:44,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2144453372, now seen corresponding path program 1 times [2019-09-10 08:29:44,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:44,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:44,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:44,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:44,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:44,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:44,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:44,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:44,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:44,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:44,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:44,595 INFO L87 Difference]: Start difference. First operand 1572 states and 2057 transitions. Second operand 9 states. [2019-09-10 08:29:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:48,145 INFO L93 Difference]: Finished difference Result 2697 states and 3579 transitions. [2019-09-10 08:29:48,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:48,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:48,149 INFO L225 Difference]: With dead ends: 2697 [2019-09-10 08:29:48,149 INFO L226 Difference]: Without dead ends: 2697 [2019-09-10 08:29:48,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:48,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-10 08:29:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1572. [2019-09-10 08:29:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2056 transitions. [2019-09-10 08:29:48,165 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2056 transitions. Word has length 120 [2019-09-10 08:29:48,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:48,165 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2056 transitions. [2019-09-10 08:29:48,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2056 transitions. [2019-09-10 08:29:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:29:48,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:48,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:48,166 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:48,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:48,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1350775706, now seen corresponding path program 1 times [2019-09-10 08:29:48,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:48,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:48,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:48,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:48,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:48,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:48,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:48,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:48,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:48,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:48,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:48,337 INFO L87 Difference]: Start difference. First operand 1572 states and 2056 transitions. Second operand 9 states. [2019-09-10 08:29:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:51,833 INFO L93 Difference]: Finished difference Result 2609 states and 3440 transitions. [2019-09-10 08:29:51,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:51,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:29:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:51,837 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:51,837 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:51,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2055 transitions. [2019-09-10 08:29:51,852 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2055 transitions. Word has length 120 [2019-09-10 08:29:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:51,852 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2055 transitions. [2019-09-10 08:29:51,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2055 transitions. [2019-09-10 08:29:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:51,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:51,854 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:51,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:51,854 INFO L82 PathProgramCache]: Analyzing trace with hash 780681115, now seen corresponding path program 1 times [2019-09-10 08:29:51,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:51,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:51,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:51,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:51,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:52,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:52,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:52,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:52,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:52,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:52,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:52,001 INFO L87 Difference]: Start difference. First operand 1572 states and 2055 transitions. Second operand 9 states. [2019-09-10 08:29:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:55,503 INFO L93 Difference]: Finished difference Result 2609 states and 3438 transitions. [2019-09-10 08:29:55,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:55,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:55,506 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:55,506 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:55,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:55,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2053 transitions. [2019-09-10 08:29:55,524 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2053 transitions. Word has length 121 [2019-09-10 08:29:55,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:55,525 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2053 transitions. [2019-09-10 08:29:55,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2053 transitions. [2019-09-10 08:29:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:55,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:55,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:55,527 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:55,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:55,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1446425802, now seen corresponding path program 1 times [2019-09-10 08:29:55,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:55,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:55,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:55,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:55,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:55,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:55,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:55,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:55,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:55,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:55,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:55,678 INFO L87 Difference]: Start difference. First operand 1572 states and 2053 transitions. Second operand 9 states. [2019-09-10 08:29:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:59,152 INFO L93 Difference]: Finished difference Result 2609 states and 3437 transitions. [2019-09-10 08:29:59,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:59,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:59,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:59,156 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:29:59,156 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:29:59,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:29:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:29:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:29:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2052 transitions. [2019-09-10 08:29:59,171 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2052 transitions. Word has length 121 [2019-09-10 08:29:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:59,171 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2052 transitions. [2019-09-10 08:29:59,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2052 transitions. [2019-09-10 08:29:59,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:59,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:59,173 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:59,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:59,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1590323129, now seen corresponding path program 1 times [2019-09-10 08:29:59,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:59,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:59,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:59,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:59,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:59,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:59,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:59,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:59,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:59,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:59,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:59,320 INFO L87 Difference]: Start difference. First operand 1572 states and 2052 transitions. Second operand 9 states. [2019-09-10 08:30:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:02,917 INFO L93 Difference]: Finished difference Result 2609 states and 3436 transitions. [2019-09-10 08:30:02,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:02,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:30:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:02,921 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:30:02,921 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:30:02,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:30:02,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:30:02,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:30:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:30:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2051 transitions. [2019-09-10 08:30:02,935 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2051 transitions. Word has length 121 [2019-09-10 08:30:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:02,935 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2051 transitions. [2019-09-10 08:30:02,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2051 transitions. [2019-09-10 08:30:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:30:02,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:02,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:02,937 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:02,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:02,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1512469138, now seen corresponding path program 1 times [2019-09-10 08:30:02,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:02,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:02,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:02,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:02,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:03,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:03,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:03,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:03,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:03,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:03,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:03,080 INFO L87 Difference]: Start difference. First operand 1572 states and 2051 transitions. Second operand 9 states. [2019-09-10 08:30:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:06,551 INFO L93 Difference]: Finished difference Result 2609 states and 3435 transitions. [2019-09-10 08:30:06,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:06,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:30:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:06,555 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:30:06,555 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:30:06,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:30:06,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:30:06,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:30:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:30:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2050 transitions. [2019-09-10 08:30:06,569 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2050 transitions. Word has length 121 [2019-09-10 08:30:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:06,569 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2050 transitions. [2019-09-10 08:30:06,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2050 transitions. [2019-09-10 08:30:06,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:30:06,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:06,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:06,571 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:06,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:06,571 INFO L82 PathProgramCache]: Analyzing trace with hash 202339011, now seen corresponding path program 1 times [2019-09-10 08:30:06,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:06,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:06,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:06,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:06,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:06,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 08:30:06,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:06,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:06,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:06,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:06,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:06,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:06,710 INFO L87 Difference]: Start difference. First operand 1572 states and 2050 transitions. Second operand 9 states. [2019-09-10 08:30:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:10,281 INFO L93 Difference]: Finished difference Result 2609 states and 3434 transitions. [2019-09-10 08:30:10,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:10,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:30:10,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:10,285 INFO L225 Difference]: With dead ends: 2609 [2019-09-10 08:30:10,285 INFO L226 Difference]: Without dead ends: 2609 [2019-09-10 08:30:10,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:30:10,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2019-09-10 08:30:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1572. [2019-09-10 08:30:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:30:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2049 transitions. [2019-09-10 08:30:10,299 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2049 transitions. Word has length 121 [2019-09-10 08:30:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:10,299 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2049 transitions. [2019-09-10 08:30:10,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2049 transitions. [2019-09-10 08:30:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:10,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:10,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:10,300 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:10,301 INFO L82 PathProgramCache]: Analyzing trace with hash -76336468, now seen corresponding path program 1 times [2019-09-10 08:30:10,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:10,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:10,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:10,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:10,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:11,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:11,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:30:11,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:11,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:30:11,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:30:11,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:30:11,797 INFO L87 Difference]: Start difference. First operand 1572 states and 2049 transitions. Second operand 21 states. [2019-09-10 08:30:12,993 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 08:30:13,327 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 08:30:13,553 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 08:30:13,757 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 08:30:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:23,490 INFO L93 Difference]: Finished difference Result 2129 states and 2747 transitions. [2019-09-10 08:30:23,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:30:23,490 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 122 [2019-09-10 08:30:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:23,493 INFO L225 Difference]: With dead ends: 2129 [2019-09-10 08:30:23,493 INFO L226 Difference]: Without dead ends: 2129 [2019-09-10 08:30:23,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:30:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2019-09-10 08:30:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1600. [2019-09-10 08:30:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-09-10 08:30:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2087 transitions. [2019-09-10 08:30:23,505 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2087 transitions. Word has length 122 [2019-09-10 08:30:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:23,505 INFO L475 AbstractCegarLoop]: Abstraction has 1600 states and 2087 transitions. [2019-09-10 08:30:23,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:30:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2087 transitions. [2019-09-10 08:30:23,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:23,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:23,507 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:23,507 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:23,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:23,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1490416469, now seen corresponding path program 1 times [2019-09-10 08:30:23,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:23,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:23,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:23,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:23,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:25,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:25,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:30:25,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:25,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:30:25,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:30:25,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:30:25,020 INFO L87 Difference]: Start difference. First operand 1600 states and 2087 transitions. Second operand 22 states. [2019-09-10 08:30:26,089 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-10 08:30:26,368 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 08:30:26,701 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-10 08:30:26,867 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 08:30:32,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:32,827 INFO L93 Difference]: Finished difference Result 3158 states and 4149 transitions. [2019-09-10 08:30:32,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:30:32,828 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-10 08:30:32,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:32,831 INFO L225 Difference]: With dead ends: 3158 [2019-09-10 08:30:32,831 INFO L226 Difference]: Without dead ends: 3158 [2019-09-10 08:30:32,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:30:32,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3158 states. [2019-09-10 08:30:32,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3158 to 1618. [2019-09-10 08:30:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-09-10 08:30:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2105 transitions. [2019-09-10 08:30:32,846 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2105 transitions. Word has length 122 [2019-09-10 08:30:32,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:32,847 INFO L475 AbstractCegarLoop]: Abstraction has 1618 states and 2105 transitions. [2019-09-10 08:30:32,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:30:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2105 transitions. [2019-09-10 08:30:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:32,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:32,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:32,848 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:32,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:32,849 INFO L82 PathProgramCache]: Analyzing trace with hash 484088792, now seen corresponding path program 1 times [2019-09-10 08:30:32,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:32,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:32,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:32,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:32,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:33,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:33,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:30:33,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:33,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:30:33,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:30:33,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:30:33,668 INFO L87 Difference]: Start difference. First operand 1618 states and 2105 transitions. Second operand 17 states. [2019-09-10 08:30:34,358 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:30:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:39,656 INFO L93 Difference]: Finished difference Result 3008 states and 3968 transitions. [2019-09-10 08:30:39,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:30:39,656 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:30:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:39,660 INFO L225 Difference]: With dead ends: 3008 [2019-09-10 08:30:39,660 INFO L226 Difference]: Without dead ends: 3008 [2019-09-10 08:30:39,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:30:39,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-09-10 08:30:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1606. [2019-09-10 08:30:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-09-10 08:30:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2083 transitions. [2019-09-10 08:30:39,674 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2083 transitions. Word has length 122 [2019-09-10 08:30:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:39,675 INFO L475 AbstractCegarLoop]: Abstraction has 1606 states and 2083 transitions. [2019-09-10 08:30:39,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:30:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2083 transitions. [2019-09-10 08:30:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:39,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:39,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:39,676 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:39,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:39,677 INFO L82 PathProgramCache]: Analyzing trace with hash -982869291, now seen corresponding path program 1 times [2019-09-10 08:30:39,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:39,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:39,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:39,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:39,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:40,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:40,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:30:40,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:40,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:30:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:30:40,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:30:40,985 INFO L87 Difference]: Start difference. First operand 1606 states and 2083 transitions. Second operand 22 states. [2019-09-10 08:30:42,070 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 08:30:42,335 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 08:30:42,634 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-10 08:30:42,787 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 08:30:43,198 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-10 08:30:43,614 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 08:30:43,907 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 08:30:44,250 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 08:30:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:51,251 INFO L93 Difference]: Finished difference Result 3004 states and 3936 transitions. [2019-09-10 08:30:51,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:30:51,251 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-10 08:30:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:51,255 INFO L225 Difference]: With dead ends: 3004 [2019-09-10 08:30:51,255 INFO L226 Difference]: Without dead ends: 3004 [2019-09-10 08:30:51,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:30:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2019-09-10 08:30:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 1618. [2019-09-10 08:30:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-09-10 08:30:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2095 transitions. [2019-09-10 08:30:51,270 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2095 transitions. Word has length 122 [2019-09-10 08:30:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:51,270 INFO L475 AbstractCegarLoop]: Abstraction has 1618 states and 2095 transitions. [2019-09-10 08:30:51,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:30:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2095 transitions. [2019-09-10 08:30:51,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:51,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:51,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:51,272 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:51,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1606641247, now seen corresponding path program 1 times [2019-09-10 08:30:51,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:51,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:51,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:52,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:52,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:30:52,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:52,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:30:52,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:30:52,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:30:52,050 INFO L87 Difference]: Start difference. First operand 1618 states and 2095 transitions. Second operand 17 states. [2019-09-10 08:30:52,727 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:30:52,883 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:30:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:56,384 INFO L93 Difference]: Finished difference Result 2982 states and 3932 transitions. [2019-09-10 08:30:56,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:30:56,385 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:30:56,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:56,389 INFO L225 Difference]: With dead ends: 2982 [2019-09-10 08:30:56,389 INFO L226 Difference]: Without dead ends: 2982 [2019-09-10 08:30:56,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:30:56,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2019-09-10 08:30:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1572. [2019-09-10 08:30:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:30:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2032 transitions. [2019-09-10 08:30:56,406 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2032 transitions. Word has length 122 [2019-09-10 08:30:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:56,406 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2032 transitions. [2019-09-10 08:30:56,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:30:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2032 transitions. [2019-09-10 08:30:56,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:56,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:56,408 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:56,408 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:56,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:56,408 INFO L82 PathProgramCache]: Analyzing trace with hash -185074006, now seen corresponding path program 1 times [2019-09-10 08:30:56,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:56,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:56,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:56,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:56,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:57,496 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 08:30:57,642 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 08:30:57,805 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:30:57,974 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-10 08:30:58,176 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 08:30:58,370 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-10 08:30:58,544 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:30:58,715 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:31:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:00,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:00,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-10 08:31:00,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:00,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 08:31:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 08:31:00,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1186, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:31:00,572 INFO L87 Difference]: Start difference. First operand 1572 states and 2032 transitions. Second operand 36 states. [2019-09-10 08:31:00,878 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-09-10 08:31:02,267 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-09-10 08:31:02,508 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-09-10 08:31:02,751 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2019-09-10 08:31:03,614 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-09-10 08:31:04,066 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 79 [2019-09-10 08:31:04,597 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 95 [2019-09-10 08:31:05,218 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 110 [2019-09-10 08:31:05,945 WARN L188 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 124 [2019-09-10 08:31:06,854 WARN L188 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 144 [2019-09-10 08:31:07,298 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 92 [2019-09-10 08:31:07,716 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 92 [2019-09-10 08:31:07,950 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 08:31:08,426 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-10 08:31:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:38,548 INFO L93 Difference]: Finished difference Result 2342 states and 3035 transitions. [2019-09-10 08:31:38,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 08:31:38,549 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 122 [2019-09-10 08:31:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:38,551 INFO L225 Difference]: With dead ends: 2342 [2019-09-10 08:31:38,551 INFO L226 Difference]: Without dead ends: 2342 [2019-09-10 08:31:38,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=558, Invalid=3224, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 08:31:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2019-09-10 08:31:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 1592. [2019-09-10 08:31:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2019-09-10 08:31:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2059 transitions. [2019-09-10 08:31:38,564 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2059 transitions. Word has length 122 [2019-09-10 08:31:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:38,564 INFO L475 AbstractCegarLoop]: Abstraction has 1592 states and 2059 transitions. [2019-09-10 08:31:38,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 08:31:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2059 transitions. [2019-09-10 08:31:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:31:38,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:38,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:38,565 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:38,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:38,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1305180917, now seen corresponding path program 1 times [2019-09-10 08:31:38,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:38,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:38,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:38,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:38,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:39,712 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:31:40,035 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 08:31:40,225 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 08:31:44,848 WARN L188 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 08:31:45,026 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:31:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:46,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:46,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-10 08:31:46,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:46,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 08:31:46,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 08:31:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:31:46,421 INFO L87 Difference]: Start difference. First operand 1592 states and 2059 transitions. Second operand 36 states. [2019-09-10 08:31:46,682 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 08:31:47,650 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 08:31:47,826 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:31:48,052 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:31:48,273 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 08:31:48,935 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:31:49,398 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2019-09-10 08:31:49,939 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2019-09-10 08:31:50,659 WARN L188 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 142 [2019-09-10 08:31:51,602 WARN L188 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 162 [2019-09-10 08:31:52,894 WARN L188 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 207 DAG size of output: 185 [2019-09-10 08:31:53,224 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-09-10 08:31:53,557 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-09-10 08:31:53,986 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-09-10 08:32:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:26,397 INFO L93 Difference]: Finished difference Result 3780 states and 4963 transitions. [2019-09-10 08:32:26,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 08:32:26,397 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 122 [2019-09-10 08:32:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:26,402 INFO L225 Difference]: With dead ends: 3780 [2019-09-10 08:32:26,402 INFO L226 Difference]: Without dead ends: 3780 [2019-09-10 08:32:26,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=726, Invalid=3966, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 08:32:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2019-09-10 08:32:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 1601. [2019-09-10 08:32:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-09-10 08:32:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2071 transitions. [2019-09-10 08:32:26,426 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2071 transitions. Word has length 122 [2019-09-10 08:32:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:26,427 INFO L475 AbstractCegarLoop]: Abstraction has 1601 states and 2071 transitions. [2019-09-10 08:32:26,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 08:32:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2071 transitions. [2019-09-10 08:32:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:32:26,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:26,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:26,429 INFO L418 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:26,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:26,429 INFO L82 PathProgramCache]: Analyzing trace with hash -261572020, now seen corresponding path program 1 times [2019-09-10 08:32:26,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:26,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:26,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:26,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:26,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:27,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:27,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:32:27,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:27,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:32:27,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:32:27,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:32:27,285 INFO L87 Difference]: Start difference. First operand 1601 states and 2071 transitions. Second operand 17 states. [2019-09-10 08:32:27,957 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:32:28,109 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:32:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:32,555 INFO L93 Difference]: Finished difference Result 2881 states and 3791 transitions. [2019-09-10 08:32:32,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:32:32,556 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:32:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:32,559 INFO L225 Difference]: With dead ends: 2881 [2019-09-10 08:32:32,559 INFO L226 Difference]: Without dead ends: 2881 [2019-09-10 08:32:32,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:32:32,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2019-09-10 08:32:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1572. [2019-09-10 08:32:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-09-10 08:32:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2030 transitions. [2019-09-10 08:32:32,574 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2030 transitions. Word has length 122 [2019-09-10 08:32:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:32,575 INFO L475 AbstractCegarLoop]: Abstraction has 1572 states and 2030 transitions. [2019-09-10 08:32:32,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:32:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2030 transitions. [2019-09-10 08:32:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:32:32,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:32,577 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:32,577 INFO L418 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:32,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:32,577 INFO L82 PathProgramCache]: Analyzing trace with hash -364307142, now seen corresponding path program 1 times [2019-09-10 08:32:32,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:32,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:32,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:32,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:32,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:32,983 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-09-10 08:32:33,152 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-09-10 08:32:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:33,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:33,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:32:33,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:33,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:32:33,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:32:33,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:32:33,571 INFO L87 Difference]: Start difference. First operand 1572 states and 2030 transitions. Second operand 17 states. [2019-09-10 08:32:34,241 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:32:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:36,669 INFO L93 Difference]: Finished difference Result 2922 states and 3836 transitions. [2019-09-10 08:32:36,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:32:36,670 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:32:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:36,673 INFO L225 Difference]: With dead ends: 2922 [2019-09-10 08:32:36,673 INFO L226 Difference]: Without dead ends: 2922 [2019-09-10 08:32:36,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:32:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2019-09-10 08:32:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1488. [2019-09-10 08:32:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-09-10 08:32:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1912 transitions. [2019-09-10 08:32:36,688 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1912 transitions. Word has length 122 [2019-09-10 08:32:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:36,688 INFO L475 AbstractCegarLoop]: Abstraction has 1488 states and 1912 transitions. [2019-09-10 08:32:36,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:32:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1912 transitions. [2019-09-10 08:32:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:32:36,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:36,690 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:36,691 INFO L418 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:36,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:36,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1209199447, now seen corresponding path program 1 times [2019-09-10 08:32:36,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:36,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:36,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:36,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:36,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:37,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:37,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:32:37,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:37,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:32:37,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:32:37,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:32:37,464 INFO L87 Difference]: Start difference. First operand 1488 states and 1912 transitions. Second operand 17 states. [2019-09-10 08:32:38,088 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:32:38,235 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 08:32:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:39,496 INFO L93 Difference]: Finished difference Result 1866 states and 2447 transitions. [2019-09-10 08:32:39,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:32:39,496 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:32:39,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:39,498 INFO L225 Difference]: With dead ends: 1866 [2019-09-10 08:32:39,498 INFO L226 Difference]: Without dead ends: 1866 [2019-09-10 08:32:39,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:32:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2019-09-10 08:32:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1384. [2019-09-10 08:32:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2019-09-10 08:32:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1777 transitions. [2019-09-10 08:32:39,510 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1777 transitions. Word has length 122 [2019-09-10 08:32:39,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:39,510 INFO L475 AbstractCegarLoop]: Abstraction has 1384 states and 1777 transitions. [2019-09-10 08:32:39,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:32:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1777 transitions. [2019-09-10 08:32:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:32:39,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:39,512 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:39,512 INFO L418 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1521800364, now seen corresponding path program 1 times [2019-09-10 08:32:39,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:39,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:39,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:40,343 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 08:32:40,498 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:32:40,671 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 08:32:40,853 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 08:32:41,046 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-10 08:32:41,223 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 08:32:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:42,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:42,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-09-10 08:32:42,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:42,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 08:32:42,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 08:32:42,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1083, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:32:42,706 INFO L87 Difference]: Start difference. First operand 1384 states and 1777 transitions. Second operand 35 states. [2019-09-10 08:32:42,942 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-09-10 08:32:44,157 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-09-10 08:32:44,337 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 08:32:44,544 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 08:32:44,880 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-09-10 08:32:45,491 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2019-09-10 08:32:45,890 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 84 [2019-09-10 08:32:46,392 WARN L188 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 96 [2019-09-10 08:32:46,967 WARN L188 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 109 [2019-09-10 08:32:47,635 WARN L188 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 123 [2019-09-10 08:32:48,034 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 86 [2019-09-10 08:32:48,353 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-09-10 08:32:48,682 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2019-09-10 08:32:48,949 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 79 [2019-09-10 08:32:49,257 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 79 [2019-09-10 08:32:49,730 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-09-10 08:33:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:06,745 INFO L93 Difference]: Finished difference Result 2073 states and 2709 transitions. [2019-09-10 08:33:06,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 08:33:06,745 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 122 [2019-09-10 08:33:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:06,748 INFO L225 Difference]: With dead ends: 2073 [2019-09-10 08:33:06,748 INFO L226 Difference]: Without dead ends: 2073 [2019-09-10 08:33:06,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=707, Invalid=2715, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 08:33:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2019-09-10 08:33:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1405. [2019-09-10 08:33:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2019-09-10 08:33:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1801 transitions. [2019-09-10 08:33:06,761 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1801 transitions. Word has length 122 [2019-09-10 08:33:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:06,761 INFO L475 AbstractCegarLoop]: Abstraction has 1405 states and 1801 transitions. [2019-09-10 08:33:06,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 08:33:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1801 transitions. [2019-09-10 08:33:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:33:06,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:06,763 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:06,763 INFO L418 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:06,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:06,764 INFO L82 PathProgramCache]: Analyzing trace with hash -784730414, now seen corresponding path program 1 times [2019-09-10 08:33:06,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:06,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:06,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:06,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:06,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:07,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:07,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:33:07,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:07,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:33:07,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:33:07,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:33:07,545 INFO L87 Difference]: Start difference. First operand 1405 states and 1801 transitions. Second operand 17 states. [2019-09-10 08:33:08,265 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:33:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:14,371 INFO L93 Difference]: Finished difference Result 2521 states and 3304 transitions. [2019-09-10 08:33:14,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:33:14,371 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:33:14,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:14,375 INFO L225 Difference]: With dead ends: 2521 [2019-09-10 08:33:14,375 INFO L226 Difference]: Without dead ends: 2521 [2019-09-10 08:33:14,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:33:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2019-09-10 08:33:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 1405. [2019-09-10 08:33:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2019-09-10 08:33:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1799 transitions. [2019-09-10 08:33:14,388 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1799 transitions. Word has length 122 [2019-09-10 08:33:14,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:14,388 INFO L475 AbstractCegarLoop]: Abstraction has 1405 states and 1799 transitions. [2019-09-10 08:33:14,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:33:14,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1799 transitions. [2019-09-10 08:33:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:33:14,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:14,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:14,390 INFO L418 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:14,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash -442149559, now seen corresponding path program 1 times [2019-09-10 08:33:14,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:14,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:14,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:14,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:14,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:15,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:15,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:33:15,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:15,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:33:15,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:33:15,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:33:15,707 INFO L87 Difference]: Start difference. First operand 1405 states and 1799 transitions. Second operand 22 states. [2019-09-10 08:33:16,845 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 08:33:17,123 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-09-10 08:33:17,525 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-10 08:33:17,695 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 08:33:18,633 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-10 08:33:19,342 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 08:33:19,709 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 08:33:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:29,417 INFO L93 Difference]: Finished difference Result 3126 states and 4082 transitions. [2019-09-10 08:33:29,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:33:29,418 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-10 08:33:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:29,420 INFO L225 Difference]: With dead ends: 3126 [2019-09-10 08:33:29,420 INFO L226 Difference]: Without dead ends: 3126 [2019-09-10 08:33:29,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:33:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2019-09-10 08:33:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 1411. [2019-09-10 08:33:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:33:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1805 transitions. [2019-09-10 08:33:29,433 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1805 transitions. Word has length 122 [2019-09-10 08:33:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:29,433 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1805 transitions. [2019-09-10 08:33:29,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:33:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1805 transitions. [2019-09-10 08:33:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:33:29,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:29,434 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:29,435 INFO L418 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:29,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2080949619, now seen corresponding path program 1 times [2019-09-10 08:33:29,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:29,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:29,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:29,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:29,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:30,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:30,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:33:30,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:30,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:33:30,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:33:30,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:33:30,433 INFO L87 Difference]: Start difference. First operand 1411 states and 1805 transitions. Second operand 20 states. [2019-09-10 08:33:31,311 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 08:33:31,506 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-09-10 08:33:31,660 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-10 08:33:31,816 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 08:33:31,967 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 08:33:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:35,909 INFO L93 Difference]: Finished difference Result 1868 states and 2408 transitions. [2019-09-10 08:33:35,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:33:35,910 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 122 [2019-09-10 08:33:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:35,912 INFO L225 Difference]: With dead ends: 1868 [2019-09-10 08:33:35,912 INFO L226 Difference]: Without dead ends: 1868 [2019-09-10 08:33:35,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:33:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2019-09-10 08:33:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1396. [2019-09-10 08:33:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2019-09-10 08:33:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1787 transitions. [2019-09-10 08:33:35,925 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1787 transitions. Word has length 122 [2019-09-10 08:33:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:35,925 INFO L475 AbstractCegarLoop]: Abstraction has 1396 states and 1787 transitions. [2019-09-10 08:33:35,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:33:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1787 transitions. [2019-09-10 08:33:35,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:33:35,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:35,926 INFO L418 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:35,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:35,927 INFO L82 PathProgramCache]: Analyzing trace with hash -918579394, now seen corresponding path program 1 times [2019-09-10 08:33:35,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:35,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:35,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:35,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:35,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:37,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:37,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:33:37,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:37,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:33:37,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:33:37,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:33:37,243 INFO L87 Difference]: Start difference. First operand 1396 states and 1787 transitions. Second operand 22 states. [2019-09-10 08:33:38,283 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-10 08:33:38,537 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 08:33:38,819 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 08:33:38,987 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 08:33:39,184 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 08:33:39,373 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 08:33:39,537 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:33:39,698 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:33:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:42,013 INFO L93 Difference]: Finished difference Result 1835 states and 2390 transitions. [2019-09-10 08:33:42,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 08:33:42,013 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-10 08:33:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:42,016 INFO L225 Difference]: With dead ends: 1835 [2019-09-10 08:33:42,016 INFO L226 Difference]: Without dead ends: 1835 [2019-09-10 08:33:42,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:33:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-09-10 08:33:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1402. [2019-09-10 08:33:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-09-10 08:33:42,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1793 transitions. [2019-09-10 08:33:42,028 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1793 transitions. Word has length 122 [2019-09-10 08:33:42,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:42,029 INFO L475 AbstractCegarLoop]: Abstraction has 1402 states and 1793 transitions. [2019-09-10 08:33:42,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:33:42,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1793 transitions. [2019-09-10 08:33:42,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:33:42,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:42,030 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:42,030 INFO L418 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:42,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:42,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1567040497, now seen corresponding path program 1 times [2019-09-10 08:33:42,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:42,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:42,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:42,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:42,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:43,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:43,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:33:43,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:43,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:33:43,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:33:43,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:33:43,217 INFO L87 Difference]: Start difference. First operand 1402 states and 1793 transitions. Second operand 22 states. [2019-09-10 08:33:44,403 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-10 08:33:44,706 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 08:33:45,119 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 08:33:45,279 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 08:33:45,553 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 08:33:45,942 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 08:33:46,224 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 08:33:46,541 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 08:33:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:56,654 INFO L93 Difference]: Finished difference Result 3116 states and 4069 transitions. [2019-09-10 08:33:56,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:33:56,655 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-10 08:33:56,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:56,658 INFO L225 Difference]: With dead ends: 3116 [2019-09-10 08:33:56,658 INFO L226 Difference]: Without dead ends: 3116 [2019-09-10 08:33:56,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:33:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2019-09-10 08:33:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 1408. [2019-09-10 08:33:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1408 states. [2019-09-10 08:33:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1799 transitions. [2019-09-10 08:33:56,673 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1799 transitions. Word has length 122 [2019-09-10 08:33:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:56,674 INFO L475 AbstractCegarLoop]: Abstraction has 1408 states and 1799 transitions. [2019-09-10 08:33:56,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:33:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1799 transitions. [2019-09-10 08:33:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:33:56,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:56,675 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:56,675 INFO L418 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:56,675 INFO L82 PathProgramCache]: Analyzing trace with hash 399995554, now seen corresponding path program 1 times [2019-09-10 08:33:56,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:56,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:56,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:56,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:56,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:56,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:56,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:56,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:56,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:56,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:56,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:56,872 INFO L87 Difference]: Start difference. First operand 1408 states and 1799 transitions. Second operand 9 states. [2019-09-10 08:33:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:59,872 INFO L93 Difference]: Finished difference Result 2267 states and 2954 transitions. [2019-09-10 08:33:59,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:59,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:33:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:59,876 INFO L225 Difference]: With dead ends: 2267 [2019-09-10 08:33:59,876 INFO L226 Difference]: Without dead ends: 2267 [2019-09-10 08:33:59,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:33:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2019-09-10 08:33:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1411. [2019-09-10 08:33:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:33:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1803 transitions. [2019-09-10 08:33:59,897 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1803 transitions. Word has length 122 [2019-09-10 08:33:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:59,897 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1803 transitions. [2019-09-10 08:33:59,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1803 transitions. [2019-09-10 08:33:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:33:59,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:59,899 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:59,899 INFO L418 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:59,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:59,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2064548872, now seen corresponding path program 1 times [2019-09-10 08:33:59,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:59,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:59,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:59,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:59,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:00,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:00,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:34:00,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:00,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:34:00,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:34:00,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:34:00,629 INFO L87 Difference]: Start difference. First operand 1411 states and 1803 transitions. Second operand 17 states. [2019-09-10 08:34:01,242 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 08:34:04,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:04,059 INFO L93 Difference]: Finished difference Result 2533 states and 3323 transitions. [2019-09-10 08:34:04,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:34:04,060 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:34:04,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:04,063 INFO L225 Difference]: With dead ends: 2533 [2019-09-10 08:34:04,063 INFO L226 Difference]: Without dead ends: 2533 [2019-09-10 08:34:04,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:34:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2019-09-10 08:34:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 1391. [2019-09-10 08:34:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1391 states. [2019-09-10 08:34:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1776 transitions. [2019-09-10 08:34:04,077 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1776 transitions. Word has length 122 [2019-09-10 08:34:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:04,078 INFO L475 AbstractCegarLoop]: Abstraction has 1391 states and 1776 transitions. [2019-09-10 08:34:04,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:34:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1776 transitions. [2019-09-10 08:34:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:34:04,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:04,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:04,079 INFO L418 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:04,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:04,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1963017343, now seen corresponding path program 1 times [2019-09-10 08:34:04,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:04,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:04,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:04,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:04,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:04,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:34:04,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:04,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:34:04,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:34:04,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:34:04,841 INFO L87 Difference]: Start difference. First operand 1391 states and 1776 transitions. Second operand 17 states. [2019-09-10 08:34:05,529 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:34:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:07,797 INFO L93 Difference]: Finished difference Result 2453 states and 3213 transitions. [2019-09-10 08:34:07,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:34:07,798 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:34:07,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:07,801 INFO L225 Difference]: With dead ends: 2453 [2019-09-10 08:34:07,801 INFO L226 Difference]: Without dead ends: 2453 [2019-09-10 08:34:07,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:34:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2019-09-10 08:34:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1368. [2019-09-10 08:34:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-10 08:34:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1745 transitions. [2019-09-10 08:34:07,814 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1745 transitions. Word has length 122 [2019-09-10 08:34:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:07,814 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 1745 transitions. [2019-09-10 08:34:07,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:34:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1745 transitions. [2019-09-10 08:34:07,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:34:07,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:07,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:07,816 INFO L418 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:07,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:07,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1267412980, now seen corresponding path program 1 times [2019-09-10 08:34:07,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:07,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:07,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:07,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:07,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:09,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:09,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:09,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:34:09,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:09,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:34:09,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:34:09,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:34:09,146 INFO L87 Difference]: Start difference. First operand 1368 states and 1745 transitions. Second operand 21 states. [2019-09-10 08:34:10,283 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 08:34:10,544 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 08:34:10,762 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 08:34:10,962 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 08:34:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:18,305 INFO L93 Difference]: Finished difference Result 1867 states and 2363 transitions. [2019-09-10 08:34:18,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:34:18,307 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 123 [2019-09-10 08:34:18,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:18,309 INFO L225 Difference]: With dead ends: 1867 [2019-09-10 08:34:18,309 INFO L226 Difference]: Without dead ends: 1867 [2019-09-10 08:34:18,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:34:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2019-09-10 08:34:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1370. [2019-09-10 08:34:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2019-09-10 08:34:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1749 transitions. [2019-09-10 08:34:18,319 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1749 transitions. Word has length 123 [2019-09-10 08:34:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:18,320 INFO L475 AbstractCegarLoop]: Abstraction has 1370 states and 1749 transitions. [2019-09-10 08:34:18,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:34:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1749 transitions. [2019-09-10 08:34:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:34:18,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:18,321 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:18,321 INFO L418 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:18,321 INFO L82 PathProgramCache]: Analyzing trace with hash -604363202, now seen corresponding path program 1 times [2019-09-10 08:34:18,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:18,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:18,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:18,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:18,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:18,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:18,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:34:18,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:18,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:34:18,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:34:18,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:34:18,949 INFO L87 Difference]: Start difference. First operand 1370 states and 1749 transitions. Second operand 13 states. [2019-09-10 08:34:19,462 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-10 08:34:19,597 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-10 08:34:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:22,317 INFO L93 Difference]: Finished difference Result 3839 states and 5143 transitions. [2019-09-10 08:34:22,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:34:22,317 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2019-09-10 08:34:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:22,322 INFO L225 Difference]: With dead ends: 3839 [2019-09-10 08:34:22,322 INFO L226 Difference]: Without dead ends: 3839 [2019-09-10 08:34:22,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:34:22,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2019-09-10 08:34:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 1350. [2019-09-10 08:34:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2019-09-10 08:34:22,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1721 transitions. [2019-09-10 08:34:22,337 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1721 transitions. Word has length 123 [2019-09-10 08:34:22,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:22,338 INFO L475 AbstractCegarLoop]: Abstraction has 1350 states and 1721 transitions. [2019-09-10 08:34:22,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:34:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1721 transitions. [2019-09-10 08:34:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:34:22,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:22,339 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:22,339 INFO L418 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:22,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:22,339 INFO L82 PathProgramCache]: Analyzing trace with hash 954804125, now seen corresponding path program 1 times [2019-09-10 08:34:22,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:22,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:22,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:22,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:22,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:34:22,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:22,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:34:22,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:34:22,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:34:22,808 INFO L87 Difference]: Start difference. First operand 1350 states and 1721 transitions. Second operand 12 states. [2019-09-10 08:34:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:24,567 INFO L93 Difference]: Finished difference Result 3153 states and 4235 transitions. [2019-09-10 08:34:24,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:34:24,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 123 [2019-09-10 08:34:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:24,571 INFO L225 Difference]: With dead ends: 3153 [2019-09-10 08:34:24,571 INFO L226 Difference]: Without dead ends: 3153 [2019-09-10 08:34:24,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:34:24,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2019-09-10 08:34:24,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 1110. [2019-09-10 08:34:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2019-09-10 08:34:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1421 transitions. [2019-09-10 08:34:24,585 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1421 transitions. Word has length 123 [2019-09-10 08:34:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:24,585 INFO L475 AbstractCegarLoop]: Abstraction has 1110 states and 1421 transitions. [2019-09-10 08:34:24,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:34:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1421 transitions. [2019-09-10 08:34:24,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:34:24,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:24,586 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:24,587 INFO L418 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:24,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:24,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2123872129, now seen corresponding path program 1 times [2019-09-10 08:34:24,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:24,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:24,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:24,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:24,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:25,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:25,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:34:25,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:25,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:34:25,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:34:25,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:34:25,229 INFO L87 Difference]: Start difference. First operand 1110 states and 1421 transitions. Second operand 16 states. [2019-09-10 08:34:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:29,462 INFO L93 Difference]: Finished difference Result 2502 states and 3355 transitions. [2019-09-10 08:34:29,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:34:29,462 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 123 [2019-09-10 08:34:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:29,465 INFO L225 Difference]: With dead ends: 2502 [2019-09-10 08:34:29,465 INFO L226 Difference]: Without dead ends: 2502 [2019-09-10 08:34:29,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:34:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-09-10 08:34:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1090. [2019-09-10 08:34:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-09-10 08:34:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1394 transitions. [2019-09-10 08:34:29,477 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1394 transitions. Word has length 123 [2019-09-10 08:34:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:29,477 INFO L475 AbstractCegarLoop]: Abstraction has 1090 states and 1394 transitions. [2019-09-10 08:34:29,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:34:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1394 transitions. [2019-09-10 08:34:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:34:29,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:29,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:29,478 INFO L418 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:29,478 INFO L82 PathProgramCache]: Analyzing trace with hash 604342230, now seen corresponding path program 1 times [2019-09-10 08:34:29,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:29,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:29,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:29,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:29,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:30,874 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-09-10 08:34:31,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:31,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:31,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:34:31,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:31,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:34:31,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:34:31,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:34:31,675 INFO L87 Difference]: Start difference. First operand 1090 states and 1394 transitions. Second operand 26 states. [2019-09-10 08:34:31,835 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2019-09-10 08:34:33,025 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-10 08:34:33,283 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-09-10 08:34:33,613 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 79 [2019-09-10 08:34:34,041 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 98 [2019-09-10 08:34:34,296 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-10 08:34:34,539 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-10 08:34:34,795 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 08:34:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:43,130 INFO L93 Difference]: Finished difference Result 1664 states and 2111 transitions. [2019-09-10 08:34:43,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:34:43,131 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 123 [2019-09-10 08:34:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:43,133 INFO L225 Difference]: With dead ends: 1664 [2019-09-10 08:34:43,133 INFO L226 Difference]: Without dead ends: 1664 [2019-09-10 08:34:43,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:34:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-09-10 08:34:43,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1112. [2019-09-10 08:34:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-09-10 08:34:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1421 transitions. [2019-09-10 08:34:43,143 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1421 transitions. Word has length 123 [2019-09-10 08:34:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:43,143 INFO L475 AbstractCegarLoop]: Abstraction has 1112 states and 1421 transitions. [2019-09-10 08:34:43,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:34:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1421 transitions. [2019-09-10 08:34:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:34:43,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:43,144 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:43,145 INFO L418 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:43,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:43,145 INFO L82 PathProgramCache]: Analyzing trace with hash -528356586, now seen corresponding path program 1 times [2019-09-10 08:34:43,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:43,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:43,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:43,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:43,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:43,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:43,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:43,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:43,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:43,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:43,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:43,312 INFO L87 Difference]: Start difference. First operand 1112 states and 1421 transitions. Second operand 9 states. [2019-09-10 08:34:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:45,920 INFO L93 Difference]: Finished difference Result 1974 states and 2606 transitions. [2019-09-10 08:34:45,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:45,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:34:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:45,923 INFO L225 Difference]: With dead ends: 1974 [2019-09-10 08:34:45,923 INFO L226 Difference]: Without dead ends: 1974 [2019-09-10 08:34:45,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:34:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-09-10 08:34:45,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1112. [2019-09-10 08:34:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-09-10 08:34:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1418 transitions. [2019-09-10 08:34:45,934 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1418 transitions. Word has length 123 [2019-09-10 08:34:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:45,934 INFO L475 AbstractCegarLoop]: Abstraction has 1112 states and 1418 transitions. [2019-09-10 08:34:45,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1418 transitions. [2019-09-10 08:34:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:34:45,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:45,935 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:45,935 INFO L418 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:45,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:45,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1798509169, now seen corresponding path program 1 times [2019-09-10 08:34:45,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:45,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:45,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:45,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:45,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:46,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:46,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:46,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:46,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:46,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:46,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:46,164 INFO L87 Difference]: Start difference. First operand 1112 states and 1418 transitions. Second operand 9 states. [2019-09-10 08:34:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:48,733 INFO L93 Difference]: Finished difference Result 1911 states and 2510 transitions. [2019-09-10 08:34:48,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:48,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:34:48,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:48,736 INFO L225 Difference]: With dead ends: 1911 [2019-09-10 08:34:48,736 INFO L226 Difference]: Without dead ends: 1911 [2019-09-10 08:34:48,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:34:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2019-09-10 08:34:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1112. [2019-09-10 08:34:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-09-10 08:34:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1415 transitions. [2019-09-10 08:34:48,746 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1415 transitions. Word has length 123 [2019-09-10 08:34:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:48,747 INFO L475 AbstractCegarLoop]: Abstraction has 1112 states and 1415 transitions. [2019-09-10 08:34:48,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1415 transitions. [2019-09-10 08:34:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:34:48,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:48,748 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:48,748 INFO L418 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:48,748 INFO L82 PathProgramCache]: Analyzing trace with hash 517398106, now seen corresponding path program 1 times [2019-09-10 08:34:48,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:48,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:48,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:48,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:48,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:49,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:49,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:34:49,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:49,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:34:49,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:34:49,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:34:49,147 INFO L87 Difference]: Start difference. First operand 1112 states and 1415 transitions. Second operand 11 states. [2019-09-10 08:34:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:51,610 INFO L93 Difference]: Finished difference Result 1565 states and 1996 transitions. [2019-09-10 08:34:51,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:34:51,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2019-09-10 08:34:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:51,613 INFO L225 Difference]: With dead ends: 1565 [2019-09-10 08:34:51,613 INFO L226 Difference]: Without dead ends: 1565 [2019-09-10 08:34:51,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:34:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2019-09-10 08:34:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1096. [2019-09-10 08:34:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2019-09-10 08:34:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1394 transitions. [2019-09-10 08:34:51,622 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1394 transitions. Word has length 123 [2019-09-10 08:34:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:51,622 INFO L475 AbstractCegarLoop]: Abstraction has 1096 states and 1394 transitions. [2019-09-10 08:34:51,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:34:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1394 transitions. [2019-09-10 08:34:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:34:51,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:51,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:51,623 INFO L418 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:51,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:51,624 INFO L82 PathProgramCache]: Analyzing trace with hash -909941686, now seen corresponding path program 1 times [2019-09-10 08:34:51,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:51,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:51,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:51,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:51,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:52,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:52,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:34:52,428 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:52,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:34:52,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:34:52,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:34:52,428 INFO L87 Difference]: Start difference. First operand 1096 states and 1394 transitions. Second operand 16 states. [2019-09-10 08:34:53,176 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 08:34:53,335 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:34:53,489 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:34:53,667 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:34:53,841 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 08:34:59,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:59,020 INFO L93 Difference]: Finished difference Result 1908 states and 2408 transitions. [2019-09-10 08:34:59,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:34:59,021 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 123 [2019-09-10 08:34:59,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:59,023 INFO L225 Difference]: With dead ends: 1908 [2019-09-10 08:34:59,023 INFO L226 Difference]: Without dead ends: 1908 [2019-09-10 08:34:59,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:34:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2019-09-10 08:34:59,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1071. [2019-09-10 08:34:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-09-10 08:34:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1360 transitions. [2019-09-10 08:34:59,036 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1360 transitions. Word has length 123 [2019-09-10 08:34:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:59,036 INFO L475 AbstractCegarLoop]: Abstraction has 1071 states and 1360 transitions. [2019-09-10 08:34:59,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:34:59,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1360 transitions. [2019-09-10 08:34:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:34:59,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:59,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:59,038 INFO L418 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:59,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:59,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1048149754, now seen corresponding path program 1 times [2019-09-10 08:34:59,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:59,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:59,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:59,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:59,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:59,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:59,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:34:59,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:59,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:34:59,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:34:59,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:34:59,658 INFO L87 Difference]: Start difference. First operand 1071 states and 1360 transitions. Second operand 13 states. [2019-09-10 08:35:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:01,386 INFO L93 Difference]: Finished difference Result 3370 states and 4545 transitions. [2019-09-10 08:35:01,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:35:01,386 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2019-09-10 08:35:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:01,389 INFO L225 Difference]: With dead ends: 3370 [2019-09-10 08:35:01,390 INFO L226 Difference]: Without dead ends: 3370 [2019-09-10 08:35:01,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:35:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2019-09-10 08:35:01,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 979. [2019-09-10 08:35:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-09-10 08:35:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1239 transitions. [2019-09-10 08:35:01,401 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1239 transitions. Word has length 123 [2019-09-10 08:35:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:01,402 INFO L475 AbstractCegarLoop]: Abstraction has 979 states and 1239 transitions. [2019-09-10 08:35:01,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:35:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1239 transitions. [2019-09-10 08:35:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:35:01,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:01,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:01,403 INFO L418 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:01,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash 317658319, now seen corresponding path program 1 times [2019-09-10 08:35:01,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:01,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:01,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:01,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:01,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:02,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 08:35:02,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:02,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:35:02,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:02,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:35:02,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:35:02,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:35:02,177 INFO L87 Difference]: Start difference. First operand 979 states and 1239 transitions. Second operand 16 states. [2019-09-10 08:35:02,869 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 08:35:02,998 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:35:03,124 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:35:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:07,082 INFO L93 Difference]: Finished difference Result 1761 states and 2220 transitions. [2019-09-10 08:35:07,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:35:07,083 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 123 [2019-09-10 08:35:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:07,085 INFO L225 Difference]: With dead ends: 1761 [2019-09-10 08:35:07,085 INFO L226 Difference]: Without dead ends: 1761 [2019-09-10 08:35:07,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=236, Invalid=756, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:35:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2019-09-10 08:35:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 985. [2019-09-10 08:35:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-09-10 08:35:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1247 transitions. [2019-09-10 08:35:07,095 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1247 transitions. Word has length 123 [2019-09-10 08:35:07,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:07,095 INFO L475 AbstractCegarLoop]: Abstraction has 985 states and 1247 transitions. [2019-09-10 08:35:07,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:35:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1247 transitions. [2019-09-10 08:35:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:35:07,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:07,096 INFO L418 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:07,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:07,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1672036019, now seen corresponding path program 1 times [2019-09-10 08:35:07,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:07,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:07,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:07,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:07,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:07,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:07,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:35:07,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:07,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:35:07,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:35:07,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:35:07,845 INFO L87 Difference]: Start difference. First operand 985 states and 1247 transitions. Second operand 16 states. [2019-09-10 08:35:08,616 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 08:35:08,791 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:35:08,951 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:35:09,130 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:35:09,300 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-10 08:35:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:14,107 INFO L93 Difference]: Finished difference Result 1736 states and 2197 transitions. [2019-09-10 08:35:14,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:35:14,108 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 123 [2019-09-10 08:35:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:14,109 INFO L225 Difference]: With dead ends: 1736 [2019-09-10 08:35:14,109 INFO L226 Difference]: Without dead ends: 1736 [2019-09-10 08:35:14,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:35:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2019-09-10 08:35:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 984. [2019-09-10 08:35:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-09-10 08:35:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1245 transitions. [2019-09-10 08:35:14,118 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1245 transitions. Word has length 123 [2019-09-10 08:35:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:14,118 INFO L475 AbstractCegarLoop]: Abstraction has 984 states and 1245 transitions. [2019-09-10 08:35:14,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:35:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1245 transitions. [2019-09-10 08:35:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:35:14,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:14,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:14,119 INFO L418 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:14,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:14,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1228481752, now seen corresponding path program 1 times [2019-09-10 08:35:14,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:14,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:14,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:14,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:14,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:15,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:15,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:35:15,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:15,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:35:15,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:35:15,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:35:15,226 INFO L87 Difference]: Start difference. First operand 984 states and 1245 transitions. Second operand 21 states. [2019-09-10 08:35:16,315 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 08:35:16,580 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81