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.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:26:10,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:26:10,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:26:10,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:26:10,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:26:10,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:26:10,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:26:10,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:26:10,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:26:10,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:26:10,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:26:10,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:26:10,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:26:10,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:26:10,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:26:10,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:26:10,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:26:10,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:26:10,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:26:10,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:26:10,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:26:10,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:26:10,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:26:10,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:26:10,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:26:10,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:26:10,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:26:10,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:26:10,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:26:10,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:26:10,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:26:10,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:26:10,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:26:10,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:26:10,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:26:10,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:26:10,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:26:10,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:26:10,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:26:10,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:26:10,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:26:10,616 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:26:10,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:26:10,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:26:10,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:26:10,636 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:26:10,637 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:26:10,637 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:26:10,637 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:26:10,638 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:26:10,638 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:26:10,638 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:26:10,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:26:10,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:26:10,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:26:10,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:26:10,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:26:10,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:26:10,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:26:10,640 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:26:10,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:26:10,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:26:10,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:26:10,641 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:26:10,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:26:10,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:26:10,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:26:10,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:26:10,642 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:26:10,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:26:10,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:26:10,643 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:26:10,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:26:10,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:26:10,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:26:10,689 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:26:10,689 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:26:10,690 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:26:10,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df343ef9/2468b4d9370448e3baff5cabc0ab0a74/FLAG6fc7e9a49 [2019-09-10 08:26:11,573 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:26:11,573 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:26:11,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df343ef9/2468b4d9370448e3baff5cabc0ab0a74/FLAG6fc7e9a49 [2019-09-10 08:26:12,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df343ef9/2468b4d9370448e3baff5cabc0ab0a74 [2019-09-10 08:26:12,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:26:12,091 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:26:12,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:26:12,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:26:12,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:26:12,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:26:12" (1/1) ... [2019-09-10 08:26:12,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27370af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:12, skipping insertion in model container [2019-09-10 08:26:12,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:26:12" (1/1) ... [2019-09-10 08:26:12,112 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:26:12,362 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:26:14,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:26:14,566 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:26:15,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:26:15,794 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:26:15,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:15 WrapperNode [2019-09-10 08:26:15,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:26:15,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:26:15,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:26:15,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:26:15,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:15" (1/1) ... [2019-09-10 08:26:15,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:15" (1/1) ... [2019-09-10 08:26:15,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:15" (1/1) ... [2019-09-10 08:26:15,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:15" (1/1) ... [2019-09-10 08:26:15,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:15" (1/1) ... [2019-09-10 08:26:16,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:15" (1/1) ... [2019-09-10 08:26:16,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:15" (1/1) ... [2019-09-10 08:26:16,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:26:16,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:26:16,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:26:16,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:26:16,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:15" (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:26:16,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:26:16,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:26:16,182 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:26:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:26:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:26:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:26:16,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:26:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:26:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:26:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:26:16,183 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:26:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:26:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:26:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:26:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:26:16,184 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:26:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:26:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:26:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:26:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:26:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:26:16,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:26:16,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:26:22,068 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:26:22,069 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:26:22,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:26:22 BoogieIcfgContainer [2019-09-10 08:26:22,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:26:22,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:26:22,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:26:22,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:26:22,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:26:12" (1/3) ... [2019-09-10 08:26:22,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10763ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:26:22, skipping insertion in model container [2019-09-10 08:26:22,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:26:15" (2/3) ... [2019-09-10 08:26:22,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10763ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:26:22, skipping insertion in model container [2019-09-10 08:26:22,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:26:22" (3/3) ... [2019-09-10 08:26:22,079 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:26:22,089 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:26:22,100 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-09-10 08:26:22,117 INFO L252 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-09-10 08:26:22,144 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:26:22,144 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:26:22,144 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:26:22,144 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:26:22,144 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:26:22,144 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:26:22,145 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:26:22,145 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:26:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states. [2019-09-10 08:26:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:26:22,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:22,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,238 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:22,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1358263755, now seen corresponding path program 1 times [2019-09-10 08:26:22,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:22,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:22,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:22,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:23,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:26:23,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:23,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:26:23,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:23,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:26:23,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:26:23,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:26:23,083 INFO L87 Difference]: Start difference. First operand 2069 states. Second operand 5 states. [2019-09-10 08:26:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:25,285 INFO L93 Difference]: Finished difference Result 2147 states and 3698 transitions. [2019-09-10 08:26:25,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:26:25,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 08:26:25,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:25,323 INFO L225 Difference]: With dead ends: 2147 [2019-09-10 08:26:25,323 INFO L226 Difference]: Without dead ends: 2135 [2019-09-10 08:26:25,325 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:26:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2019-09-10 08:26:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 2033. [2019-09-10 08:26:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2019-09-10 08:26:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2753 transitions. [2019-09-10 08:26:25,458 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2753 transitions. Word has length 104 [2019-09-10 08:26:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:25,459 INFO L475 AbstractCegarLoop]: Abstraction has 2033 states and 2753 transitions. [2019-09-10 08:26:25,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:26:25,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2753 transitions. [2019-09-10 08:26:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:26:25,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:25,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:25,469 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:25,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:25,470 INFO L82 PathProgramCache]: Analyzing trace with hash 650628465, now seen corresponding path program 1 times [2019-09-10 08:26:25,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:25,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:25,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:25,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:25,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:25,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:26:25,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:25,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:26:25,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:25,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:26:25,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:26:25,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:26:25,712 INFO L87 Difference]: Start difference. First operand 2033 states and 2753 transitions. Second operand 5 states. [2019-09-10 08:26:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:26,839 INFO L93 Difference]: Finished difference Result 1780 states and 2466 transitions. [2019-09-10 08:26:26,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:26:26,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 08:26:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:26,848 INFO L225 Difference]: With dead ends: 1780 [2019-09-10 08:26:26,848 INFO L226 Difference]: Without dead ends: 1780 [2019-09-10 08:26:26,849 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:26:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2019-09-10 08:26:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1780. [2019-09-10 08:26:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-09-10 08:26:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2466 transitions. [2019-09-10 08:26:26,893 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2466 transitions. Word has length 105 [2019-09-10 08:26:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:26,894 INFO L475 AbstractCegarLoop]: Abstraction has 1780 states and 2466 transitions. [2019-09-10 08:26:26,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:26:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2466 transitions. [2019-09-10 08:26:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:26:26,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:26,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,902 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:26,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:26,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1348402675, now seen corresponding path program 1 times [2019-09-10 08:26:26,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:26,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:26,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:26,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:26,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:27,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:27,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:27,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:26:27,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:27,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:26:27,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:26:27,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:26:27,185 INFO L87 Difference]: Start difference. First operand 1780 states and 2466 transitions. Second operand 5 states. [2019-09-10 08:26:28,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:28,628 INFO L93 Difference]: Finished difference Result 1700 states and 2368 transitions. [2019-09-10 08:26:28,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:26:28,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 08:26:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:28,642 INFO L225 Difference]: With dead ends: 1700 [2019-09-10 08:26:28,642 INFO L226 Difference]: Without dead ends: 1700 [2019-09-10 08:26:28,643 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:26:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-09-10 08:26:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1700. [2019-09-10 08:26:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2019-09-10 08:26:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2368 transitions. [2019-09-10 08:26:28,679 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2368 transitions. Word has length 106 [2019-09-10 08:26:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:28,679 INFO L475 AbstractCegarLoop]: Abstraction has 1700 states and 2368 transitions. [2019-09-10 08:26:28,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:26:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2368 transitions. [2019-09-10 08:26:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:26:28,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:28,685 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,686 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:28,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:28,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1488492267, now seen corresponding path program 1 times [2019-09-10 08:26:28,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:28,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:28,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:28,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:28,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:28,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:26:28,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:28,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:26:28,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:28,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:26:28,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:26:28,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:26:28,877 INFO L87 Difference]: Start difference. First operand 1700 states and 2368 transitions. Second operand 5 states. [2019-09-10 08:26:30,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:30,076 INFO L93 Difference]: Finished difference Result 1618 states and 2276 transitions. [2019-09-10 08:26:30,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:26:30,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-10 08:26:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:30,087 INFO L225 Difference]: With dead ends: 1618 [2019-09-10 08:26:30,087 INFO L226 Difference]: Without dead ends: 1618 [2019-09-10 08:26:30,088 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:26:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2019-09-10 08:26:30,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2019-09-10 08:26:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-09-10 08:26:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2276 transitions. [2019-09-10 08:26:30,123 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2276 transitions. Word has length 107 [2019-09-10 08:26:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:30,123 INFO L475 AbstractCegarLoop]: Abstraction has 1618 states and 2276 transitions. [2019-09-10 08:26:30,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:26:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2276 transitions. [2019-09-10 08:26:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:26:30,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:30,128 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,129 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:30,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:30,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1732266651, now seen corresponding path program 1 times [2019-09-10 08:26:30,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:30,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:30,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:30,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:30,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:30,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:30,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:26:30,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:30,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:26:30,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:26:30,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:26:30,361 INFO L87 Difference]: Start difference. First operand 1618 states and 2276 transitions. Second operand 5 states. [2019-09-10 08:26:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:31,384 INFO L93 Difference]: Finished difference Result 1580 states and 2232 transitions. [2019-09-10 08:26:31,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:26:31,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-10 08:26:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:31,393 INFO L225 Difference]: With dead ends: 1580 [2019-09-10 08:26:31,393 INFO L226 Difference]: Without dead ends: 1580 [2019-09-10 08:26:31,394 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:26:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2019-09-10 08:26:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2019-09-10 08:26:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2019-09-10 08:26:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2232 transitions. [2019-09-10 08:26:31,424 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2232 transitions. Word has length 108 [2019-09-10 08:26:31,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:31,425 INFO L475 AbstractCegarLoop]: Abstraction has 1580 states and 2232 transitions. [2019-09-10 08:26:31,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:26:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2232 transitions. [2019-09-10 08:26:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:26:31,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:31,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] [2019-09-10 08:26:31,430 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:31,431 INFO L82 PathProgramCache]: Analyzing trace with hash -198575823, now seen corresponding path program 1 times [2019-09-10 08:26:31,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:31,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:31,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:31,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:31,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:31,637 INFO L134 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:31,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:31,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:26:31,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:31,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:26:31,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:26:31,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:26:31,640 INFO L87 Difference]: Start difference. First operand 1580 states and 2232 transitions. Second operand 5 states. [2019-09-10 08:26:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:32,617 INFO L93 Difference]: Finished difference Result 1555 states and 2203 transitions. [2019-09-10 08:26:32,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:26:32,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 08:26:32,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:32,627 INFO L225 Difference]: With dead ends: 1555 [2019-09-10 08:26:32,627 INFO L226 Difference]: Without dead ends: 1555 [2019-09-10 08:26:32,627 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:26:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-09-10 08:26:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1555. [2019-09-10 08:26:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2019-09-10 08:26:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2203 transitions. [2019-09-10 08:26:32,664 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2203 transitions. Word has length 109 [2019-09-10 08:26:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:32,670 INFO L475 AbstractCegarLoop]: Abstraction has 1555 states and 2203 transitions. [2019-09-10 08:26:32,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:26:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2203 transitions. [2019-09-10 08:26:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:26:32,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:32,678 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,679 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:32,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:32,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1099010427, now seen corresponding path program 1 times [2019-09-10 08:26:32,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:32,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:32,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:32,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:32,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:32,877 INFO L134 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:32,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:32,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:26:32,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:32,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:26:32,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:26:32,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:26:32,880 INFO L87 Difference]: Start difference. First operand 1555 states and 2203 transitions. Second operand 5 states. [2019-09-10 08:26:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:33,923 INFO L93 Difference]: Finished difference Result 1547 states and 2192 transitions. [2019-09-10 08:26:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:26:33,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-10 08:26:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:33,932 INFO L225 Difference]: With dead ends: 1547 [2019-09-10 08:26:33,932 INFO L226 Difference]: Without dead ends: 1547 [2019-09-10 08:26:33,932 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:26:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2019-09-10 08:26:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1547. [2019-09-10 08:26:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:26:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2192 transitions. [2019-09-10 08:26:33,960 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2192 transitions. Word has length 110 [2019-09-10 08:26:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:33,960 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2192 transitions. [2019-09-10 08:26:33,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:26:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2192 transitions. [2019-09-10 08:26:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:26:33,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:33,965 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,966 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:33,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:33,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1196639721, now seen corresponding path program 1 times [2019-09-10 08:26:33,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:33,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:33,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:33,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:33,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:34,306 INFO L134 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:34,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:34,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:26:34,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:34,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:26:34,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:26:34,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:26:34,308 INFO L87 Difference]: Start difference. First operand 1547 states and 2192 transitions. Second operand 8 states. [2019-09-10 08:26:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:36,976 INFO L93 Difference]: Finished difference Result 2006 states and 2729 transitions. [2019-09-10 08:26:36,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:26:36,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2019-09-10 08:26:36,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:36,986 INFO L225 Difference]: With dead ends: 2006 [2019-09-10 08:26:36,986 INFO L226 Difference]: Without dead ends: 2006 [2019-09-10 08:26:36,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:26:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-09-10 08:26:37,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1547. [2019-09-10 08:26:37,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:26:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2191 transitions. [2019-09-10 08:26:37,020 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2191 transitions. Word has length 111 [2019-09-10 08:26:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:37,021 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2191 transitions. [2019-09-10 08:26:37,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:26:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2191 transitions. [2019-09-10 08:26:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:26:37,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:37,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,031 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:37,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:37,031 INFO L82 PathProgramCache]: Analyzing trace with hash -437132848, now seen corresponding path program 1 times [2019-09-10 08:26:37,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:37,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:37,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:37,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:37,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:37,341 INFO L134 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:37,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:37,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:37,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:37,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:37,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:37,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:37,343 INFO L87 Difference]: Start difference. First operand 1547 states and 2191 transitions. Second operand 9 states. [2019-09-10 08:26:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:40,226 INFO L93 Difference]: Finished difference Result 1974 states and 2826 transitions. [2019-09-10 08:26:40,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:26:40,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-10 08:26:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:40,235 INFO L225 Difference]: With dead ends: 1974 [2019-09-10 08:26:40,235 INFO L226 Difference]: Without dead ends: 1974 [2019-09-10 08:26:40,236 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:26:40,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-09-10 08:26:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1547. [2019-09-10 08:26:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:26:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2190 transitions. [2019-09-10 08:26:40,268 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2190 transitions. Word has length 111 [2019-09-10 08:26:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:40,269 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2190 transitions. [2019-09-10 08:26:40,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2190 transitions. [2019-09-10 08:26:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:26:40,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:40,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, 1, 1, 1, 1] [2019-09-10 08:26:40,273 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:40,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2043481244, now seen corresponding path program 1 times [2019-09-10 08:26:40,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:40,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:40,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:40,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:40,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:40,520 INFO L134 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:40,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:40,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:40,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:40,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:40,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:40,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:40,524 INFO L87 Difference]: Start difference. First operand 1547 states and 2190 transitions. Second operand 9 states. [2019-09-10 08:26:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:43,899 INFO L93 Difference]: Finished difference Result 2565 states and 3596 transitions. [2019-09-10 08:26:43,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:43,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-10 08:26:43,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:43,910 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:26:43,910 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:26:43,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:26:43,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:26:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:26:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:26:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2189 transitions. [2019-09-10 08:26:43,944 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2189 transitions. Word has length 111 [2019-09-10 08:26:43,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:43,945 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2189 transitions. [2019-09-10 08:26:43,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2189 transitions. [2019-09-10 08:26:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:26:43,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:43,949 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,950 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash -447248493, now seen corresponding path program 1 times [2019-09-10 08:26:43,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:43,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:43,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:43,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:43,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:44,210 INFO L134 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:44,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:44,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:44,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:44,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:44,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:44,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:44,212 INFO L87 Difference]: Start difference. First operand 1547 states and 2189 transitions. Second operand 9 states. [2019-09-10 08:26:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:47,560 INFO L93 Difference]: Finished difference Result 2565 states and 3594 transitions. [2019-09-10 08:26:47,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:47,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-10 08:26:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:47,571 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:26:47,571 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:26:47,572 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:26:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:26:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:26:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:26:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2188 transitions. [2019-09-10 08:26:47,637 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2188 transitions. Word has length 113 [2019-09-10 08:26:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:47,637 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2188 transitions. [2019-09-10 08:26:47,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2188 transitions. [2019-09-10 08:26:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:26:47,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:47,642 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,642 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:47,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:47,643 INFO L82 PathProgramCache]: Analyzing trace with hash 809613266, now seen corresponding path program 1 times [2019-09-10 08:26:47,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:47,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:47,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:47,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:47,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:47,883 INFO L134 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:47,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:47,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:47,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:47,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:47,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:47,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:47,885 INFO L87 Difference]: Start difference. First operand 1547 states and 2188 transitions. Second operand 9 states. [2019-09-10 08:26:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:51,666 INFO L93 Difference]: Finished difference Result 2758 states and 3931 transitions. [2019-09-10 08:26:51,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:51,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-10 08:26:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:51,677 INFO L225 Difference]: With dead ends: 2758 [2019-09-10 08:26:51,677 INFO L226 Difference]: Without dead ends: 2758 [2019-09-10 08:26:51,678 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:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2019-09-10 08:26:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 1547. [2019-09-10 08:26:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:26:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2187 transitions. [2019-09-10 08:26:51,711 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2187 transitions. Word has length 113 [2019-09-10 08:26:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:51,711 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2187 transitions. [2019-09-10 08:26:51,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2187 transitions. [2019-09-10 08:26:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:26:51,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:51,716 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,716 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:51,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:51,717 INFO L82 PathProgramCache]: Analyzing trace with hash -953510862, now seen corresponding path program 1 times [2019-09-10 08:26:51,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:51,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:51,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:51,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:51,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:52,054 INFO L134 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:52,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:52,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:52,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:52,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:52,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:52,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:52,056 INFO L87 Difference]: Start difference. First operand 1547 states and 2187 transitions. Second operand 9 states. [2019-09-10 08:26:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:55,539 INFO L93 Difference]: Finished difference Result 2565 states and 3591 transitions. [2019-09-10 08:26:55,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:55,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-10 08:26:55,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:55,551 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:26:55,551 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:26:55,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:26:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:26:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:26:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:26:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2186 transitions. [2019-09-10 08:26:55,583 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2186 transitions. Word has length 113 [2019-09-10 08:26:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:55,584 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2186 transitions. [2019-09-10 08:26:55,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2186 transitions. [2019-09-10 08:26:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:26:55,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:55,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,589 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1335436329, now seen corresponding path program 1 times [2019-09-10 08:26:55,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:55,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:55,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:55,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:55,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:55,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:26:55,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:55,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:55,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:55,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:55,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:55,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:55,821 INFO L87 Difference]: Start difference. First operand 1547 states and 2186 transitions. Second operand 9 states. [2019-09-10 08:26:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:59,123 INFO L93 Difference]: Finished difference Result 2565 states and 3589 transitions. [2019-09-10 08:26:59,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:59,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-10 08:26:59,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:59,131 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:26:59,131 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:26:59,132 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:26:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:26:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:26:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:26:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2185 transitions. [2019-09-10 08:26:59,160 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2185 transitions. Word has length 113 [2019-09-10 08:26:59,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:59,160 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2185 transitions. [2019-09-10 08:26:59,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2185 transitions. [2019-09-10 08:26:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:26:59,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:59,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,165 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:59,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1339422240, now seen corresponding path program 1 times [2019-09-10 08:26:59,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:59,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:59,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:59,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:59,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:26:59,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:59,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:59,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:59,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:59,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:59,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:59,425 INFO L87 Difference]: Start difference. First operand 1547 states and 2185 transitions. Second operand 9 states. [2019-09-10 08:27:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:03,256 INFO L93 Difference]: Finished difference Result 2758 states and 3928 transitions. [2019-09-10 08:27:03,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:03,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-10 08:27:03,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:03,269 INFO L225 Difference]: With dead ends: 2758 [2019-09-10 08:27:03,269 INFO L226 Difference]: Without dead ends: 2758 [2019-09-10 08:27:03,270 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:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2019-09-10 08:27:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 1547. [2019-09-10 08:27:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2184 transitions. [2019-09-10 08:27:03,303 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2184 transitions. Word has length 113 [2019-09-10 08:27:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:03,304 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2184 transitions. [2019-09-10 08:27:03,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2184 transitions. [2019-09-10 08:27:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:27:03,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:03,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,309 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:03,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash 229550188, now seen corresponding path program 1 times [2019-09-10 08:27:03,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:03,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:03,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:03,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:03,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:03,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:27:03,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:03,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:03,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:03,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:03,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:03,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:03,547 INFO L87 Difference]: Start difference. First operand 1547 states and 2184 transitions. Second operand 9 states. [2019-09-10 08:27:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:06,826 INFO L93 Difference]: Finished difference Result 2726 states and 3873 transitions. [2019-09-10 08:27:06,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:06,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-10 08:27:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:06,832 INFO L225 Difference]: With dead ends: 2726 [2019-09-10 08:27:06,832 INFO L226 Difference]: Without dead ends: 2726 [2019-09-10 08:27:06,833 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:27:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-10 08:27:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-10 08:27:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2182 transitions. [2019-09-10 08:27:06,860 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2182 transitions. Word has length 113 [2019-09-10 08:27:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:06,861 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2182 transitions. [2019-09-10 08:27:06,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2182 transitions. [2019-09-10 08:27:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:27:06,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:06,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,865 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:06,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:06,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1586710105, now seen corresponding path program 1 times [2019-09-10 08:27:06,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:06,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:06,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:06,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:06,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:07,110 INFO L134 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:07,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:07,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:07,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:07,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:07,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:07,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:07,113 INFO L87 Difference]: Start difference. First operand 1547 states and 2182 transitions. Second operand 9 states. [2019-09-10 08:27:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:10,426 INFO L93 Difference]: Finished difference Result 2726 states and 3869 transitions. [2019-09-10 08:27:10,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:10,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-10 08:27:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:10,436 INFO L225 Difference]: With dead ends: 2726 [2019-09-10 08:27:10,436 INFO L226 Difference]: Without dead ends: 2726 [2019-09-10 08:27:10,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:10,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-10 08:27:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-10 08:27:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2180 transitions. [2019-09-10 08:27:10,465 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2180 transitions. Word has length 113 [2019-09-10 08:27:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:10,466 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2180 transitions. [2019-09-10 08:27:10,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2180 transitions. [2019-09-10 08:27:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:27:10,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:10,469 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,470 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:10,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:10,470 INFO L82 PathProgramCache]: Analyzing trace with hash 321088677, now seen corresponding path program 1 times [2019-09-10 08:27:10,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:10,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:10,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:10,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:10,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:10,731 INFO L134 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:10,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:10,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:10,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:10,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:10,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:10,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:10,733 INFO L87 Difference]: Start difference. First operand 1547 states and 2180 transitions. Second operand 9 states. [2019-09-10 08:27:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:13,975 INFO L93 Difference]: Finished difference Result 2565 states and 3580 transitions. [2019-09-10 08:27:13,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:13,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-10 08:27:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:13,982 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:27:13,982 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:27:13,983 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:27:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:27:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:27:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2178 transitions. [2019-09-10 08:27:14,013 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2178 transitions. Word has length 113 [2019-09-10 08:27:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:14,014 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2178 transitions. [2019-09-10 08:27:14,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2178 transitions. [2019-09-10 08:27:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:27:14,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:14,018 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:14,019 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:14,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:14,019 INFO L82 PathProgramCache]: Analyzing trace with hash 420243049, now seen corresponding path program 1 times [2019-09-10 08:27:14,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:14,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:14,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:14,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:14,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:14,246 INFO L134 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:14,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:14,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:14,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:14,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:14,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:14,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:14,248 INFO L87 Difference]: Start difference. First operand 1547 states and 2178 transitions. Second operand 9 states. [2019-09-10 08:27:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:17,549 INFO L93 Difference]: Finished difference Result 1974 states and 2812 transitions. [2019-09-10 08:27:17,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:27:17,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-10 08:27:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:17,553 INFO L225 Difference]: With dead ends: 1974 [2019-09-10 08:27:17,553 INFO L226 Difference]: Without dead ends: 1974 [2019-09-10 08:27:17,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:27:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-09-10 08:27:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1547. [2019-09-10 08:27:17,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2176 transitions. [2019-09-10 08:27:17,577 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2176 transitions. Word has length 113 [2019-09-10 08:27:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:17,577 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2176 transitions. [2019-09-10 08:27:17,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2176 transitions. [2019-09-10 08:27:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:27:17,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:17,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,581 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:17,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:17,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1012137094, now seen corresponding path program 1 times [2019-09-10 08:27:17,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:17,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:17,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:17,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:17,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:17,817 INFO L134 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:17,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:17,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:17,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:17,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:17,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:17,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:17,819 INFO L87 Difference]: Start difference. First operand 1547 states and 2176 transitions. Second operand 9 states. [2019-09-10 08:27:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:21,011 INFO L93 Difference]: Finished difference Result 2565 states and 3577 transitions. [2019-09-10 08:27:21,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:21,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:27:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:21,016 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:27:21,016 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:27:21,016 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:27:21,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:27:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:27:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2175 transitions. [2019-09-10 08:27:21,043 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2175 transitions. Word has length 115 [2019-09-10 08:27:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:21,043 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2175 transitions. [2019-09-10 08:27:21,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2175 transitions. [2019-09-10 08:27:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:27:21,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:21,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,047 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:21,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1284556713, now seen corresponding path program 1 times [2019-09-10 08:27:21,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:21,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:21,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:21,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:21,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:21,264 INFO L134 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:21,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:21,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:21,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:21,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:21,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:21,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:21,266 INFO L87 Difference]: Start difference. First operand 1547 states and 2175 transitions. Second operand 9 states. [2019-09-10 08:27:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:24,438 INFO L93 Difference]: Finished difference Result 2726 states and 3861 transitions. [2019-09-10 08:27:24,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:24,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:27:24,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:24,443 INFO L225 Difference]: With dead ends: 2726 [2019-09-10 08:27:24,443 INFO L226 Difference]: Without dead ends: 2726 [2019-09-10 08:27:24,443 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:27:24,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-10 08:27:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-10 08:27:24,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2174 transitions. [2019-09-10 08:27:24,471 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2174 transitions. Word has length 115 [2019-09-10 08:27:24,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:24,471 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2174 transitions. [2019-09-10 08:27:24,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2174 transitions. [2019-09-10 08:27:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:27:24,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:24,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,476 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:24,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:24,476 INFO L82 PathProgramCache]: Analyzing trace with hash -149086171, now seen corresponding path program 1 times [2019-09-10 08:27:24,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:24,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:24,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:24,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:24,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:24,712 INFO L134 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,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:24,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:24,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:24,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:24,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:24,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:24,714 INFO L87 Difference]: Start difference. First operand 1547 states and 2174 transitions. Second operand 9 states. [2019-09-10 08:27:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:28,063 INFO L93 Difference]: Finished difference Result 2565 states and 3574 transitions. [2019-09-10 08:27:28,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:28,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:27:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:28,068 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:27:28,068 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:27:28,069 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:27:28,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:27:28,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:27:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2173 transitions. [2019-09-10 08:27:28,091 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2173 transitions. Word has length 115 [2019-09-10 08:27:28,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:28,092 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2173 transitions. [2019-09-10 08:27:28,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2173 transitions. [2019-09-10 08:27:28,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:27:28,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:28,095 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,095 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:28,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:28,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1810790601, now seen corresponding path program 1 times [2019-09-10 08:27:28,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:28,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:28,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:28,301 INFO L134 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,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:28,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:28,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:28,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:28,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:28,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:28,303 INFO L87 Difference]: Start difference. First operand 1547 states and 2173 transitions. Second operand 9 states. [2019-09-10 08:27:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:32,149 INFO L93 Difference]: Finished difference Result 2726 states and 3858 transitions. [2019-09-10 08:27:32,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:32,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:27:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:32,153 INFO L225 Difference]: With dead ends: 2726 [2019-09-10 08:27:32,154 INFO L226 Difference]: Without dead ends: 2726 [2019-09-10 08:27:32,154 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:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-10 08:27:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-10 08:27:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2172 transitions. [2019-09-10 08:27:32,181 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2172 transitions. Word has length 115 [2019-09-10 08:27:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:32,181 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2172 transitions. [2019-09-10 08:27:32,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2172 transitions. [2019-09-10 08:27:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:27:32,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:32,185 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,185 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:32,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:32,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2133543625, now seen corresponding path program 1 times [2019-09-10 08:27:32,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:32,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:32,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:32,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:32,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:32,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:32,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:32,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:32,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:32,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:32,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:32,417 INFO L87 Difference]: Start difference. First operand 1547 states and 2172 transitions. Second operand 9 states. [2019-09-10 08:27:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:35,652 INFO L93 Difference]: Finished difference Result 2565 states and 3571 transitions. [2019-09-10 08:27:35,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:35,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:27:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:35,655 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:27:35,655 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:27:35,656 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:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:27:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:27:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2171 transitions. [2019-09-10 08:27:35,677 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2171 transitions. Word has length 115 [2019-09-10 08:27:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:35,678 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2171 transitions. [2019-09-10 08:27:35,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:35,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2171 transitions. [2019-09-10 08:27:35,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:27:35,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:35,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,682 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:35,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:35,682 INFO L82 PathProgramCache]: Analyzing trace with hash 874892072, now seen corresponding path program 1 times [2019-09-10 08:27:35,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:35,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:35,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:35,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:35,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:27:35,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:35,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:35,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:35,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:35,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:35,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:35,881 INFO L87 Difference]: Start difference. First operand 1547 states and 2171 transitions. Second operand 9 states. [2019-09-10 08:27:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:39,890 INFO L93 Difference]: Finished difference Result 2726 states and 3854 transitions. [2019-09-10 08:27:39,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:39,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:27:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:39,897 INFO L225 Difference]: With dead ends: 2726 [2019-09-10 08:27:39,897 INFO L226 Difference]: Without dead ends: 2726 [2019-09-10 08:27:39,897 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:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-10 08:27:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-10 08:27:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2170 transitions. [2019-09-10 08:27:39,917 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2170 transitions. Word has length 115 [2019-09-10 08:27:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:39,917 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2170 transitions. [2019-09-10 08:27:39,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2170 transitions. [2019-09-10 08:27:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:27:39,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:39,920 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,920 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:39,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1600689728, now seen corresponding path program 1 times [2019-09-10 08:27:39,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:39,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:39,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:39,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:39,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:40,182 INFO L134 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:40,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:40,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:40,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:40,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:40,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:40,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:40,184 INFO L87 Difference]: Start difference. First operand 1547 states and 2170 transitions. Second operand 9 states. [2019-09-10 08:27:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:43,441 INFO L93 Difference]: Finished difference Result 2565 states and 3568 transitions. [2019-09-10 08:27:43,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:43,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:27:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:43,445 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:27:43,445 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:27:43,445 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:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:27:43,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:27:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2169 transitions. [2019-09-10 08:27:43,463 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2169 transitions. Word has length 115 [2019-09-10 08:27:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:43,464 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2169 transitions. [2019-09-10 08:27:43,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2169 transitions. [2019-09-10 08:27:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:27:43,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:43,466 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,466 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:43,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1701183782, now seen corresponding path program 1 times [2019-09-10 08:27:43,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:43,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:43,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:43,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:43,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:43,707 INFO L134 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,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:43,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:43,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:43,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:43,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:43,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:43,710 INFO L87 Difference]: Start difference. First operand 1547 states and 2169 transitions. Second operand 9 states. [2019-09-10 08:27:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:46,877 INFO L93 Difference]: Finished difference Result 2565 states and 3566 transitions. [2019-09-10 08:27:46,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:46,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:27:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:46,881 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:27:46,881 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:27:46,882 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:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:27:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:27:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2168 transitions. [2019-09-10 08:27:46,901 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2168 transitions. Word has length 115 [2019-09-10 08:27:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:46,901 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2168 transitions. [2019-09-10 08:27:46,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2168 transitions. [2019-09-10 08:27:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:27:46,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:46,903 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,903 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:46,904 INFO L82 PathProgramCache]: Analyzing trace with hash 62320473, now seen corresponding path program 1 times [2019-09-10 08:27:46,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:46,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:46,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:46,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:47,161 INFO L134 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,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:47,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:47,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:47,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:47,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:47,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:47,163 INFO L87 Difference]: Start difference. First operand 1547 states and 2168 transitions. Second operand 9 states. [2019-09-10 08:27:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:50,471 INFO L93 Difference]: Finished difference Result 2565 states and 3565 transitions. [2019-09-10 08:27:50,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:50,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:27:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:50,475 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:27:50,475 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:27:50,475 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:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:27:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:27:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2167 transitions. [2019-09-10 08:27:50,522 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2167 transitions. Word has length 115 [2019-09-10 08:27:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:50,522 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2167 transitions. [2019-09-10 08:27:50,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2167 transitions. [2019-09-10 08:27:50,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:27:50,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:50,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,525 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:50,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:50,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1599031812, now seen corresponding path program 1 times [2019-09-10 08:27:50,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:50,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:50,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:50,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:50,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:50,748 INFO L134 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:50,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:50,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:50,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:50,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:50,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:50,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:50,750 INFO L87 Difference]: Start difference. First operand 1547 states and 2167 transitions. Second operand 9 states. [2019-09-10 08:27:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:54,750 INFO L93 Difference]: Finished difference Result 2726 states and 3850 transitions. [2019-09-10 08:27:54,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:54,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:27:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:54,755 INFO L225 Difference]: With dead ends: 2726 [2019-09-10 08:27:54,755 INFO L226 Difference]: Without dead ends: 2726 [2019-09-10 08:27:54,756 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:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-10 08:27:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-10 08:27:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2166 transitions. [2019-09-10 08:27:54,775 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2166 transitions. Word has length 115 [2019-09-10 08:27:54,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:54,775 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2166 transitions. [2019-09-10 08:27:54,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2166 transitions. [2019-09-10 08:27:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:27:54,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:54,777 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:54,777 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:54,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:54,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1905590914, now seen corresponding path program 1 times [2019-09-10 08:27:54,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:54,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:54,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:54,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:54,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:55,020 INFO L134 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,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:55,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:55,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:55,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:55,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:55,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:55,023 INFO L87 Difference]: Start difference. First operand 1547 states and 2166 transitions. Second operand 9 states. [2019-09-10 08:27:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:58,450 INFO L93 Difference]: Finished difference Result 2565 states and 3560 transitions. [2019-09-10 08:27:58,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:58,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:27:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:58,455 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:27:58,455 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:27:58,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:27:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:27:58,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:27:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:27:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2164 transitions. [2019-09-10 08:27:58,477 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2164 transitions. Word has length 115 [2019-09-10 08:27:58,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:58,478 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2164 transitions. [2019-09-10 08:27:58,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2164 transitions. [2019-09-10 08:27:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:27:58,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:58,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,481 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:58,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:58,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1215030672, now seen corresponding path program 1 times [2019-09-10 08:27:58,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:58,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:58,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:58,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:58,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:58,721 INFO L134 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:58,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:58,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:58,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:58,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:58,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:58,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:58,723 INFO L87 Difference]: Start difference. First operand 1547 states and 2164 transitions. Second operand 9 states. [2019-09-10 08:28:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:02,031 INFO L93 Difference]: Finished difference Result 2565 states and 3556 transitions. [2019-09-10 08:28:02,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:02,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:28:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:02,035 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:28:02,036 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:28:02,037 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:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:28:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:28:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2162 transitions. [2019-09-10 08:28:02,058 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2162 transitions. Word has length 115 [2019-09-10 08:28:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:02,058 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2162 transitions. [2019-09-10 08:28:02,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2162 transitions. [2019-09-10 08:28:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:28:02,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:02,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,062 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:02,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:02,062 INFO L82 PathProgramCache]: Analyzing trace with hash -316052418, now seen corresponding path program 1 times [2019-09-10 08:28:02,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:02,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:02,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:02,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:02,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:02,293 INFO L134 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:02,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:02,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:02,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:02,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:02,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:02,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:02,297 INFO L87 Difference]: Start difference. First operand 1547 states and 2162 transitions. Second operand 9 states. [2019-09-10 08:28:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:06,717 INFO L93 Difference]: Finished difference Result 2758 states and 3899 transitions. [2019-09-10 08:28:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:06,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:28:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:06,720 INFO L225 Difference]: With dead ends: 2758 [2019-09-10 08:28:06,720 INFO L226 Difference]: Without dead ends: 2758 [2019-09-10 08:28:06,721 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:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2019-09-10 08:28:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 1547. [2019-09-10 08:28:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2160 transitions. [2019-09-10 08:28:06,737 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2160 transitions. Word has length 115 [2019-09-10 08:28:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:06,737 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2160 transitions. [2019-09-10 08:28:06,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2160 transitions. [2019-09-10 08:28:06,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:28:06,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:06,739 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,739 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:06,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:06,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1557600535, now seen corresponding path program 1 times [2019-09-10 08:28:06,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:06,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:06,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:06,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:06,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:06,928 INFO L134 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,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:06,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:06,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:06,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:06,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:06,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:06,930 INFO L87 Difference]: Start difference. First operand 1547 states and 2160 transitions. Second operand 9 states. [2019-09-10 08:28:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:10,974 INFO L93 Difference]: Finished difference Result 2726 states and 3842 transitions. [2019-09-10 08:28:10,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:10,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:28:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:10,978 INFO L225 Difference]: With dead ends: 2726 [2019-09-10 08:28:10,979 INFO L226 Difference]: Without dead ends: 2726 [2019-09-10 08:28:10,979 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,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-10 08:28:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-10 08:28:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2158 transitions. [2019-09-10 08:28:11,005 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2158 transitions. Word has length 115 [2019-09-10 08:28:11,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:11,006 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2158 transitions. [2019-09-10 08:28:11,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:11,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2158 transitions. [2019-09-10 08:28:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:28:11,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:11,009 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,009 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1206967465, now seen corresponding path program 1 times [2019-09-10 08:28:11,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:11,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:11,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:11,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:11,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:11,209 INFO L134 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:11,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:11,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:11,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:11,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:11,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:11,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:11,212 INFO L87 Difference]: Start difference. First operand 1547 states and 2158 transitions. Second operand 9 states. [2019-09-10 08:28:14,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:14,651 INFO L93 Difference]: Finished difference Result 2565 states and 3548 transitions. [2019-09-10 08:28:14,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:14,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:28:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:14,656 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:28:14,656 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:28:14,656 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:14,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:28:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:28:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2156 transitions. [2019-09-10 08:28:14,672 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2156 transitions. Word has length 115 [2019-09-10 08:28:14,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:14,672 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2156 transitions. [2019-09-10 08:28:14,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2156 transitions. [2019-09-10 08:28:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:28:14,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:14,674 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,674 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:14,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:14,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1510493384, now seen corresponding path program 1 times [2019-09-10 08:28:14,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:14,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:14,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:14,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:14,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:14,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:14,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:14,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:14,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:14,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:14,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:14,863 INFO L87 Difference]: Start difference. First operand 1547 states and 2156 transitions. Second operand 9 states. [2019-09-10 08:28:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:18,245 INFO L93 Difference]: Finished difference Result 2565 states and 3544 transitions. [2019-09-10 08:28:18,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:18,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:28:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:18,249 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:28:18,250 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:28:18,250 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:18,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:28:18,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:28:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2154 transitions. [2019-09-10 08:28:18,267 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2154 transitions. Word has length 115 [2019-09-10 08:28:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:18,267 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2154 transitions. [2019-09-10 08:28:18,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2154 transitions. [2019-09-10 08:28:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:28:18,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:18,270 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,271 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:18,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:18,271 INFO L82 PathProgramCache]: Analyzing trace with hash -548113873, now seen corresponding path program 1 times [2019-09-10 08:28:18,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:18,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:18,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:18,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:18,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:18,493 INFO L134 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,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:18,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:18,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:18,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:18,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:18,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:18,495 INFO L87 Difference]: Start difference. First operand 1547 states and 2154 transitions. Second operand 9 states. [2019-09-10 08:28:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:21,892 INFO L93 Difference]: Finished difference Result 2565 states and 3542 transitions. [2019-09-10 08:28:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:21,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:28:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:21,896 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:28:21,896 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:28:21,896 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:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:28:21,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:28:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2152 transitions. [2019-09-10 08:28:21,915 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2152 transitions. Word has length 115 [2019-09-10 08:28:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:21,916 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2152 transitions. [2019-09-10 08:28:21,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2152 transitions. [2019-09-10 08:28:21,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:28:21,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:21,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] [2019-09-10 08:28:21,919 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:21,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:21,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1381042639, now seen corresponding path program 1 times [2019-09-10 08:28:21,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:21,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:21,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:21,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:21,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:22,135 INFO L134 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,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:22,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:22,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:22,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:22,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:22,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:22,136 INFO L87 Difference]: Start difference. First operand 1547 states and 2152 transitions. Second operand 9 states. [2019-09-10 08:28:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:26,643 INFO L93 Difference]: Finished difference Result 2758 states and 3879 transitions. [2019-09-10 08:28:26,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:26,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-10 08:28:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:26,647 INFO L225 Difference]: With dead ends: 2758 [2019-09-10 08:28:26,647 INFO L226 Difference]: Without dead ends: 2758 [2019-09-10 08:28:26,648 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:28:26,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2019-09-10 08:28:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 1547. [2019-09-10 08:28:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2150 transitions. [2019-09-10 08:28:26,664 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2150 transitions. Word has length 115 [2019-09-10 08:28:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:26,665 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2150 transitions. [2019-09-10 08:28:26,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2150 transitions. [2019-09-10 08:28:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:28:26,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:26,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,668 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:26,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:26,669 INFO L82 PathProgramCache]: Analyzing trace with hash 235051356, now seen corresponding path program 1 times [2019-09-10 08:28:26,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:26,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:26,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:26,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:26,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:26,859 INFO L134 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:26,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:26,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:26,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:26,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:26,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:26,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:26,860 INFO L87 Difference]: Start difference. First operand 1547 states and 2150 transitions. Second operand 9 states. [2019-09-10 08:28:31,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:31,174 INFO L93 Difference]: Finished difference Result 2702 states and 3791 transitions. [2019-09-10 08:28:31,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:31,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:28:31,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:31,179 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:28:31,180 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:28:31,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:28:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:28:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2149 transitions. [2019-09-10 08:28:31,202 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2149 transitions. Word has length 117 [2019-09-10 08:28:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:31,203 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2149 transitions. [2019-09-10 08:28:31,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2149 transitions. [2019-09-10 08:28:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:28:31,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:31,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] [2019-09-10 08:28:31,205 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash 703265472, now seen corresponding path program 1 times [2019-09-10 08:28:31,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:31,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:31,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:31,465 INFO L134 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:31,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:31,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:31,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:31,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:31,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:31,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:31,467 INFO L87 Difference]: Start difference. First operand 1547 states and 2149 transitions. Second operand 9 states. [2019-09-10 08:28:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:34,858 INFO L93 Difference]: Finished difference Result 2565 states and 3537 transitions. [2019-09-10 08:28:34,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:34,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:28:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:34,863 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:28:34,863 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:28:34,863 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:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:28:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:28:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2148 transitions. [2019-09-10 08:28:34,885 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2148 transitions. Word has length 117 [2019-09-10 08:28:34,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:34,886 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2148 transitions. [2019-09-10 08:28:34,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2148 transitions. [2019-09-10 08:28:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:28:34,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:34,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,889 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:34,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:34,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1011752119, now seen corresponding path program 1 times [2019-09-10 08:28:34,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:34,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:34,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:34,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:34,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:35,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:35,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:35,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:35,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:35,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:35,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:35,079 INFO L87 Difference]: Start difference. First operand 1547 states and 2148 transitions. Second operand 9 states. [2019-09-10 08:28:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:39,494 INFO L93 Difference]: Finished difference Result 2702 states and 3788 transitions. [2019-09-10 08:28:39,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:39,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:28:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:39,498 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:28:39,498 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:28:39,499 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:28:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:28:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:28:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2147 transitions. [2019-09-10 08:28:39,521 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2147 transitions. Word has length 117 [2019-09-10 08:28:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:39,521 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2147 transitions. [2019-09-10 08:28:39,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2147 transitions. [2019-09-10 08:28:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:28:39,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:39,524 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,524 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:39,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1237007145, now seen corresponding path program 1 times [2019-09-10 08:28:39,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:39,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:39,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:39,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:39,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:39,686 INFO L134 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:39,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:39,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:39,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:39,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:39,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:39,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:39,687 INFO L87 Difference]: Start difference. First operand 1547 states and 2147 transitions. Second operand 9 states. [2019-09-10 08:28:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:43,535 INFO L93 Difference]: Finished difference Result 2702 states and 3786 transitions. [2019-09-10 08:28:43,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:43,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:28:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:43,539 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:28:43,539 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:28:43,540 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:28:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:28:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:28:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2146 transitions. [2019-09-10 08:28:43,556 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2146 transitions. Word has length 117 [2019-09-10 08:28:43,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:43,556 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2146 transitions. [2019-09-10 08:28:43,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2146 transitions. [2019-09-10 08:28:43,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:28:43,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:43,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] [2019-09-10 08:28:43,559 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:43,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:43,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1107556400, now seen corresponding path program 1 times [2019-09-10 08:28:43,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:43,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:43,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:43,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:43,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:43,737 INFO L134 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:43,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:43,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:43,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:43,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:43,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:43,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:43,738 INFO L87 Difference]: Start difference. First operand 1547 states and 2146 transitions. Second operand 9 states. [2019-09-10 08:28:47,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:47,074 INFO L93 Difference]: Finished difference Result 2565 states and 3533 transitions. [2019-09-10 08:28:47,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:47,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:28:47,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:47,083 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:28:47,083 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:28:47,083 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:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:28:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:28:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2145 transitions. [2019-09-10 08:28:47,104 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2145 transitions. Word has length 117 [2019-09-10 08:28:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:47,104 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2145 transitions. [2019-09-10 08:28:47,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2145 transitions. [2019-09-10 08:28:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:28:47,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:47,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] [2019-09-10 08:28:47,107 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:47,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:47,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1337537591, now seen corresponding path program 1 times [2019-09-10 08:28:47,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:47,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:47,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:47,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:47,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:47,305 INFO L134 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:47,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:47,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:47,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:47,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:47,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:47,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:47,307 INFO L87 Difference]: Start difference. First operand 1547 states and 2145 transitions. Second operand 9 states. [2019-09-10 08:28:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:50,549 INFO L93 Difference]: Finished difference Result 2565 states and 3532 transitions. [2019-09-10 08:28:50,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:50,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:28:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:50,553 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:28:50,553 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:28:50,553 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:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:28:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:28:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2144 transitions. [2019-09-10 08:28:50,567 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2144 transitions. Word has length 117 [2019-09-10 08:28:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:50,568 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2144 transitions. [2019-09-10 08:28:50,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:50,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2144 transitions. [2019-09-10 08:28:50,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:28:50,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:50,570 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,570 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:50,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:50,570 INFO L82 PathProgramCache]: Analyzing trace with hash 660532333, now seen corresponding path program 1 times [2019-09-10 08:28:50,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:50,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:50,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:50,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:50,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:50,767 INFO L134 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:50,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:50,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:50,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:50,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:50,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:50,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:50,769 INFO L87 Difference]: Start difference. First operand 1547 states and 2144 transitions. Second operand 9 states. [2019-09-10 08:28:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:54,777 INFO L93 Difference]: Finished difference Result 2702 states and 3782 transitions. [2019-09-10 08:28:54,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:54,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:28:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:54,781 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:28:54,781 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:28:54,781 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:28:54,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:28:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:28:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2143 transitions. [2019-09-10 08:28:54,797 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2143 transitions. Word has length 117 [2019-09-10 08:28:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:54,797 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2143 transitions. [2019-09-10 08:28:54,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2143 transitions. [2019-09-10 08:28:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:28:54,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:54,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,801 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:54,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:54,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1128950014, now seen corresponding path program 1 times [2019-09-10 08:28:54,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:54,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:54,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:54,983 INFO L134 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:54,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:54,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:54,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:54,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:54,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:54,984 INFO L87 Difference]: Start difference. First operand 1547 states and 2143 transitions. Second operand 9 states. [2019-09-10 08:28:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:58,262 INFO L93 Difference]: Finished difference Result 2565 states and 3529 transitions. [2019-09-10 08:28:58,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:58,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:28:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:58,267 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:28:58,267 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:28:58,268 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:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:28:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:28:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:28:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2142 transitions. [2019-09-10 08:28:58,300 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2142 transitions. Word has length 117 [2019-09-10 08:28:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:58,301 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2142 transitions. [2019-09-10 08:28:58,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2142 transitions. [2019-09-10 08:28:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:28:58,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:58,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,303 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:58,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:58,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1953219296, now seen corresponding path program 1 times [2019-09-10 08:28:58,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:58,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:58,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:58,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:58,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:58,500 INFO L134 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:58,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:58,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:58,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:58,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:58,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:58,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:58,503 INFO L87 Difference]: Start difference. First operand 1547 states and 2142 transitions. Second operand 9 states. [2019-09-10 08:29:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:01,718 INFO L93 Difference]: Finished difference Result 2565 states and 3528 transitions. [2019-09-10 08:29:01,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:01,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:01,722 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:29:01,722 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:29:01,724 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:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:29:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:29:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2141 transitions. [2019-09-10 08:29:01,739 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2141 transitions. Word has length 117 [2019-09-10 08:29:01,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:01,740 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2141 transitions. [2019-09-10 08:29:01,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:01,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2141 transitions. [2019-09-10 08:29:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:01,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:01,742 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:01,742 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:01,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:01,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1953242557, now seen corresponding path program 1 times [2019-09-10 08:29:01,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:01,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:01,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:01,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:01,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:01,940 INFO L134 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:01,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:01,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:01,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:01,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:01,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:01,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:01,942 INFO L87 Difference]: Start difference. First operand 1547 states and 2141 transitions. Second operand 9 states. [2019-09-10 08:29:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:06,101 INFO L93 Difference]: Finished difference Result 2702 states and 3779 transitions. [2019-09-10 08:29:06,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:06,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:06,105 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:29:06,105 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:29:06,106 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:29:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:29:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:29:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2140 transitions. [2019-09-10 08:29:06,122 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2140 transitions. Word has length 117 [2019-09-10 08:29:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:06,122 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2140 transitions. [2019-09-10 08:29:06,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2140 transitions. [2019-09-10 08:29:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:06,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:06,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] [2019-09-10 08:29:06,124 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:06,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:06,124 INFO L82 PathProgramCache]: Analyzing trace with hash -702884691, now seen corresponding path program 1 times [2019-09-10 08:29:06,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:06,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:06,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:06,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:06,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:06,324 INFO L134 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:06,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:06,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:06,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:06,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:06,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:06,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:06,326 INFO L87 Difference]: Start difference. First operand 1547 states and 2140 transitions. Second operand 9 states. [2019-09-10 08:29:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:09,615 INFO L93 Difference]: Finished difference Result 2565 states and 3525 transitions. [2019-09-10 08:29:09,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:09,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:09,619 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:29:09,619 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:29:09,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:29:09,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:29:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:29:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2139 transitions. [2019-09-10 08:29:09,636 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2139 transitions. Word has length 117 [2019-09-10 08:29:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:09,636 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2139 transitions. [2019-09-10 08:29:09,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2139 transitions. [2019-09-10 08:29:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:09,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:09,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,638 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:09,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:09,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1258245524, now seen corresponding path program 1 times [2019-09-10 08:29:09,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:09,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:09,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:09,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:09,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:09,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:29:09,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:09,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:09,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:09,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:09,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:09,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:09,829 INFO L87 Difference]: Start difference. First operand 1547 states and 2139 transitions. Second operand 9 states. [2019-09-10 08:29:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:13,919 INFO L93 Difference]: Finished difference Result 2702 states and 3776 transitions. [2019-09-10 08:29:13,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:13,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:13,923 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:29:13,924 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:29:13,925 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:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:29:13,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:29:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2138 transitions. [2019-09-10 08:29:13,942 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2138 transitions. Word has length 117 [2019-09-10 08:29:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:13,942 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2138 transitions. [2019-09-10 08:29:13,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2138 transitions. [2019-09-10 08:29:13,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:13,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:13,943 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,944 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:13,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:13,944 INFO L82 PathProgramCache]: Analyzing trace with hash -710363507, now seen corresponding path program 1 times [2019-09-10 08:29:13,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:13,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:13,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:13,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:13,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:14,136 INFO L134 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,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:14,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:14,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:14,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:14,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:14,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:14,137 INFO L87 Difference]: Start difference. First operand 1547 states and 2138 transitions. Second operand 9 states. [2019-09-10 08:29:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:17,349 INFO L93 Difference]: Finished difference Result 2565 states and 3522 transitions. [2019-09-10 08:29:17,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:17,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:17,353 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:29:17,353 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:29:17,354 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:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:29:17,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:29:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2137 transitions. [2019-09-10 08:29:17,375 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2137 transitions. Word has length 117 [2019-09-10 08:29:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:17,375 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2137 transitions. [2019-09-10 08:29:17,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2137 transitions. [2019-09-10 08:29:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:17,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:17,377 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,377 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash -890195728, now seen corresponding path program 1 times [2019-09-10 08:29:17,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:17,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:17,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:17,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:17,551 INFO L134 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:17,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:17,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:17,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:17,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:17,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:17,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:17,553 INFO L87 Difference]: Start difference. First operand 1547 states and 2137 transitions. Second operand 9 states. [2019-09-10 08:29:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:21,788 INFO L93 Difference]: Finished difference Result 2702 states and 3772 transitions. [2019-09-10 08:29:21,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:21,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:21,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:21,792 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:29:21,792 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:29:21,792 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:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:29:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:29:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2136 transitions. [2019-09-10 08:29:21,807 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2136 transitions. Word has length 117 [2019-09-10 08:29:21,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:21,807 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2136 transitions. [2019-09-10 08:29:21,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2136 transitions. [2019-09-10 08:29:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:21,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:21,810 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,810 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:21,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:21,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2092278123, now seen corresponding path program 1 times [2019-09-10 08:29:21,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:21,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:21,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:21,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:21,974 INFO L134 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,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:21,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:21,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:21,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:21,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:21,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:21,975 INFO L87 Difference]: Start difference. First operand 1547 states and 2136 transitions. Second operand 9 states. [2019-09-10 08:29:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:25,722 INFO L93 Difference]: Finished difference Result 2654 states and 3680 transitions. [2019-09-10 08:29:25,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:25,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:25,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:25,726 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:29:25,726 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:29:25,726 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:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:29:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:29:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2134 transitions. [2019-09-10 08:29:25,741 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2134 transitions. Word has length 117 [2019-09-10 08:29:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:25,741 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2134 transitions. [2019-09-10 08:29:25,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2134 transitions. [2019-09-10 08:29:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:25,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:25,742 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:25,742 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:25,743 INFO L82 PathProgramCache]: Analyzing trace with hash 563825864, now seen corresponding path program 1 times [2019-09-10 08:29:25,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:25,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:25,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:25,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:25,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:25,977 INFO L134 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,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:25,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:25,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:25,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:25,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:25,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:25,979 INFO L87 Difference]: Start difference. First operand 1547 states and 2134 transitions. Second operand 9 states. [2019-09-10 08:29:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:29,129 INFO L93 Difference]: Finished difference Result 2565 states and 3517 transitions. [2019-09-10 08:29:29,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:29,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:29,132 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:29:29,133 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:29:29,133 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:29:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:29:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:29:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2132 transitions. [2019-09-10 08:29:29,147 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2132 transitions. Word has length 117 [2019-09-10 08:29:29,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:29,147 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2132 transitions. [2019-09-10 08:29:29,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:29,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2132 transitions. [2019-09-10 08:29:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:29,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:29,149 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,149 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:29,149 INFO L82 PathProgramCache]: Analyzing trace with hash -926447500, now seen corresponding path program 1 times [2019-09-10 08:29:29,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:29,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:29,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:29,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:29,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:29,302 INFO L134 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,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:29,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:29,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:29,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:29,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:29,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:29,303 INFO L87 Difference]: Start difference. First operand 1547 states and 2132 transitions. Second operand 9 states. [2019-09-10 08:29:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:33,449 INFO L93 Difference]: Finished difference Result 2702 states and 3766 transitions. [2019-09-10 08:29:33,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:33,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:33,453 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:29:33,453 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:29:33,454 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:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:29:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:29:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2130 transitions. [2019-09-10 08:29:33,476 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2130 transitions. Word has length 117 [2019-09-10 08:29:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:33,476 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2130 transitions. [2019-09-10 08:29:33,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2130 transitions. [2019-09-10 08:29:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:33,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:33,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] [2019-09-10 08:29:33,479 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:33,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:33,479 INFO L82 PathProgramCache]: Analyzing trace with hash -231450467, now seen corresponding path program 1 times [2019-09-10 08:29:33,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:33,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:33,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:33,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:33,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:33,629 INFO L134 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:33,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:33,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:33,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:33,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:33,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:33,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:33,630 INFO L87 Difference]: Start difference. First operand 1547 states and 2130 transitions. Second operand 9 states. [2019-09-10 08:29:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:37,605 INFO L93 Difference]: Finished difference Result 2702 states and 3762 transitions. [2019-09-10 08:29:37,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:37,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:37,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:37,608 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:29:37,608 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:29:37,608 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:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:29:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:29:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2128 transitions. [2019-09-10 08:29:37,623 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2128 transitions. Word has length 117 [2019-09-10 08:29:37,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:37,623 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2128 transitions. [2019-09-10 08:29:37,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2128 transitions. [2019-09-10 08:29:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:37,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:37,625 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,625 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:37,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:37,625 INFO L82 PathProgramCache]: Analyzing trace with hash 316431550, now seen corresponding path program 1 times [2019-09-10 08:29:37,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:37,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:37,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:37,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:37,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:37,795 INFO L134 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:37,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:37,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:37,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:37,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:37,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:37,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:37,796 INFO L87 Difference]: Start difference. First operand 1547 states and 2128 transitions. Second operand 9 states. [2019-09-10 08:29:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:41,002 INFO L93 Difference]: Finished difference Result 2565 states and 3509 transitions. [2019-09-10 08:29:41,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:41,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:41,006 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:29:41,006 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:29:41,006 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:29:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:29:41,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:29:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2126 transitions. [2019-09-10 08:29:41,023 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2126 transitions. Word has length 117 [2019-09-10 08:29:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:41,023 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2126 transitions. [2019-09-10 08:29:41,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2126 transitions. [2019-09-10 08:29:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:41,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:41,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,025 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:41,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:41,026 INFO L82 PathProgramCache]: Analyzing trace with hash 932485886, now seen corresponding path program 1 times [2019-09-10 08:29:41,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:41,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:41,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:41,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:41,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:29:41,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:41,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:41,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:41,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:41,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:41,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:41,184 INFO L87 Difference]: Start difference. First operand 1547 states and 2126 transitions. Second operand 9 states. [2019-09-10 08:29:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:45,152 INFO L93 Difference]: Finished difference Result 2702 states and 3756 transitions. [2019-09-10 08:29:45,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:45,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:45,156 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:29:45,157 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:29:45,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:29:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:29:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2124 transitions. [2019-09-10 08:29:45,196 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2124 transitions. Word has length 117 [2019-09-10 08:29:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:45,197 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2124 transitions. [2019-09-10 08:29:45,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2124 transitions. [2019-09-10 08:29:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:45,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:45,199 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,199 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:45,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:45,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1480367903, now seen corresponding path program 1 times [2019-09-10 08:29:45,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:45,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:45,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:45,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:45,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:45,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:45,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:45,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:45,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:45,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:45,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:45,359 INFO L87 Difference]: Start difference. First operand 1547 states and 2124 transitions. Second operand 9 states. [2019-09-10 08:29:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:48,554 INFO L93 Difference]: Finished difference Result 2565 states and 3503 transitions. [2019-09-10 08:29:48,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:48,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:48,558 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:29:48,558 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:29:48,559 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:29:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:29:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:29:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2122 transitions. [2019-09-10 08:29:48,574 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2122 transitions. Word has length 117 [2019-09-10 08:29:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:48,574 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2122 transitions. [2019-09-10 08:29:48,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2122 transitions. [2019-09-10 08:29:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:48,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:48,575 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:48,576 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:48,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:48,576 INFO L82 PathProgramCache]: Analyzing trace with hash 622719947, now seen corresponding path program 1 times [2019-09-10 08:29:48,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:48,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:48,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:48,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:48,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:48,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:48,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:48,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:48,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:48,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:48,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:48,731 INFO L87 Difference]: Start difference. First operand 1547 states and 2122 transitions. Second operand 9 states. [2019-09-10 08:29:51,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:51,945 INFO L93 Difference]: Finished difference Result 2565 states and 3499 transitions. [2019-09-10 08:29:51,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:51,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:51,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:51,949 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:29:51,950 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:29:51,950 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:29:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:29:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:29:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2120 transitions. [2019-09-10 08:29:51,978 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2120 transitions. Word has length 117 [2019-09-10 08:29:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:51,978 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2120 transitions. [2019-09-10 08:29:51,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2120 transitions. [2019-09-10 08:29:51,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:51,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:51,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, 1] [2019-09-10 08:29:51,981 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:51,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:51,981 INFO L82 PathProgramCache]: Analyzing trace with hash -727299018, now seen corresponding path program 1 times [2019-09-10 08:29:51,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:51,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:51,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:51,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:51,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:52,217 INFO L134 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,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:52,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:52,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:52,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:52,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:52,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:52,219 INFO L87 Difference]: Start difference. First operand 1547 states and 2120 transitions. Second operand 9 states. [2019-09-10 08:29:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:55,390 INFO L93 Difference]: Finished difference Result 2565 states and 3497 transitions. [2019-09-10 08:29:55,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:55,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:55,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:55,394 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:29:55,394 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:29:55,394 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:29:55,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:29:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:29:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2118 transitions. [2019-09-10 08:29:55,409 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2118 transitions. Word has length 117 [2019-09-10 08:29:55,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:55,409 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2118 transitions. [2019-09-10 08:29:55,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2118 transitions. [2019-09-10 08:29:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:55,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:55,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:55,410 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:55,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:55,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1112347179, now seen corresponding path program 1 times [2019-09-10 08:29:55,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:55,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:55,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:55,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:55,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:55,562 INFO L134 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,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:55,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:55,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:55,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:55,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:55,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:55,563 INFO L87 Difference]: Start difference. First operand 1547 states and 2118 transitions. Second operand 9 states. [2019-09-10 08:29:59,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:59,642 INFO L93 Difference]: Finished difference Result 2702 states and 3742 transitions. [2019-09-10 08:29:59,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:59,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:29:59,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:59,646 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:29:59,646 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:29:59,647 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:29:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:29:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:29:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:29:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2116 transitions. [2019-09-10 08:29:59,662 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2116 transitions. Word has length 117 [2019-09-10 08:29:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:59,662 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2116 transitions. [2019-09-10 08:29:59,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2116 transitions. [2019-09-10 08:29:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:29:59,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:59,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,664 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:59,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1676459703, now seen corresponding path program 1 times [2019-09-10 08:29:59,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:59,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:59,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:59,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:59,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:59,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:29:59,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:59,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:59,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:59,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:59,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:59,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:59,846 INFO L87 Difference]: Start difference. First operand 1547 states and 2116 transitions. Second operand 9 states. [2019-09-10 08:30:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:03,887 INFO L93 Difference]: Finished difference Result 2702 states and 3738 transitions. [2019-09-10 08:30:03,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:03,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:30:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:03,890 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:30:03,890 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:30:03,890 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:30:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:30:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:30:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2114 transitions. [2019-09-10 08:30:03,905 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2114 transitions. Word has length 117 [2019-09-10 08:30:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:03,905 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2114 transitions. [2019-09-10 08:30:03,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2114 transitions. [2019-09-10 08:30:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:30:03,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:03,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,907 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1805910448, now seen corresponding path program 1 times [2019-09-10 08:30:03,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:03,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:03,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:03,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:03,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:04,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:30:04,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:04,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:04,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:04,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:04,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:04,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:04,094 INFO L87 Difference]: Start difference. First operand 1547 states and 2114 transitions. Second operand 9 states. [2019-09-10 08:30:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:07,429 INFO L93 Difference]: Finished difference Result 2565 states and 3489 transitions. [2019-09-10 08:30:07,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:07,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:30:07,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:07,433 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:30:07,434 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:30:07,434 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:30:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:30:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:30:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2112 transitions. [2019-09-10 08:30:07,450 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2112 transitions. Word has length 117 [2019-09-10 08:30:07,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:07,451 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2112 transitions. [2019-09-10 08:30:07,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:07,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2112 transitions. [2019-09-10 08:30:07,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:30:07,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:07,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,452 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:07,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:07,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1577200297, now seen corresponding path program 1 times [2019-09-10 08:30:07,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:07,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:07,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:07,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:07,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:07,646 INFO L134 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:07,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:07,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:07,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:07,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:07,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:07,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:07,648 INFO L87 Difference]: Start difference. First operand 1547 states and 2112 transitions. Second operand 9 states. [2019-09-10 08:30:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:10,801 INFO L93 Difference]: Finished difference Result 2565 states and 3487 transitions. [2019-09-10 08:30:10,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:10,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:30:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:10,805 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:30:10,806 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:30:10,806 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:30:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:30:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:30:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2110 transitions. [2019-09-10 08:30:10,825 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2110 transitions. Word has length 117 [2019-09-10 08:30:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:10,825 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2110 transitions. [2019-09-10 08:30:10,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2110 transitions. [2019-09-10 08:30:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:30:10,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:10,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] [2019-09-10 08:30:10,827 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash -720968115, now seen corresponding path program 1 times [2019-09-10 08:30:10,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:10,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:10,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:10,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:10,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:11,026 INFO L134 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,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:11,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:11,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:11,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:11,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:11,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:11,027 INFO L87 Difference]: Start difference. First operand 1547 states and 2110 transitions. Second operand 9 states. [2019-09-10 08:30:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:14,459 INFO L93 Difference]: Finished difference Result 2702 states and 3730 transitions. [2019-09-10 08:30:14,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:14,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:30:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:14,463 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:30:14,463 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:30:14,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:30:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:30:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:30:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2108 transitions. [2019-09-10 08:30:14,495 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2108 transitions. Word has length 117 [2019-09-10 08:30:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:14,495 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2108 transitions. [2019-09-10 08:30:14,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2108 transitions. [2019-09-10 08:30:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:30:14,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:14,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,498 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:14,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:14,498 INFO L82 PathProgramCache]: Analyzing trace with hash -251279394, now seen corresponding path program 1 times [2019-09-10 08:30:14,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:14,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:14,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:14,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:14,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:14,661 INFO L134 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:14,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:14,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:14,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:14,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:14,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:14,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:14,662 INFO L87 Difference]: Start difference. First operand 1547 states and 2108 transitions. Second operand 9 states. [2019-09-10 08:30:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:18,140 INFO L93 Difference]: Finished difference Result 2654 states and 3646 transitions. [2019-09-10 08:30:18,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:18,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:30:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:18,144 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:30:18,144 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:30:18,144 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:30:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:30:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:30:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2106 transitions. [2019-09-10 08:30:18,161 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2106 transitions. Word has length 117 [2019-09-10 08:30:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:18,162 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2106 transitions. [2019-09-10 08:30:18,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2106 transitions. [2019-09-10 08:30:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:30:18,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:18,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,164 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:18,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:18,164 INFO L82 PathProgramCache]: Analyzing trace with hash 684760065, now seen corresponding path program 1 times [2019-09-10 08:30:18,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:18,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:18,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:18,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:18,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:18,302 INFO L134 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:18,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:18,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:18,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:18,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:18,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:18,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:18,303 INFO L87 Difference]: Start difference. First operand 1547 states and 2106 transitions. Second operand 9 states. [2019-09-10 08:30:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:22,321 INFO L93 Difference]: Finished difference Result 2702 states and 3726 transitions. [2019-09-10 08:30:22,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:22,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:30:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:22,325 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:30:22,325 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:30:22,325 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:30:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:30:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:30:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:22,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2104 transitions. [2019-09-10 08:30:22,339 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2104 transitions. Word has length 117 [2019-09-10 08:30:22,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:22,340 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2104 transitions. [2019-09-10 08:30:22,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2104 transitions. [2019-09-10 08:30:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:30:22,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:22,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,341 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:22,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1075645348, now seen corresponding path program 1 times [2019-09-10 08:30:22,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:22,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:22,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:22,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:22,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:22,483 INFO L134 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:22,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:22,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:22,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:22,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:22,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:22,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:22,484 INFO L87 Difference]: Start difference. First operand 1547 states and 2104 transitions. Second operand 9 states. [2019-09-10 08:30:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:25,650 INFO L93 Difference]: Finished difference Result 2565 states and 3479 transitions. [2019-09-10 08:30:25,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:25,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:30:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:25,654 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:30:25,654 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:30:25,654 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:30:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:30:25,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:30:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2102 transitions. [2019-09-10 08:30:25,671 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2102 transitions. Word has length 117 [2019-09-10 08:30:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:25,671 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2102 transitions. [2019-09-10 08:30:25,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2102 transitions. [2019-09-10 08:30:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:30:25,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:25,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,672 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:25,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:25,673 INFO L82 PathProgramCache]: Analyzing trace with hash 853511164, now seen corresponding path program 1 times [2019-09-10 08:30:25,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:25,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:25,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:25,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:25,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:25,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:25,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:25,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:25,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:25,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:25,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:25,815 INFO L87 Difference]: Start difference. First operand 1547 states and 2102 transitions. Second operand 9 states. [2019-09-10 08:30:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:29,936 INFO L93 Difference]: Finished difference Result 2726 states and 3754 transitions. [2019-09-10 08:30:29,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:29,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:30:29,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:29,939 INFO L225 Difference]: With dead ends: 2726 [2019-09-10 08:30:29,939 INFO L226 Difference]: Without dead ends: 2726 [2019-09-10 08:30:29,939 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:30:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-10 08:30:29,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-10 08:30:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2100 transitions. [2019-09-10 08:30:29,953 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2100 transitions. Word has length 117 [2019-09-10 08:30:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:29,953 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2100 transitions. [2019-09-10 08:30:29,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2100 transitions. [2019-09-10 08:30:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:30:29,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:29,954 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,955 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:29,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2069747753, now seen corresponding path program 1 times [2019-09-10 08:30:29,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:29,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:29,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:29,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:29,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:30,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:30,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:30,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:30,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:30,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:30,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:30,112 INFO L87 Difference]: Start difference. First operand 1547 states and 2100 transitions. Second operand 9 states. [2019-09-10 08:30:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:33,404 INFO L93 Difference]: Finished difference Result 2565 states and 3475 transitions. [2019-09-10 08:30:33,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:33,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:30:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:33,407 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:30:33,408 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:30:33,408 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:30:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:30:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:30:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2099 transitions. [2019-09-10 08:30:33,422 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2099 transitions. Word has length 118 [2019-09-10 08:30:33,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:33,422 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2099 transitions. [2019-09-10 08:30:33,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2099 transitions. [2019-09-10 08:30:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:30:33,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:33,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,424 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:33,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:33,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1826974247, now seen corresponding path program 1 times [2019-09-10 08:30:33,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:33,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:33,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:33,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:33,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:33,568 INFO L134 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,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:33,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:33,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:33,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:33,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:33,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:33,569 INFO L87 Difference]: Start difference. First operand 1547 states and 2099 transitions. Second operand 9 states. [2019-09-10 08:30:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:36,706 INFO L93 Difference]: Finished difference Result 2565 states and 3474 transitions. [2019-09-10 08:30:36,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:36,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:30:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:36,710 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:30:36,710 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:30:36,710 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:30:36,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:30:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:30:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2098 transitions. [2019-09-10 08:30:36,728 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2098 transitions. Word has length 118 [2019-09-10 08:30:36,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:36,728 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2098 transitions. [2019-09-10 08:30:36,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2098 transitions. [2019-09-10 08:30:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:30:36,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:36,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,731 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:36,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:36,731 INFO L82 PathProgramCache]: Analyzing trace with hash -9829887, now seen corresponding path program 1 times [2019-09-10 08:30:36,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:36,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:36,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:36,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:36,881 INFO L134 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:36,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:36,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:36,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:36,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:36,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:36,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:36,882 INFO L87 Difference]: Start difference. First operand 1547 states and 2098 transitions. Second operand 9 states. [2019-09-10 08:30:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:40,833 INFO L93 Difference]: Finished difference Result 2702 states and 3717 transitions. [2019-09-10 08:30:40,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:40,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:30:40,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:40,837 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:30:40,837 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:30:40,838 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:30:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:30:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:30:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2097 transitions. [2019-09-10 08:30:40,853 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2097 transitions. Word has length 118 [2019-09-10 08:30:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:40,853 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2097 transitions. [2019-09-10 08:30:40,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2097 transitions. [2019-09-10 08:30:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:30:40,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:40,854 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,855 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash 2266734, now seen corresponding path program 1 times [2019-09-10 08:30:40,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:40,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:40,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:40,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:30:40,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:40,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:40,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:40,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:40,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:40,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:40,992 INFO L87 Difference]: Start difference. First operand 1547 states and 2097 transitions. Second operand 9 states. [2019-09-10 08:30:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:44,935 INFO L93 Difference]: Finished difference Result 2654 states and 3635 transitions. [2019-09-10 08:30:44,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:44,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:30:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:44,939 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:30:44,939 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:30:44,940 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:30:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:30:44,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:30:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2096 transitions. [2019-09-10 08:30:44,954 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2096 transitions. Word has length 118 [2019-09-10 08:30:44,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:44,955 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2096 transitions. [2019-09-10 08:30:44,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2096 transitions. [2019-09-10 08:30:44,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:30:44,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:44,956 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,956 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:44,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:44,957 INFO L82 PathProgramCache]: Analyzing trace with hash -307637134, now seen corresponding path program 1 times [2019-09-10 08:30:44,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:44,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:44,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:44,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:44,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:45,094 INFO L134 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:45,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:45,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:45,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:45,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:45,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:45,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:45,095 INFO L87 Difference]: Start difference. First operand 1547 states and 2096 transitions. Second operand 9 states. [2019-09-10 08:30:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:49,129 INFO L93 Difference]: Finished difference Result 2654 states and 3634 transitions. [2019-09-10 08:30:49,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:49,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:30:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:49,133 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:30:49,133 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:30:49,134 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:30:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:30:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:30:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2095 transitions. [2019-09-10 08:30:49,148 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2095 transitions. Word has length 119 [2019-09-10 08:30:49,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:49,148 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2095 transitions. [2019-09-10 08:30:49,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:49,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2095 transitions. [2019-09-10 08:30:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:30:49,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:49,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,150 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:49,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:49,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1739299215, now seen corresponding path program 1 times [2019-09-10 08:30:49,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:49,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:49,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:49,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:49,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:49,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:49,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:49,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:49,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:49,308 INFO L87 Difference]: Start difference. First operand 1547 states and 2095 transitions. Second operand 9 states. [2019-09-10 08:30:53,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:53,441 INFO L93 Difference]: Finished difference Result 2654 states and 3632 transitions. [2019-09-10 08:30:53,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:53,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:30:53,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:53,445 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:30:53,445 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:30:53,446 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:30:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:30:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:30:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2094 transitions. [2019-09-10 08:30:53,461 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2094 transitions. Word has length 119 [2019-09-10 08:30:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:53,461 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2094 transitions. [2019-09-10 08:30:53,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2094 transitions. [2019-09-10 08:30:53,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:30:53,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:53,463 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,463 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:53,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:53,463 INFO L82 PathProgramCache]: Analyzing trace with hash -479612977, now seen corresponding path program 1 times [2019-09-10 08:30:53,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:53,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:53,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:53,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:53,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:30:53,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:53,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:53,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:53,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:53,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:53,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:53,607 INFO L87 Difference]: Start difference. First operand 1547 states and 2094 transitions. Second operand 9 states. [2019-09-10 08:30:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:57,729 INFO L93 Difference]: Finished difference Result 2654 states and 3630 transitions. [2019-09-10 08:30:57,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:57,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:30:57,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:57,733 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:30:57,733 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:30:57,733 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:30:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:30:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:30:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:30:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2093 transitions. [2019-09-10 08:30:57,747 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2093 transitions. Word has length 119 [2019-09-10 08:30:57,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:57,747 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2093 transitions. [2019-09-10 08:30:57,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2093 transitions. [2019-09-10 08:30:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:30:57,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:57,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] [2019-09-10 08:30:57,749 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:57,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2111700990, now seen corresponding path program 1 times [2019-09-10 08:30:57,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:57,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:57,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:57,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:57,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:57,898 INFO L134 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:57,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:57,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:57,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:57,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:57,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:57,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:57,900 INFO L87 Difference]: Start difference. First operand 1547 states and 2093 transitions. Second operand 9 states. [2019-09-10 08:31:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:01,243 INFO L93 Difference]: Finished difference Result 2565 states and 3468 transitions. [2019-09-10 08:31:01,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:01,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:01,247 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:31:01,247 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:31:01,247 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:31:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:31:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:31:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2092 transitions. [2019-09-10 08:31:01,268 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2092 transitions. Word has length 119 [2019-09-10 08:31:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:01,268 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2092 transitions. [2019-09-10 08:31:01,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2092 transitions. [2019-09-10 08:31:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:01,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:01,270 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,271 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:01,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:01,271 INFO L82 PathProgramCache]: Analyzing trace with hash -185305612, now seen corresponding path program 1 times [2019-09-10 08:31:01,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:01,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:01,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:01,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:01,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:01,464 INFO L134 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:01,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:01,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:01,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:01,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:01,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:01,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:01,465 INFO L87 Difference]: Start difference. First operand 1547 states and 2092 transitions. Second operand 9 states. [2019-09-10 08:31:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:05,605 INFO L93 Difference]: Finished difference Result 2654 states and 3628 transitions. [2019-09-10 08:31:05,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:05,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:05,609 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:31:05,609 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:31:05,609 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:31:05,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:31:05,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:31:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2091 transitions. [2019-09-10 08:31:05,624 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2091 transitions. Word has length 119 [2019-09-10 08:31:05,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:05,625 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2091 transitions. [2019-09-10 08:31:05,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:05,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2091 transitions. [2019-09-10 08:31:05,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:05,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:05,626 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,626 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:05,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:05,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1216698774, now seen corresponding path program 1 times [2019-09-10 08:31:05,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:05,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:05,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:05,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:05,784 INFO L134 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:05,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:05,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:05,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:05,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:05,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:05,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:05,785 INFO L87 Difference]: Start difference. First operand 1547 states and 2091 transitions. Second operand 9 states. [2019-09-10 08:31:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:09,787 INFO L93 Difference]: Finished difference Result 2654 states and 3626 transitions. [2019-09-10 08:31:09,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:09,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:09,791 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:31:09,791 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:31:09,791 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:31:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:31:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:31:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2090 transitions. [2019-09-10 08:31:09,805 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2090 transitions. Word has length 119 [2019-09-10 08:31:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:09,805 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2090 transitions. [2019-09-10 08:31:09,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2090 transitions. [2019-09-10 08:31:09,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:09,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:09,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,807 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:09,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:09,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1149112010, now seen corresponding path program 1 times [2019-09-10 08:31:09,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:09,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:09,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:09,966 INFO L134 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:09,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:09,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:09,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:09,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:09,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:09,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:09,967 INFO L87 Difference]: Start difference. First operand 1547 states and 2090 transitions. Second operand 9 states. [2019-09-10 08:31:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:13,265 INFO L93 Difference]: Finished difference Result 2565 states and 3465 transitions. [2019-09-10 08:31:13,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:13,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:13,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:13,268 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:31:13,269 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:31:13,269 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:31:13,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:31:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:31:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2089 transitions. [2019-09-10 08:31:13,283 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2089 transitions. Word has length 119 [2019-09-10 08:31:13,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:13,283 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2089 transitions. [2019-09-10 08:31:13,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2089 transitions. [2019-09-10 08:31:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:13,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:13,286 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,286 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:13,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:13,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1690348864, now seen corresponding path program 1 times [2019-09-10 08:31:13,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:13,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:13,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:13,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:13,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:13,457 INFO L134 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:13,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:13,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:13,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:13,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:13,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:13,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:13,459 INFO L87 Difference]: Start difference. First operand 1547 states and 2089 transitions. Second operand 9 states. [2019-09-10 08:31:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:17,626 INFO L93 Difference]: Finished difference Result 2654 states and 3622 transitions. [2019-09-10 08:31:17,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:17,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:17,630 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:31:17,630 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:31:17,631 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:31:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:31:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:31:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2088 transitions. [2019-09-10 08:31:17,649 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2088 transitions. Word has length 119 [2019-09-10 08:31:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:17,649 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2088 transitions. [2019-09-10 08:31:17,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2088 transitions. [2019-09-10 08:31:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:17,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:17,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, 1] [2019-09-10 08:31:17,651 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:17,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:17,651 INFO L82 PathProgramCache]: Analyzing trace with hash 557885648, now seen corresponding path program 1 times [2019-09-10 08:31:17,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:17,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:17,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:17,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:17,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:17,857 INFO L134 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:17,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:17,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:17,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:17,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:17,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:17,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:17,859 INFO L87 Difference]: Start difference. First operand 1547 states and 2088 transitions. Second operand 9 states. [2019-09-10 08:31:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:21,961 INFO L93 Difference]: Finished difference Result 2654 states and 3621 transitions. [2019-09-10 08:31:21,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:21,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:21,965 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:31:21,966 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:31:21,966 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:31:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:31:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:31:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2087 transitions. [2019-09-10 08:31:21,981 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2087 transitions. Word has length 119 [2019-09-10 08:31:21,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:21,982 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2087 transitions. [2019-09-10 08:31:21,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2087 transitions. [2019-09-10 08:31:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:21,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:21,983 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,983 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:21,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:21,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1906294309, now seen corresponding path program 1 times [2019-09-10 08:31:21,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:21,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:21,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:21,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:21,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:22,160 INFO L134 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:22,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:22,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:22,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:22,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:22,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:22,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:22,161 INFO L87 Difference]: Start difference. First operand 1547 states and 2087 transitions. Second operand 9 states. [2019-09-10 08:31:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:26,356 INFO L93 Difference]: Finished difference Result 2654 states and 3619 transitions. [2019-09-10 08:31:26,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:26,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:26,360 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:31:26,360 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:31:26,361 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:31:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:31:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:31:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2086 transitions. [2019-09-10 08:31:26,376 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2086 transitions. Word has length 119 [2019-09-10 08:31:26,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:26,377 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2086 transitions. [2019-09-10 08:31:26,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:26,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2086 transitions. [2019-09-10 08:31:26,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:26,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:26,378 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,378 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:26,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:26,378 INFO L82 PathProgramCache]: Analyzing trace with hash -350631552, now seen corresponding path program 1 times [2019-09-10 08:31:26,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:26,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:26,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:26,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:26,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:26,521 INFO L134 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:26,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:26,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:26,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:26,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:26,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:26,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:26,522 INFO L87 Difference]: Start difference. First operand 1547 states and 2086 transitions. Second operand 9 states. [2019-09-10 08:31:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:30,215 INFO L93 Difference]: Finished difference Result 2654 states and 3617 transitions. [2019-09-10 08:31:30,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:30,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:30,219 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:31:30,219 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:31:30,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:31:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:31:30,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:31:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2085 transitions. [2019-09-10 08:31:30,233 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2085 transitions. Word has length 119 [2019-09-10 08:31:30,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:30,233 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2085 transitions. [2019-09-10 08:31:30,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2085 transitions. [2019-09-10 08:31:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:30,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:30,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,235 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:30,235 INFO L82 PathProgramCache]: Analyzing trace with hash 454751018, now seen corresponding path program 1 times [2019-09-10 08:31:30,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:30,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:30,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:30,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:30,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:30,390 INFO L134 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:30,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:30,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:30,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:30,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:30,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:30,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:30,391 INFO L87 Difference]: Start difference. First operand 1547 states and 2085 transitions. Second operand 9 states. [2019-09-10 08:31:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:33,717 INFO L93 Difference]: Finished difference Result 2565 states and 3460 transitions. [2019-09-10 08:31:33,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:33,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:33,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:33,720 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:31:33,720 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:31:33,721 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:31:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:31:33,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:31:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2084 transitions. [2019-09-10 08:31:33,736 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2084 transitions. Word has length 119 [2019-09-10 08:31:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:33,737 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2084 transitions. [2019-09-10 08:31:33,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2084 transitions. [2019-09-10 08:31:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:33,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:33,739 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,739 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:33,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:33,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1196293181, now seen corresponding path program 1 times [2019-09-10 08:31:33,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:33,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:33,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:33,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:33,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:33,896 INFO L134 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:33,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:33,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:33,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:33,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:33,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:33,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:33,898 INFO L87 Difference]: Start difference. First operand 1547 states and 2084 transitions. Second operand 9 states. [2019-09-10 08:31:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:37,363 INFO L93 Difference]: Finished difference Result 2565 states and 3459 transitions. [2019-09-10 08:31:37,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:37,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:37,366 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:31:37,366 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:31:37,366 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:31:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:31:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:31:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2083 transitions. [2019-09-10 08:31:37,382 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2083 transitions. Word has length 119 [2019-09-10 08:31:37,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:37,383 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2083 transitions. [2019-09-10 08:31:37,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:37,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2083 transitions. [2019-09-10 08:31:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:37,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:37,385 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,385 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1225535361, now seen corresponding path program 1 times [2019-09-10 08:31:37,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:37,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:37,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:37,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:37,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:37,541 INFO L134 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:37,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:37,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:37,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:37,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:37,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:37,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:37,543 INFO L87 Difference]: Start difference. First operand 1547 states and 2083 transitions. Second operand 9 states. [2019-09-10 08:31:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:41,403 INFO L93 Difference]: Finished difference Result 2654 states and 3613 transitions. [2019-09-10 08:31:41,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:41,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:41,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:41,407 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:31:41,407 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:31:41,407 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:31:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:31:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:31:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2082 transitions. [2019-09-10 08:31:41,421 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2082 transitions. Word has length 119 [2019-09-10 08:31:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:41,421 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2082 transitions. [2019-09-10 08:31:41,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2082 transitions. [2019-09-10 08:31:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:41,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:41,423 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,423 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:41,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:41,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1949868616, now seen corresponding path program 1 times [2019-09-10 08:31:41,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:41,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:41,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:41,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:41,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:41,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:31:41,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:41,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:41,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:41,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:41,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:41,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:41,576 INFO L87 Difference]: Start difference. First operand 1547 states and 2082 transitions. Second operand 9 states. [2019-09-10 08:31:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:45,681 INFO L93 Difference]: Finished difference Result 2654 states and 3611 transitions. [2019-09-10 08:31:45,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:45,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:45,685 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:31:45,685 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:31:45,685 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:31:45,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:31:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:31:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2081 transitions. [2019-09-10 08:31:45,700 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2081 transitions. Word has length 119 [2019-09-10 08:31:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:45,700 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2081 transitions. [2019-09-10 08:31:45,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2081 transitions. [2019-09-10 08:31:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:45,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:45,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,702 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:45,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:45,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1895555022, now seen corresponding path program 1 times [2019-09-10 08:31:45,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:45,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:45,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:45,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:45,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:45,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:31:45,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:45,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:45,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:45,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:45,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:45,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:45,841 INFO L87 Difference]: Start difference. First operand 1547 states and 2081 transitions. Second operand 9 states. [2019-09-10 08:31:49,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:49,592 INFO L93 Difference]: Finished difference Result 2565 states and 3453 transitions. [2019-09-10 08:31:49,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:49,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:49,596 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:31:49,597 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:31:49,597 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:31:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:31:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:31:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2079 transitions. [2019-09-10 08:31:49,612 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2079 transitions. Word has length 119 [2019-09-10 08:31:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:49,613 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2079 transitions. [2019-09-10 08:31:49,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2079 transitions. [2019-09-10 08:31:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:49,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:49,614 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,615 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:49,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:49,615 INFO L82 PathProgramCache]: Analyzing trace with hash 128437484, now seen corresponding path program 1 times [2019-09-10 08:31:49,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:49,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:49,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:49,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:49,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:49,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:31:49,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:49,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:49,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:49,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:49,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:49,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:49,770 INFO L87 Difference]: Start difference. First operand 1547 states and 2079 transitions. Second operand 9 states. [2019-09-10 08:31:53,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:53,801 INFO L93 Difference]: Finished difference Result 2654 states and 3605 transitions. [2019-09-10 08:31:53,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:53,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:53,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:53,804 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:31:53,804 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:31:53,805 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:31:53,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:31:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:31:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2077 transitions. [2019-09-10 08:31:53,819 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2077 transitions. Word has length 119 [2019-09-10 08:31:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:53,819 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2077 transitions. [2019-09-10 08:31:53,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2077 transitions. [2019-09-10 08:31:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:53,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:53,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,820 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:53,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash 814836485, now seen corresponding path program 1 times [2019-09-10 08:31:53,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:53,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:53,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:53,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:53,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:54,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:54,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:54,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:54,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:54,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:54,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:54,009 INFO L87 Difference]: Start difference. First operand 1547 states and 2077 transitions. Second operand 9 states. [2019-09-10 08:31:57,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:57,287 INFO L93 Difference]: Finished difference Result 2565 states and 3449 transitions. [2019-09-10 08:31:57,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:57,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:31:57,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:57,291 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:31:57,291 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:31:57,291 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:31:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:31:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:31:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:31:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2075 transitions. [2019-09-10 08:31:57,307 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2075 transitions. Word has length 119 [2019-09-10 08:31:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:57,307 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2075 transitions. [2019-09-10 08:31:57,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2075 transitions. [2019-09-10 08:31:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:31:57,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:57,308 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,308 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:57,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:57,309 INFO L82 PathProgramCache]: Analyzing trace with hash 809196432, now seen corresponding path program 1 times [2019-09-10 08:31:57,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:57,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:57,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:57,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:57,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:57,447 INFO L134 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:57,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:57,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:57,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:57,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:57,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:57,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:57,448 INFO L87 Difference]: Start difference. First operand 1547 states and 2075 transitions. Second operand 9 states. [2019-09-10 08:32:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:01,478 INFO L93 Difference]: Finished difference Result 2654 states and 3601 transitions. [2019-09-10 08:32:01,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:01,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:01,482 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:32:01,482 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:32:01,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:32:01,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:32:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:32:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2073 transitions. [2019-09-10 08:32:01,495 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2073 transitions. Word has length 119 [2019-09-10 08:32:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:01,495 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2073 transitions. [2019-09-10 08:32:01,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2073 transitions. [2019-09-10 08:32:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:01,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:01,497 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,497 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1684100241, now seen corresponding path program 1 times [2019-09-10 08:32:01,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:01,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:01,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:01,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:01,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:01,652 INFO L134 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:01,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:01,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:01,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:01,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:01,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:01,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:01,653 INFO L87 Difference]: Start difference. First operand 1547 states and 2073 transitions. Second operand 9 states. [2019-09-10 08:32:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:05,495 INFO L93 Difference]: Finished difference Result 2654 states and 3597 transitions. [2019-09-10 08:32:05,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:05,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:05,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:05,498 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:32:05,499 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:32:05,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:32:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:32:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:32:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2071 transitions. [2019-09-10 08:32:05,513 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2071 transitions. Word has length 119 [2019-09-10 08:32:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:05,514 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2071 transitions. [2019-09-10 08:32:05,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2071 transitions. [2019-09-10 08:32:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:05,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:05,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,515 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:05,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:05,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1805484485, now seen corresponding path program 1 times [2019-09-10 08:32:05,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:05,669 INFO L134 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:05,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:05,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:05,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:05,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:05,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:05,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:05,670 INFO L87 Difference]: Start difference. First operand 1547 states and 2071 transitions. Second operand 9 states. [2019-09-10 08:32:09,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:09,046 INFO L93 Difference]: Finished difference Result 2565 states and 3443 transitions. [2019-09-10 08:32:09,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:09,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:09,050 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:32:09,051 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:32:09,051 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:32:09,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:32:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:32:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2069 transitions. [2019-09-10 08:32:09,073 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2069 transitions. Word has length 119 [2019-09-10 08:32:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:09,073 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2069 transitions. [2019-09-10 08:32:09,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2069 transitions. [2019-09-10 08:32:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:09,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:09,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,076 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:09,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:09,076 INFO L82 PathProgramCache]: Analyzing trace with hash -83413030, now seen corresponding path program 1 times [2019-09-10 08:32:09,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:09,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:09,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:09,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:32:09,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:09,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:09,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:09,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:09,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:09,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:09,226 INFO L87 Difference]: Start difference. First operand 1547 states and 2069 transitions. Second operand 9 states. [2019-09-10 08:32:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:12,851 INFO L93 Difference]: Finished difference Result 2565 states and 3441 transitions. [2019-09-10 08:32:12,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:12,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:12,855 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:32:12,856 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:32:12,856 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:32:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:32:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:32:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2067 transitions. [2019-09-10 08:32:12,871 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2067 transitions. Word has length 119 [2019-09-10 08:32:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:12,871 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2067 transitions. [2019-09-10 08:32:12,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2067 transitions. [2019-09-10 08:32:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:12,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:12,872 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,872 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:12,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:12,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1828908239, now seen corresponding path program 1 times [2019-09-10 08:32:12,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:12,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:12,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:12,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:12,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:13,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:13,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:13,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:13,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:13,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:13,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:13,025 INFO L87 Difference]: Start difference. First operand 1547 states and 2067 transitions. Second operand 9 states. [2019-09-10 08:32:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:17,095 INFO L93 Difference]: Finished difference Result 2654 states and 3589 transitions. [2019-09-10 08:32:17,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:17,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:17,100 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:32:17,100 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:32:17,100 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:32:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:32:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:32:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2065 transitions. [2019-09-10 08:32:17,142 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2065 transitions. Word has length 119 [2019-09-10 08:32:17,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:17,142 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2065 transitions. [2019-09-10 08:32:17,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2065 transitions. [2019-09-10 08:32:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:17,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:17,143 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,143 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:17,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:17,144 INFO L82 PathProgramCache]: Analyzing trace with hash -954004430, now seen corresponding path program 1 times [2019-09-10 08:32:17,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:17,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:17,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:17,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:17,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:17,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:17,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:17,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:17,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:17,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:17,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:17,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:17,285 INFO L87 Difference]: Start difference. First operand 1547 states and 2065 transitions. Second operand 9 states. [2019-09-10 08:32:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:20,986 INFO L93 Difference]: Finished difference Result 2654 states and 3585 transitions. [2019-09-10 08:32:20,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:20,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:20,990 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:32:20,991 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:32:20,991 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:32:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:32:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:32:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2063 transitions. [2019-09-10 08:32:21,004 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2063 transitions. Word has length 119 [2019-09-10 08:32:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:21,004 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2063 transitions. [2019-09-10 08:32:21,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2063 transitions. [2019-09-10 08:32:21,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:21,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:21,006 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,006 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:21,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:21,006 INFO L82 PathProgramCache]: Analyzing trace with hash -148621860, now seen corresponding path program 1 times [2019-09-10 08:32:21,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:21,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:21,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:21,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:21,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:21,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:21,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:21,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:21,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:21,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:21,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:21,176 INFO L87 Difference]: Start difference. First operand 1547 states and 2063 transitions. Second operand 9 states. [2019-09-10 08:32:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:24,351 INFO L93 Difference]: Finished difference Result 2565 states and 3435 transitions. [2019-09-10 08:32:24,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:24,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:24,355 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:32:24,356 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:32:24,356 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:32:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:32:24,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:32:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2061 transitions. [2019-09-10 08:32:24,370 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2061 transitions. Word has length 119 [2019-09-10 08:32:24,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:24,370 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2061 transitions. [2019-09-10 08:32:24,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2061 transitions. [2019-09-10 08:32:24,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:24,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:24,372 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,372 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:24,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:24,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1788893969, now seen corresponding path program 1 times [2019-09-10 08:32:24,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:24,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:24,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:24,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:24,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:24,519 INFO L134 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:24,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:24,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:24,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:24,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:24,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:24,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:24,520 INFO L87 Difference]: Start difference. First operand 1547 states and 2061 transitions. Second operand 9 states. [2019-09-10 08:32:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:28,034 INFO L93 Difference]: Finished difference Result 2654 states and 3579 transitions. [2019-09-10 08:32:28,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:28,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:28,037 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:32:28,037 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:32:28,038 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:32:28,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:32:28,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:32:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2059 transitions. [2019-09-10 08:32:28,051 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2059 transitions. Word has length 119 [2019-09-10 08:32:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:28,051 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2059 transitions. [2019-09-10 08:32:28,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2059 transitions. [2019-09-10 08:32:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:28,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:28,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] [2019-09-10 08:32:28,053 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:28,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:28,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1700690757, now seen corresponding path program 1 times [2019-09-10 08:32:28,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:28,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:28,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:28,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:28,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:28,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:28,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:28,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:28,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:28,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:28,190 INFO L87 Difference]: Start difference. First operand 1547 states and 2059 transitions. Second operand 9 states. [2019-09-10 08:32:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:31,317 INFO L93 Difference]: Finished difference Result 2565 states and 3431 transitions. [2019-09-10 08:32:31,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:31,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:31,321 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:32:31,321 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:32:31,322 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:32:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:32:31,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:32:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2057 transitions. [2019-09-10 08:32:31,335 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2057 transitions. Word has length 119 [2019-09-10 08:32:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:31,336 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2057 transitions. [2019-09-10 08:32:31,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2057 transitions. [2019-09-10 08:32:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:31,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:31,337 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,337 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:31,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:31,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1121715269, now seen corresponding path program 1 times [2019-09-10 08:32:31,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:31,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:31,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:31,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:31,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:31,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:31,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:31,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:31,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:31,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:31,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:31,539 INFO L87 Difference]: Start difference. First operand 1547 states and 2057 transitions. Second operand 9 states. [2019-09-10 08:32:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:35,478 INFO L93 Difference]: Finished difference Result 2654 states and 3573 transitions. [2019-09-10 08:32:35,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:35,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:35,481 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:32:35,482 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:32:35,482 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:32:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:32:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:32:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2055 transitions. [2019-09-10 08:32:35,498 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2055 transitions. Word has length 119 [2019-09-10 08:32:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:35,498 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2055 transitions. [2019-09-10 08:32:35,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2055 transitions. [2019-09-10 08:32:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:35,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:35,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,500 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:35,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1635895006, now seen corresponding path program 1 times [2019-09-10 08:32:35,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:35,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:35,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:35,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:35,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:35,647 INFO L134 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:35,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:35,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:35,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:35,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:35,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:35,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:35,649 INFO L87 Difference]: Start difference. First operand 1547 states and 2055 transitions. Second operand 9 states. [2019-09-10 08:32:39,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:39,066 INFO L93 Difference]: Finished difference Result 2565 states and 3427 transitions. [2019-09-10 08:32:39,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:39,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:39,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:39,070 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:32:39,070 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:32:39,070 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:32:39,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:32:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:32:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2053 transitions. [2019-09-10 08:32:39,091 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2053 transitions. Word has length 119 [2019-09-10 08:32:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:39,092 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2053 transitions. [2019-09-10 08:32:39,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2053 transitions. [2019-09-10 08:32:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:39,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:39,094 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,094 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:39,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:39,095 INFO L82 PathProgramCache]: Analyzing trace with hash -662382636, now seen corresponding path program 1 times [2019-09-10 08:32:39,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:39,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:39,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:39,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:39,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:39,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:39,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:39,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:39,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:39,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:39,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:39,255 INFO L87 Difference]: Start difference. First operand 1547 states and 2053 transitions. Second operand 9 states. [2019-09-10 08:32:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:43,289 INFO L93 Difference]: Finished difference Result 2654 states and 3569 transitions. [2019-09-10 08:32:43,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:43,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:43,293 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:32:43,293 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:32:43,293 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:32:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:32:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:32:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2051 transitions. [2019-09-10 08:32:43,309 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2051 transitions. Word has length 119 [2019-09-10 08:32:43,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:43,309 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2051 transitions. [2019-09-10 08:32:43,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2051 transitions. [2019-09-10 08:32:43,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:43,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:43,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,311 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:43,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:43,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1693775798, now seen corresponding path program 1 times [2019-09-10 08:32:43,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:43,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:43,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:43,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:43,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:43,453 INFO L134 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:43,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:43,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:43,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:43,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:43,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:43,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:43,454 INFO L87 Difference]: Start difference. First operand 1547 states and 2051 transitions. Second operand 9 states. [2019-09-10 08:32:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:47,379 INFO L93 Difference]: Finished difference Result 2654 states and 3565 transitions. [2019-09-10 08:32:47,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:47,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:47,383 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:32:47,383 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:32:47,383 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:32:47,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:32:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:32:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2049 transitions. [2019-09-10 08:32:47,400 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2049 transitions. Word has length 119 [2019-09-10 08:32:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:47,400 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2049 transitions. [2019-09-10 08:32:47,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2049 transitions. [2019-09-10 08:32:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:47,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:47,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,404 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:47,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:47,405 INFO L82 PathProgramCache]: Analyzing trace with hash 672034986, now seen corresponding path program 1 times [2019-09-10 08:32:47,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:47,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:47,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:47,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:47,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:47,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:32:47,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:47,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:47,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:47,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:47,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:47,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:47,577 INFO L87 Difference]: Start difference. First operand 1547 states and 2049 transitions. Second operand 9 states. [2019-09-10 08:32:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:50,956 INFO L93 Difference]: Finished difference Result 2565 states and 3421 transitions. [2019-09-10 08:32:50,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:50,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:50,960 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:32:50,960 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:32:50,960 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:32:50,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:32:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:32:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2047 transitions. [2019-09-10 08:32:50,976 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2047 transitions. Word has length 119 [2019-09-10 08:32:50,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:50,976 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2047 transitions. [2019-09-10 08:32:50,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2047 transitions. [2019-09-10 08:32:50,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:50,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:50,978 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,978 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:50,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:50,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2127541408, now seen corresponding path program 1 times [2019-09-10 08:32:50,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:50,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:50,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:50,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:50,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:51,161 INFO L134 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:51,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:51,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:51,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:51,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:51,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:51,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:51,162 INFO L87 Difference]: Start difference. First operand 1547 states and 2047 transitions. Second operand 9 states. [2019-09-10 08:32:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:55,149 INFO L93 Difference]: Finished difference Result 2654 states and 3557 transitions. [2019-09-10 08:32:55,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:55,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:55,153 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:32:55,153 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:32:55,153 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:32:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:32:55,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:32:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2045 transitions. [2019-09-10 08:32:55,168 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2045 transitions. Word has length 119 [2019-09-10 08:32:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:55,169 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2045 transitions. [2019-09-10 08:32:55,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2045 transitions. [2019-09-10 08:32:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:55,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:55,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] [2019-09-10 08:32:55,171 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:55,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:55,172 INFO L82 PathProgramCache]: Analyzing trace with hash -314352193, now seen corresponding path program 1 times [2019-09-10 08:32:55,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:55,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:55,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:55,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:55,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:55,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:55,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:55,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:55,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:55,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:55,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:55,362 INFO L87 Difference]: Start difference. First operand 1547 states and 2045 transitions. Second operand 9 states. [2019-09-10 08:32:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:58,898 INFO L93 Difference]: Finished difference Result 2565 states and 3415 transitions. [2019-09-10 08:32:58,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:58,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:32:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:58,902 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:32:58,902 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:32:58,903 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:32:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:32:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:32:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:32:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2043 transitions. [2019-09-10 08:32:58,917 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2043 transitions. Word has length 119 [2019-09-10 08:32:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:58,917 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2043 transitions. [2019-09-10 08:32:58,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2043 transitions. [2019-09-10 08:32:58,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:32:58,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:58,918 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:58,919 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:58,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:58,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2095516123, now seen corresponding path program 1 times [2019-09-10 08:32:58,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:58,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:58,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:58,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:58,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:59,061 INFO L134 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:59,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:59,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:59,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:59,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:59,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:59,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:59,062 INFO L87 Difference]: Start difference. First operand 1547 states and 2043 transitions. Second operand 9 states. [2019-09-10 08:33:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:02,342 INFO L93 Difference]: Finished difference Result 2565 states and 3413 transitions. [2019-09-10 08:33:02,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:02,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:33:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:02,346 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:33:02,346 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:33:02,346 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:33:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:33:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:33:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2041 transitions. [2019-09-10 08:33:02,360 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2041 transitions. Word has length 119 [2019-09-10 08:33:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:02,360 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2041 transitions. [2019-09-10 08:33:02,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2041 transitions. [2019-09-10 08:33:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:33:02,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:02,361 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,362 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:02,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:02,362 INFO L82 PathProgramCache]: Analyzing trace with hash -203002818, now seen corresponding path program 1 times [2019-09-10 08:33:02,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:02,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:02,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:02,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:02,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:02,506 INFO L134 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:02,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:02,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:02,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:02,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:02,507 INFO L87 Difference]: Start difference. First operand 1547 states and 2041 transitions. Second operand 9 states. [2019-09-10 08:33:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:06,271 INFO L93 Difference]: Finished difference Result 2654 states and 3551 transitions. [2019-09-10 08:33:06,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:06,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:33:06,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:06,275 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:33:06,275 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:33:06,275 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:33:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:33:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:33:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2039 transitions. [2019-09-10 08:33:06,290 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2039 transitions. Word has length 119 [2019-09-10 08:33:06,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:06,290 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2039 transitions. [2019-09-10 08:33:06,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:06,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2039 transitions. [2019-09-10 08:33:06,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:33:06,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:06,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,292 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1234395980, now seen corresponding path program 1 times [2019-09-10 08:33:06,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:06,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:06,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:06,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:06,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:06,434 INFO L134 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:06,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:06,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:06,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:06,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:06,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:06,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:06,435 INFO L87 Difference]: Start difference. First operand 1547 states and 2039 transitions. Second operand 9 states. [2019-09-10 08:33:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:10,173 INFO L93 Difference]: Finished difference Result 2654 states and 3547 transitions. [2019-09-10 08:33:10,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:10,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:33:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:10,177 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:33:10,177 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:33:10,178 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:33:10,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:33:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:33:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2037 transitions. [2019-09-10 08:33:10,193 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2037 transitions. Word has length 119 [2019-09-10 08:33:10,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:10,193 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2037 transitions. [2019-09-10 08:33:10,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:10,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2037 transitions. [2019-09-10 08:33:10,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:33:10,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:10,195 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,195 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:10,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:10,195 INFO L82 PathProgramCache]: Analyzing trace with hash 606562346, now seen corresponding path program 1 times [2019-09-10 08:33:10,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:10,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:10,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:10,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:10,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:10,341 INFO L134 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:10,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:10,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:10,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:10,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:10,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:10,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:10,342 INFO L87 Difference]: Start difference. First operand 1547 states and 2037 transitions. Second operand 9 states. [2019-09-10 08:33:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:14,034 INFO L93 Difference]: Finished difference Result 2654 states and 3545 transitions. [2019-09-10 08:33:14,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:14,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:33:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:14,037 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:33:14,037 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:33:14,038 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:33:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:33:14,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:33:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2035 transitions. [2019-09-10 08:33:14,050 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2035 transitions. Word has length 119 [2019-09-10 08:33:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:14,050 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2035 transitions. [2019-09-10 08:33:14,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2035 transitions. [2019-09-10 08:33:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:33:14,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:14,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,052 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:14,052 INFO L82 PathProgramCache]: Analyzing trace with hash 324859452, now seen corresponding path program 1 times [2019-09-10 08:33:14,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:14,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:14,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:14,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:14,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:14,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:14,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:14,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:14,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:14,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:14,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:14,190 INFO L87 Difference]: Start difference. First operand 1547 states and 2035 transitions. Second operand 9 states. [2019-09-10 08:33:18,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:18,053 INFO L93 Difference]: Finished difference Result 2702 states and 3616 transitions. [2019-09-10 08:33:18,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:18,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:33:18,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:18,057 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 08:33:18,057 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 08:33:18,057 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:33:18,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 08:33:18,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-10 08:33:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2033 transitions. [2019-09-10 08:33:18,073 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2033 transitions. Word has length 119 [2019-09-10 08:33:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:18,073 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2033 transitions. [2019-09-10 08:33:18,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:18,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2033 transitions. [2019-09-10 08:33:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:18,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:18,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,074 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:18,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1934710952, now seen corresponding path program 1 times [2019-09-10 08:33:18,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:18,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:18,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:18,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:18,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:18,218 INFO L134 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:18,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:18,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:18,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:18,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:18,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:18,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:18,219 INFO L87 Difference]: Start difference. First operand 1547 states and 2033 transitions. Second operand 9 states. [2019-09-10 08:33:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:21,412 INFO L93 Difference]: Finished difference Result 2565 states and 3404 transitions. [2019-09-10 08:33:21,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:21,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:21,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:21,415 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:33:21,415 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:33:21,416 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:33:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:33:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:33:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2032 transitions. [2019-09-10 08:33:21,430 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2032 transitions. Word has length 120 [2019-09-10 08:33:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:21,430 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2032 transitions. [2019-09-10 08:33:21,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2032 transitions. [2019-09-10 08:33:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:21,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:21,431 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,431 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:21,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:21,432 INFO L82 PathProgramCache]: Analyzing trace with hash 273114660, now seen corresponding path program 1 times [2019-09-10 08:33:21,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:21,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:21,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:21,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:21,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:21,567 INFO L134 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:21,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:21,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:21,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:21,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:21,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:21,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:21,568 INFO L87 Difference]: Start difference. First operand 1547 states and 2032 transitions. Second operand 9 states. [2019-09-10 08:33:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:25,236 INFO L93 Difference]: Finished difference Result 2654 states and 3541 transitions. [2019-09-10 08:33:25,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:25,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:25,240 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:33:25,240 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:33:25,241 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:33:25,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:33:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:33:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2031 transitions. [2019-09-10 08:33:25,256 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2031 transitions. Word has length 120 [2019-09-10 08:33:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:25,256 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2031 transitions. [2019-09-10 08:33:25,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2031 transitions. [2019-09-10 08:33:25,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:25,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:25,257 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,257 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:25,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:25,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1544029700, now seen corresponding path program 1 times [2019-09-10 08:33:25,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:25,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:25,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:25,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:25,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:25,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:25,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:25,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:25,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:25,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:25,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:25,400 INFO L87 Difference]: Start difference. First operand 1547 states and 2031 transitions. Second operand 9 states. [2019-09-10 08:33:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:28,966 INFO L93 Difference]: Finished difference Result 2565 states and 3402 transitions. [2019-09-10 08:33:28,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:28,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:28,970 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:33:28,970 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:33:28,970 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:33:28,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:33:28,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:33:28,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:28,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2030 transitions. [2019-09-10 08:33:28,984 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2030 transitions. Word has length 120 [2019-09-10 08:33:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:28,984 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2030 transitions. [2019-09-10 08:33:28,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2030 transitions. [2019-09-10 08:33:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:28,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:28,985 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,985 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:28,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:28,986 INFO L82 PathProgramCache]: Analyzing trace with hash -322580500, now seen corresponding path program 1 times [2019-09-10 08:33:28,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:28,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:28,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:28,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:28,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:29,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:29,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:29,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:29,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:29,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:29,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:29,126 INFO L87 Difference]: Start difference. First operand 1547 states and 2030 transitions. Second operand 9 states. [2019-09-10 08:33:32,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:32,353 INFO L93 Difference]: Finished difference Result 2565 states and 3401 transitions. [2019-09-10 08:33:32,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:32,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:32,357 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:33:32,357 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:33:32,358 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:33:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:33:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:33:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2029 transitions. [2019-09-10 08:33:32,372 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2029 transitions. Word has length 120 [2019-09-10 08:33:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:32,372 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2029 transitions. [2019-09-10 08:33:32,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:32,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2029 transitions. [2019-09-10 08:33:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:32,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:32,374 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:32,374 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:32,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2014104759, now seen corresponding path program 1 times [2019-09-10 08:33:32,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:32,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:32,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:32,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:32,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:32,515 INFO L134 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:32,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:32,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:32,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:32,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:32,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:32,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:32,516 INFO L87 Difference]: Start difference. First operand 1547 states and 2029 transitions. Second operand 9 states. [2019-09-10 08:33:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:35,689 INFO L93 Difference]: Finished difference Result 2565 states and 3400 transitions. [2019-09-10 08:33:35,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:35,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:35,692 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:33:35,693 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:33:35,693 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:33:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:33:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:33:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2028 transitions. [2019-09-10 08:33:35,706 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2028 transitions. Word has length 120 [2019-09-10 08:33:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:35,706 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2028 transitions. [2019-09-10 08:33:35,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2028 transitions. [2019-09-10 08:33:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:35,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:35,708 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,708 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:35,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:35,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2137909868, now seen corresponding path program 1 times [2019-09-10 08:33:35,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:35,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:35,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:35,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:35,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:35,850 INFO L134 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:35,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:35,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:35,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:35,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:35,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:35,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:35,851 INFO L87 Difference]: Start difference. First operand 1547 states and 2028 transitions. Second operand 9 states. [2019-09-10 08:33:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:39,351 INFO L93 Difference]: Finished difference Result 2565 states and 3399 transitions. [2019-09-10 08:33:39,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:39,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:39,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:39,355 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:33:39,356 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:33:39,356 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:33:39,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:33:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:33:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2027 transitions. [2019-09-10 08:33:39,371 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2027 transitions. Word has length 120 [2019-09-10 08:33:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:39,371 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2027 transitions. [2019-09-10 08:33:39,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2027 transitions. [2019-09-10 08:33:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:39,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:39,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,373 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:39,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:39,373 INFO L82 PathProgramCache]: Analyzing trace with hash -339913068, now seen corresponding path program 1 times [2019-09-10 08:33:39,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:39,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:39,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:39,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:39,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:39,513 INFO L134 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:39,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:39,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:39,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:39,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:39,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:39,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:39,514 INFO L87 Difference]: Start difference. First operand 1547 states and 2027 transitions. Second operand 9 states. [2019-09-10 08:33:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:43,145 INFO L93 Difference]: Finished difference Result 2654 states and 3535 transitions. [2019-09-10 08:33:43,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:43,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:43,149 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:33:43,150 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:33:43,150 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:33:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:33:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:33:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2026 transitions. [2019-09-10 08:33:43,165 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2026 transitions. Word has length 120 [2019-09-10 08:33:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:43,166 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2026 transitions. [2019-09-10 08:33:43,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2026 transitions. [2019-09-10 08:33:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:43,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:43,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,167 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:43,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:43,167 INFO L82 PathProgramCache]: Analyzing trace with hash -873001394, now seen corresponding path program 1 times [2019-09-10 08:33:43,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:43,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:43,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:43,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:43,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:43,309 INFO L134 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,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:43,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:43,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:43,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:43,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:43,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:43,310 INFO L87 Difference]: Start difference. First operand 1547 states and 2026 transitions. Second operand 9 states. [2019-09-10 08:33:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:46,862 INFO L93 Difference]: Finished difference Result 2654 states and 3534 transitions. [2019-09-10 08:33:46,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:46,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:46,866 INFO L225 Difference]: With dead ends: 2654 [2019-09-10 08:33:46,866 INFO L226 Difference]: Without dead ends: 2654 [2019-09-10 08:33:46,866 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:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-10 08:33:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-10 08:33:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2025 transitions. [2019-09-10 08:33:46,880 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2025 transitions. Word has length 120 [2019-09-10 08:33:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:46,880 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2025 transitions. [2019-09-10 08:33:46,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2025 transitions. [2019-09-10 08:33:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:46,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:46,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,882 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:46,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:46,882 INFO L82 PathProgramCache]: Analyzing trace with hash 185231847, now seen corresponding path program 1 times [2019-09-10 08:33:46,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:46,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:46,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:46,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:46,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:47,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:47,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:47,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:47,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:47,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:47,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:47,036 INFO L87 Difference]: Start difference. First operand 1547 states and 2025 transitions. Second operand 9 states. [2019-09-10 08:33:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:50,540 INFO L93 Difference]: Finished difference Result 2565 states and 3396 transitions. [2019-09-10 08:33:50,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:50,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:50,544 INFO L225 Difference]: With dead ends: 2565 [2019-09-10 08:33:50,544 INFO L226 Difference]: Without dead ends: 2565 [2019-09-10 08:33:50,544 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:33:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-10 08:33:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-10 08:33:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-10 08:33:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2024 transitions. [2019-09-10 08:33:50,560 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2024 transitions. Word has length 120 [2019-09-10 08:33:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:50,560 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2024 transitions. [2019-09-10 08:33:50,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2024 transitions. [2019-09-10 08:33:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:50,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:50,561 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,561 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:50,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:50,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1490661287, now seen corresponding path program 1 times [2019-09-10 08:33:50,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:50,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:50,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:50,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:50,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:50,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:33:50,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:50,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:50,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:50,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:50,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:50,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:50,709 INFO L87 Difference]: Start difference. First operand 1547 states and 2024 transitions. Second operand 9 states. [2019-09-10 08:33:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:54,319 INFO L93 Difference]: Finished difference Result 2534 states and 3345 transitions. [2019-09-10 08:33:54,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:54,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:54,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:54,322 INFO L225 Difference]: With dead ends: 2534 [2019-09-10 08:33:54,322 INFO L226 Difference]: Without dead ends: 2534 [2019-09-10 08:33:54,322 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:33:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2019-09-10 08:33:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 1550. [2019-09-10 08:33:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-10 08:33:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2028 transitions. [2019-09-10 08:33:54,337 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2028 transitions. Word has length 120 [2019-09-10 08:33:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:54,337 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2028 transitions. [2019-09-10 08:33:54,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2028 transitions. [2019-09-10 08:33:54,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:54,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:54,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] [2019-09-10 08:33:54,339 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:54,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1905087375, now seen corresponding path program 1 times [2019-09-10 08:33:54,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:54,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:54,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:54,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:54,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:54,478 INFO L134 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:54,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:54,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:54,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:54,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:54,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:54,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:54,479 INFO L87 Difference]: Start difference. First operand 1550 states and 2028 transitions. Second operand 9 states. [2019-09-10 08:33:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:57,744 INFO L93 Difference]: Finished difference Result 2566 states and 3395 transitions. [2019-09-10 08:33:57,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:57,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:33:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:57,748 INFO L225 Difference]: With dead ends: 2566 [2019-09-10 08:33:57,748 INFO L226 Difference]: Without dead ends: 2566 [2019-09-10 08:33:57,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:33:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-09-10 08:33:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1550. [2019-09-10 08:33:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-10 08:33:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2027 transitions. [2019-09-10 08:33:57,763 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2027 transitions. Word has length 120 [2019-09-10 08:33:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:57,763 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2027 transitions. [2019-09-10 08:33:57,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2027 transitions. [2019-09-10 08:33:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:57,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:57,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,765 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:57,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:57,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2119924989, now seen corresponding path program 1 times [2019-09-10 08:33:57,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:57,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:57,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:57,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:57,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:57,916 INFO L134 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:57,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:57,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:57,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:57,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:57,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:57,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:57,917 INFO L87 Difference]: Start difference. First operand 1550 states and 2027 transitions. Second operand 9 states. [2019-09-10 08:34:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:01,619 INFO L93 Difference]: Finished difference Result 2657 states and 3534 transitions. [2019-09-10 08:34:01,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:01,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:01,623 INFO L225 Difference]: With dead ends: 2657 [2019-09-10 08:34:01,623 INFO L226 Difference]: Without dead ends: 2657 [2019-09-10 08:34:01,623 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:34:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2019-09-10 08:34:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 1550. [2019-09-10 08:34:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-10 08:34:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2026 transitions. [2019-09-10 08:34:01,638 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2026 transitions. Word has length 120 [2019-09-10 08:34:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:01,638 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2026 transitions. [2019-09-10 08:34:01,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2026 transitions. [2019-09-10 08:34:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:01,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:01,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,639 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:01,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1097313116, now seen corresponding path program 1 times [2019-09-10 08:34:01,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:01,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:01,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:01,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:01,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:01,779 INFO L134 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:01,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:01,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:01,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:01,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:01,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:01,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:01,780 INFO L87 Difference]: Start difference. First operand 1550 states and 2026 transitions. Second operand 9 states. [2019-09-10 08:34:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:04,921 INFO L93 Difference]: Finished difference Result 2566 states and 3392 transitions. [2019-09-10 08:34:04,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:04,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:04,925 INFO L225 Difference]: With dead ends: 2566 [2019-09-10 08:34:04,925 INFO L226 Difference]: Without dead ends: 2566 [2019-09-10 08:34:04,925 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:34:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-09-10 08:34:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1550. [2019-09-10 08:34:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-10 08:34:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2024 transitions. [2019-09-10 08:34:04,940 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2024 transitions. Word has length 120 [2019-09-10 08:34:04,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:04,941 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2024 transitions. [2019-09-10 08:34:04,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2024 transitions. [2019-09-10 08:34:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:34:04,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:04,942 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,942 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:04,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:04,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1455081175, now seen corresponding path program 1 times [2019-09-10 08:34:04,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:04,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:04,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:04,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:04,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:05,086 INFO L134 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:05,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:05,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:05,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:05,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:05,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:05,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:05,087 INFO L87 Difference]: Start difference. First operand 1550 states and 2024 transitions. Second operand 9 states. [2019-09-10 08:34:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:08,676 INFO L93 Difference]: Finished difference Result 2566 states and 3390 transitions. [2019-09-10 08:34:08,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:08,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:34:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:08,680 INFO L225 Difference]: With dead ends: 2566 [2019-09-10 08:34:08,680 INFO L226 Difference]: Without dead ends: 2566 [2019-09-10 08:34:08,680 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:34:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-09-10 08:34:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1550. [2019-09-10 08:34:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-10 08:34:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2022 transitions. [2019-09-10 08:34:08,695 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2022 transitions. Word has length 120 [2019-09-10 08:34:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:08,695 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2022 transitions. [2019-09-10 08:34:08,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2022 transitions. [2019-09-10 08:34:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:34:08,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:08,697 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,697 INFO L418 AbstractCegarLoop]: === Iteration 127 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:08,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:08,697 INFO L82 PathProgramCache]: Analyzing trace with hash 158642163, now seen corresponding path program 1 times [2019-09-10 08:34:08,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:08,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:08,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:08,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:08,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:09,504 INFO L134 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,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:09,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:34:09,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:09,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:34:09,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:34:09,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:34:09,505 INFO L87 Difference]: Start difference. First operand 1550 states and 2022 transitions. Second operand 15 states. [2019-09-10 08:34:10,166 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 08:34:12,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:12,393 INFO L93 Difference]: Finished difference Result 1673 states and 2207 transitions. [2019-09-10 08:34:12,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:34:12,394 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 121 [2019-09-10 08:34:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:12,396 INFO L225 Difference]: With dead ends: 1673 [2019-09-10 08:34:12,396 INFO L226 Difference]: Without dead ends: 1673 [2019-09-10 08:34:12,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:34:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-09-10 08:34:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1368. [2019-09-10 08:34:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-10 08:34:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1778 transitions. [2019-09-10 08:34:12,407 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1778 transitions. Word has length 121 [2019-09-10 08:34:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:12,407 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 1778 transitions. [2019-09-10 08:34:12,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:34:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1778 transitions. [2019-09-10 08:34:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:34:12,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:12,409 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,410 INFO L418 AbstractCegarLoop]: === Iteration 128 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:12,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1097831607, now seen corresponding path program 1 times [2019-09-10 08:34:12,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:12,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:12,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:12,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:12,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:13,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:34:13,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:13,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:34:13,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:13,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:34:13,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:34:13,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:34:13,608 INFO L87 Difference]: Start difference. First operand 1368 states and 1778 transitions. Second operand 21 states. [2019-09-10 08:34:14,865 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 08:34:15,187 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 08:34:15,357 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:34:15,520 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:34:15,688 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:34:16,065 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:34:16,672 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 08:34:17,647 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:34:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:24,900 INFO L93 Difference]: Finished difference Result 3179 states and 4173 transitions. [2019-09-10 08:34:24,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:34:24,900 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 121 [2019-09-10 08:34:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:24,904 INFO L225 Difference]: With dead ends: 3179 [2019-09-10 08:34:24,904 INFO L226 Difference]: Without dead ends: 3179 [2019-09-10 08:34:24,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=382, Invalid=1178, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 08:34:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-09-10 08:34:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 1368. [2019-09-10 08:34:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-10 08:34:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1777 transitions. [2019-09-10 08:34:24,921 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1777 transitions. Word has length 121 [2019-09-10 08:34:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:24,922 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 1777 transitions. [2019-09-10 08:34:24,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:34:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1777 transitions. [2019-09-10 08:34:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:34:24,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:24,924 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,924 INFO L418 AbstractCegarLoop]: === Iteration 129 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:24,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:24,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1907164845, now seen corresponding path program 1 times [2019-09-10 08:34:24,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:24,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:24,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:26,290 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 08:34:26,473 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 08:34:26,627 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 08:34:27,043 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2019-09-10 08:34:27,869 INFO L134 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:27,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:27,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:34:27,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:27,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:34:27,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:34:27,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:34:27,871 INFO L87 Difference]: Start difference. First operand 1368 states and 1777 transitions. Second operand 31 states. [2019-09-10 08:34:28,062 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 08:34:29,747 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-09-10 08:34:30,245 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-10 08:34:30,623 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-10 08:34:31,073 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2019-09-10 08:34:31,750 WARN L188 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 112 [2019-09-10 08:34:32,034 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-10 08:34:32,306 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-10 08:34:32,638 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-10 08:34:33,248 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-09-10 08:34:33,710 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-09-10 08:34:34,081 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-10 08:34:34,596 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-10 08:34:35,468 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-10 08:34:57,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:57,016 INFO L93 Difference]: Finished difference Result 3689 states and 4774 transitions. [2019-09-10 08:34:57,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:34:57,017 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 121 [2019-09-10 08:34:57,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:57,021 INFO L225 Difference]: With dead ends: 3689 [2019-09-10 08:34:57,021 INFO L226 Difference]: Without dead ends: 3689 [2019-09-10 08:34:57,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=641, Invalid=2439, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 08:34:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2019-09-10 08:34:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 1379. [2019-09-10 08:34:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1379 states. [2019-09-10 08:34:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1789 transitions. [2019-09-10 08:34:57,039 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1789 transitions. Word has length 121 [2019-09-10 08:34:57,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:57,039 INFO L475 AbstractCegarLoop]: Abstraction has 1379 states and 1789 transitions. [2019-09-10 08:34:57,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:34:57,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1789 transitions. [2019-09-10 08:34:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:34:57,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:57,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,041 INFO L418 AbstractCegarLoop]: === Iteration 130 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:57,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:57,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1104047055, now seen corresponding path program 1 times [2019-09-10 08:34:57,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:57,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:57,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:57,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:57,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:57,817 INFO L134 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:57,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:57,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:34:57,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:57,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:34:57,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:34:57,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:34:57,818 INFO L87 Difference]: Start difference. First operand 1379 states and 1789 transitions. Second operand 17 states. [2019-09-10 08:34:58,485 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:35:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:00,666 INFO L93 Difference]: Finished difference Result 2593 states and 3448 transitions. [2019-09-10 08:35:00,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:35:00,667 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2019-09-10 08:35:00,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:00,669 INFO L225 Difference]: With dead ends: 2593 [2019-09-10 08:35:00,669 INFO L226 Difference]: Without dead ends: 2593 [2019-09-10 08:35:00,670 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:35:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2019-09-10 08:35:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 1288. [2019-09-10 08:35:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-09-10 08:35:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1666 transitions. [2019-09-10 08:35:00,682 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1666 transitions. Word has length 121 [2019-09-10 08:35:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:00,683 INFO L475 AbstractCegarLoop]: Abstraction has 1288 states and 1666 transitions. [2019-09-10 08:35:00,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:35:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1666 transitions. [2019-09-10 08:35:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:35:00,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:00,684 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,686 INFO L418 AbstractCegarLoop]: === Iteration 131 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:00,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:00,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1808560402, now seen corresponding path program 1 times [2019-09-10 08:35:00,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:00,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:00,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:01,519 INFO L134 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:01,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:01,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:35:01,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:01,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:35:01,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:35:01,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:35:01,520 INFO L87 Difference]: Start difference. First operand 1288 states and 1666 transitions. Second operand 17 states. [2019-09-10 08:35:02,176 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:35:02,335 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 08:35:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:03,456 INFO L93 Difference]: Finished difference Result 1442 states and 1914 transitions. [2019-09-10 08:35:03,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:35:03,457 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2019-09-10 08:35:03,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:03,458 INFO L225 Difference]: With dead ends: 1442 [2019-09-10 08:35:03,458 INFO L226 Difference]: Without dead ends: 1442 [2019-09-10 08:35:03,458 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:35:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-09-10 08:35:03,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1186. [2019-09-10 08:35:03,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-09-10 08:35:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1533 transitions. [2019-09-10 08:35:03,468 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1533 transitions. Word has length 121 [2019-09-10 08:35:03,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:03,468 INFO L475 AbstractCegarLoop]: Abstraction has 1186 states and 1533 transitions. [2019-09-10 08:35:03,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:35:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1533 transitions. [2019-09-10 08:35:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:35:03,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:03,469 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,469 INFO L418 AbstractCegarLoop]: === Iteration 132 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:03,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:03,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1027949232, now seen corresponding path program 1 times [2019-09-10 08:35:03,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:03,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:03,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:03,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:03,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:04,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:35:04,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:04,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:35:04,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:04,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:35:04,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:35:04,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:35:04,229 INFO L87 Difference]: Start difference. First operand 1186 states and 1533 transitions. Second operand 17 states. [2019-09-10 08:35:04,912 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:35:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:06,972 INFO L93 Difference]: Finished difference Result 2107 states and 2811 transitions. [2019-09-10 08:35:06,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:35:06,972 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2019-09-10 08:35:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:06,974 INFO L225 Difference]: With dead ends: 2107 [2019-09-10 08:35:06,974 INFO L226 Difference]: Without dead ends: 2107 [2019-09-10 08:35:06,975 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:35:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2019-09-10 08:35:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 1092. [2019-09-10 08:35:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1092 states. [2019-09-10 08:35:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1406 transitions. [2019-09-10 08:35:06,985 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1406 transitions. Word has length 121 [2019-09-10 08:35:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:06,985 INFO L475 AbstractCegarLoop]: Abstraction has 1092 states and 1406 transitions. [2019-09-10 08:35:06,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:35:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1406 transitions. [2019-09-10 08:35:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:35:06,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:06,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,986 INFO L418 AbstractCegarLoop]: === Iteration 133 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:06,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:06,986 INFO L82 PathProgramCache]: Analyzing trace with hash 110556365, now seen corresponding path program 1 times [2019-09-10 08:35:06,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:06,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:06,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:06,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:06,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:09,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:35:09,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:09,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:35:09,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:09,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:35:09,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:35:09,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:35:09,675 INFO L87 Difference]: Start difference. First operand 1092 states and 1406 transitions. Second operand 31 states. [2019-09-10 08:35:09,884 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 08:35:10,910 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-09-10 08:35:11,090 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-09-10 08:35:11,693 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 08:35:12,094 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-09-10 08:35:12,580 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 106 [2019-09-10 08:35:13,218 WARN L188 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 124 [2019-09-10 08:35:14,306 WARN L188 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 143 [2019-09-10 08:35:14,604 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-09-10 08:35:14,900 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-09-10 08:35:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:31,314 INFO L93 Difference]: Finished difference Result 2524 states and 3351 transitions. [2019-09-10 08:35:31,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 08:35:31,314 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 121 [2019-09-10 08:35:31,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:31,317 INFO L225 Difference]: With dead ends: 2524 [2019-09-10 08:35:31,317 INFO L226 Difference]: Without dead ends: 2524 [2019-09-10 08:35:31,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=481, Invalid=2941, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 08:35:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2019-09-10 08:35:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 1115. [2019-09-10 08:35:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-09-10 08:35:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1436 transitions. [2019-09-10 08:35:31,333 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1436 transitions. Word has length 121 [2019-09-10 08:35:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:31,333 INFO L475 AbstractCegarLoop]: Abstraction has 1115 states and 1436 transitions. [2019-09-10 08:35:31,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:35:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1436 transitions. [2019-09-10 08:35:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:35:31,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:31,335 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,335 INFO L418 AbstractCegarLoop]: === Iteration 134 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash 451619916, now seen corresponding path program 1 times [2019-09-10 08:35:31,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:31,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:31,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:31,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:31,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:32,135 INFO L134 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:32,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:32,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:35:32,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:32,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:35:32,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:35:32,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:35:32,136 INFO L87 Difference]: Start difference. First operand 1115 states and 1436 transitions. Second operand 17 states. [2019-09-10 08:35:32,820 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:35:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:36,174 INFO L93 Difference]: Finished difference Result 2150 states and 2853 transitions. [2019-09-10 08:35:36,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:35:36,174 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2019-09-10 08:35:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:36,177 INFO L225 Difference]: With dead ends: 2150 [2019-09-10 08:35:36,177 INFO L226 Difference]: Without dead ends: 2150 [2019-09-10 08:35:36,177 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:35:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2019-09-10 08:35:36,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1078. [2019-09-10 08:35:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2019-09-10 08:35:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1384 transitions. [2019-09-10 08:35:36,188 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1384 transitions. Word has length 121 [2019-09-10 08:35:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:36,189 INFO L475 AbstractCegarLoop]: Abstraction has 1078 states and 1384 transitions. [2019-09-10 08:35:36,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:35:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1384 transitions. [2019-09-10 08:35:36,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:35:36,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:36,190 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,190 INFO L418 AbstractCegarLoop]: === Iteration 135 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:36,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:36,190 INFO L82 PathProgramCache]: Analyzing trace with hash -312644520, now seen corresponding path program 1 times [2019-09-10 08:35:36,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:36,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:36,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:36,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:36,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:37,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:37,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:35:37,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:37,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:35:37,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:35:37,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:35:37,009 INFO L87 Difference]: Start difference. First operand 1078 states and 1384 transitions. Second operand 17 states. [2019-09-10 08:35:37,688 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:35:37,859 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:35:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:40,394 INFO L93 Difference]: Finished difference Result 2029 states and 2700 transitions. [2019-09-10 08:35:40,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:35:40,395 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2019-09-10 08:35:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:40,397 INFO L225 Difference]: With dead ends: 2029 [2019-09-10 08:35:40,398 INFO L226 Difference]: Without dead ends: 2029 [2019-09-10 08:35:40,398 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:35:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2019-09-10 08:35:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1046. [2019-09-10 08:35:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-09-10 08:35:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1343 transitions. [2019-09-10 08:35:40,408 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1343 transitions. Word has length 121 [2019-09-10 08:35:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:40,409 INFO L475 AbstractCegarLoop]: Abstraction has 1046 states and 1343 transitions. [2019-09-10 08:35:40,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:35:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1343 transitions. [2019-09-10 08:35:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:35:40,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:40,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:40,410 INFO L418 AbstractCegarLoop]: === Iteration 136 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:40,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:40,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1094768673, now seen corresponding path program 1 times [2019-09-10 08:35:40,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:40,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:40,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:40,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:40,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:41,675 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-10 08:35:41,886 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 08:35:42,101 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 08:35:42,324 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:35:42,495 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 08:35:42,683 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 08:35:42,882 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 08:35:43,058 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 08:35:43,231 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 08:35:45,053 INFO L134 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:45,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:45,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-10 08:35:45,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:45,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 08:35:45,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 08:35:45,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1162, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:35:45,055 INFO L87 Difference]: Start difference. First operand 1046 states and 1343 transitions. Second operand 36 states. [2019-09-10 08:35:45,690 WARN L188 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 153 [2019-09-10 08:35:46,841 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:35:47,038 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-10 08:35:47,270 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:35:47,526 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 08:35:47,793 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 08:35:48,111 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-10 08:35:48,921 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-10 08:35:49,425 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 95 [2019-09-10 08:35:49,965 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 104 [2019-09-10 08:35:50,574 WARN L188 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 113 [2019-09-10 08:35:51,270 WARN L188 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 122 [2019-09-10 08:35:52,126 WARN L188 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 143 [2019-09-10 08:35:52,619 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2019-09-10 08:35:53,090 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2019-09-10 08:35:53,377 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 08:35:53,820 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:36:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:10,693 INFO L93 Difference]: Finished difference Result 1555 states and 2008 transitions. [2019-09-10 08:36:10,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 08:36:10,693 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 121 [2019-09-10 08:36:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:10,696 INFO L225 Difference]: With dead ends: 1555 [2019-09-10 08:36:10,697 INFO L226 Difference]: Without dead ends: 1555 [2019-09-10 08:36:10,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=601, Invalid=2821, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 08:36:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-09-10 08:36:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1071. [2019-09-10 08:36:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-09-10 08:36:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1376 transitions. [2019-09-10 08:36:10,710 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1376 transitions. Word has length 121 [2019-09-10 08:36:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:10,711 INFO L475 AbstractCegarLoop]: Abstraction has 1071 states and 1376 transitions. [2019-09-10 08:36:10,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 08:36:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1376 transitions. [2019-09-10 08:36:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:36:10,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:10,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:10,713 INFO L418 AbstractCegarLoop]: === Iteration 137 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:10,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:10,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2049990917, now seen corresponding path program 1 times [2019-09-10 08:36:10,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:10,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:10,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:10,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:10,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:11,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:36:11,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:11,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:36:11,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:11,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:36:11,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:36:11,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:36:11,576 INFO L87 Difference]: Start difference. First operand 1071 states and 1376 transitions. Second operand 17 states. [2019-09-10 08:36:12,238 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 08:36:12,388 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 08:36:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:15,715 INFO L93 Difference]: Finished difference Result 2032 states and 2696 transitions. [2019-09-10 08:36:15,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:36:15,715 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2019-09-10 08:36:15,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:15,717 INFO L225 Difference]: With dead ends: 2032 [2019-09-10 08:36:15,717 INFO L226 Difference]: Without dead ends: 2032 [2019-09-10 08:36:15,718 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:36:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-09-10 08:36:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1051. [2019-09-10 08:36:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-09-10 08:36:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1347 transitions. [2019-09-10 08:36:15,729 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1347 transitions. Word has length 121 [2019-09-10 08:36:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:15,730 INFO L475 AbstractCegarLoop]: Abstraction has 1051 states and 1347 transitions. [2019-09-10 08:36:15,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:36:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1347 transitions. [2019-09-10 08:36:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:36:15,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:15,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:15,731 INFO L418 AbstractCegarLoop]: === Iteration 138 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:15,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:15,731 INFO L82 PathProgramCache]: Analyzing trace with hash -451129357, now seen corresponding path program 1 times [2019-09-10 08:36:15,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:15,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:15,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:15,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:15,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:16,333 INFO L134 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:36:16,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:16,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:36:16,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:16,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:36:16,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:36:16,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:36:16,334 INFO L87 Difference]: Start difference. First operand 1051 states and 1347 transitions. Second operand 12 states. [2019-09-10 08:36:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:18,212 INFO L93 Difference]: Finished difference Result 2220 states and 3002 transitions. [2019-09-10 08:36:18,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:36:18,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-09-10 08:36:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:18,215 INFO L225 Difference]: With dead ends: 2220 [2019-09-10 08:36:18,215 INFO L226 Difference]: Without dead ends: 2220 [2019-09-10 08:36:18,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:36:18,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2019-09-10 08:36:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1004. [2019-09-10 08:36:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-09-10 08:36:18,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1284 transitions. [2019-09-10 08:36:18,225 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1284 transitions. Word has length 122 [2019-09-10 08:36:18,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:18,226 INFO L475 AbstractCegarLoop]: Abstraction has 1004 states and 1284 transitions. [2019-09-10 08:36:18,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:36:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1284 transitions. [2019-09-10 08:36:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:36:18,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:18,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, 1, 1, 1, 1] [2019-09-10 08:36:18,227 INFO L418 AbstractCegarLoop]: === Iteration 139 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:18,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:18,227 INFO L82 PathProgramCache]: Analyzing trace with hash -915142073, now seen corresponding path program 1 times [2019-09-10 08:36:18,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:18,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:18,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:18,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:18,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:36:18,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:18,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:36:18,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:36:18,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:36:18,608 INFO L87 Difference]: Start difference. First operand 1004 states and 1284 transitions. Second operand 11 states. [2019-09-10 08:36:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:19,398 INFO L93 Difference]: Finished difference Result 2163 states and 2936 transitions. [2019-09-10 08:36:19,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:36:19,400 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 122 [2019-09-10 08:36:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:19,403 INFO L225 Difference]: With dead ends: 2163 [2019-09-10 08:36:19,403 INFO L226 Difference]: Without dead ends: 2163 [2019-09-10 08:36:19,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:36:19,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2019-09-10 08:36:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 910. [2019-09-10 08:36:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-10 08:36:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1159 transitions. [2019-09-10 08:36:19,414 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1159 transitions. Word has length 122 [2019-09-10 08:36:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:19,414 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1159 transitions. [2019-09-10 08:36:19,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:36:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1159 transitions. [2019-09-10 08:36:19,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:36:19,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:19,416 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:19,416 INFO L418 AbstractCegarLoop]: === Iteration 140 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:19,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:19,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1137545692, now seen corresponding path program 1 times [2019-09-10 08:36:19,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:19,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:19,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:19,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:20,251 INFO L134 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:36:20,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:20,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:36:20,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:20,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:36:20,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:36:20,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:36:20,252 INFO L87 Difference]: Start difference. First operand 910 states and 1159 transitions. Second operand 17 states. [2019-09-10 08:36:20,983 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:36:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:24,537 INFO L93 Difference]: Finished difference Result 1773 states and 2349 transitions. [2019-09-10 08:36:24,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:36:24,537 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:36:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:24,540 INFO L225 Difference]: With dead ends: 1773 [2019-09-10 08:36:24,540 INFO L226 Difference]: Without dead ends: 1773 [2019-09-10 08:36:24,540 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:36:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-10 08:36:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 910. [2019-09-10 08:36:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-10 08:36:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1157 transitions. [2019-09-10 08:36:24,550 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1157 transitions. Word has length 122 [2019-09-10 08:36:24,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:24,550 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1157 transitions. [2019-09-10 08:36:24,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:36:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1157 transitions. [2019-09-10 08:36:24,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:36:24,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:24,551 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:24,551 INFO L418 AbstractCegarLoop]: === Iteration 141 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:24,552 INFO L82 PathProgramCache]: Analyzing trace with hash -794969802, now seen corresponding path program 1 times [2019-09-10 08:36:24,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:24,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:24,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:24,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:24,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:25,370 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 08:36:25,524 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:36:26,335 INFO L134 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:36:26,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:26,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:36:26,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:26,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:36:26,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:36:26,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:36:26,336 INFO L87 Difference]: Start difference. First operand 910 states and 1157 transitions. Second operand 22 states. [2019-09-10 08:36:27,415 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-09-10 08:36:27,670 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 08:36:27,969 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-09-10 08:36:28,149 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 08:36:28,607 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-10 08:36:29,001 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 08:36:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:35,021 INFO L93 Difference]: Finished difference Result 2210 states and 2918 transitions. [2019-09-10 08:36:35,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:36:35,021 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-10 08:36:35,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:35,024 INFO L225 Difference]: With dead ends: 2210 [2019-09-10 08:36:35,024 INFO L226 Difference]: Without dead ends: 2210 [2019-09-10 08:36:35,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:36:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2019-09-10 08:36:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 916. [2019-09-10 08:36:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-10 08:36:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1163 transitions. [2019-09-10 08:36:35,034 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1163 transitions. Word has length 122 [2019-09-10 08:36:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:35,034 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1163 transitions. [2019-09-10 08:36:35,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:36:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1163 transitions. [2019-09-10 08:36:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:36:35,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:35,035 INFO L418 AbstractCegarLoop]: === Iteration 142 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:35,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:35,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1559234238, now seen corresponding path program 1 times [2019-09-10 08:36:35,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:35,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:35,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:35,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:36:35,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:35,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:36:35,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:35,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:36:35,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:36:35,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:36:35,831 INFO L87 Difference]: Start difference. First operand 916 states and 1163 transitions. Second operand 17 states. [2019-09-10 08:36:36,543 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 08:36:40,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:40,265 INFO L93 Difference]: Finished difference Result 1773 states and 2343 transitions. [2019-09-10 08:36:40,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:36:40,265 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:36:40,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:40,267 INFO L225 Difference]: With dead ends: 1773 [2019-09-10 08:36:40,267 INFO L226 Difference]: Without dead ends: 1773 [2019-09-10 08:36:40,267 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:36:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-10 08:36:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 915. [2019-09-10 08:36:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-09-10 08:36:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1160 transitions. [2019-09-10 08:36:40,277 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1160 transitions. Word has length 122 [2019-09-10 08:36:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:40,277 INFO L475 AbstractCegarLoop]: Abstraction has 915 states and 1160 transitions. [2019-09-10 08:36:40,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:36:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1160 transitions. [2019-09-10 08:36:40,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:36:40,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:40,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:40,278 INFO L418 AbstractCegarLoop]: === Iteration 143 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:40,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:40,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1168980121, now seen corresponding path program 1 times [2019-09-10 08:36:40,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:40,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:40,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:40,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:40,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:40,719 INFO L134 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:36:40,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:40,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:36:40,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:40,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:36:40,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:36:40,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:36:40,720 INFO L87 Difference]: Start difference. First operand 915 states and 1160 transitions. Second operand 10 states. [2019-09-10 08:36:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:42,267 INFO L93 Difference]: Finished difference Result 1617 states and 2102 transitions. [2019-09-10 08:36:42,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:36:42,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2019-09-10 08:36:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:42,269 INFO L225 Difference]: With dead ends: 1617 [2019-09-10 08:36:42,269 INFO L226 Difference]: Without dead ends: 1617 [2019-09-10 08:36:42,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:36:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-10 08:36:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 781. [2019-09-10 08:36:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-09-10 08:36:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 998 transitions. [2019-09-10 08:36:42,278 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 998 transitions. Word has length 122 [2019-09-10 08:36:42,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:42,279 INFO L475 AbstractCegarLoop]: Abstraction has 781 states and 998 transitions. [2019-09-10 08:36:42,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:36:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 998 transitions. [2019-09-10 08:36:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:36:42,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:42,280 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:42,280 INFO L418 AbstractCegarLoop]: === Iteration 144 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:42,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:42,280 INFO L82 PathProgramCache]: Analyzing trace with hash 648992993, now seen corresponding path program 1 times [2019-09-10 08:36:42,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:42,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:42,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:42,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:42,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:43,046 INFO L134 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:36:43,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:43,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:36:43,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:43,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:36:43,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:36:43,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:36:43,047 INFO L87 Difference]: Start difference. First operand 781 states and 998 transitions. Second operand 16 states. [2019-09-10 08:36:43,859 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:36:43,999 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 08:36:44,167 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 08:36:44,355 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 08:36:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:45,613 INFO L93 Difference]: Finished difference Result 1925 states and 2630 transitions. [2019-09-10 08:36:45,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:36:45,613 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 122 [2019-09-10 08:36:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:45,616 INFO L225 Difference]: With dead ends: 1925 [2019-09-10 08:36:45,616 INFO L226 Difference]: Without dead ends: 1925 [2019-09-10 08:36:45,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:36:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-09-10 08:36:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 691. [2019-09-10 08:36:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-10 08:36:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 879 transitions. [2019-09-10 08:36:45,627 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 879 transitions. Word has length 122 [2019-09-10 08:36:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:45,627 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 879 transitions. [2019-09-10 08:36:45,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:36:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 879 transitions. [2019-09-10 08:36:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:36:45,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:45,628 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:45,629 INFO L418 AbstractCegarLoop]: === Iteration 145 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:45,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:45,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2120709764, now seen corresponding path program 1 times [2019-09-10 08:36:45,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:45,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:45,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:45,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:45,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:46,773 INFO L134 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:36:46,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:46,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:36:46,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:46,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:36:46,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:36:46,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:36:46,774 INFO L87 Difference]: Start difference. First operand 691 states and 879 transitions. Second operand 21 states. [2019-09-10 08:36:47,922 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:36:48,207 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-10 08:36:48,383 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 08:36:48,555 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 08:36:48,766 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 08:36:49,199 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:36:49,487 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 08:36:50,053 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 08:36:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:53,183 INFO L93 Difference]: Finished difference Result 1836 states and 2485 transitions. [2019-09-10 08:36:53,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:36:53,184 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 122 [2019-09-10 08:36:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:53,186 INFO L225 Difference]: With dead ends: 1836 [2019-09-10 08:36:53,187 INFO L226 Difference]: Without dead ends: 1836 [2019-09-10 08:36:53,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 08:36:53,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2019-09-10 08:36:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 691. [2019-09-10 08:36:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-10 08:36:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 877 transitions. [2019-09-10 08:36:53,197 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 877 transitions. Word has length 122 [2019-09-10 08:36:53,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:53,197 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 877 transitions. [2019-09-10 08:36:53,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:36:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 877 transitions. [2019-09-10 08:36:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:36:53,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:53,198 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:53,198 INFO L418 AbstractCegarLoop]: === Iteration 146 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:53,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1818479085, now seen corresponding path program 1 times [2019-09-10 08:36:53,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:53,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:53,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:53,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:53,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:54,015 INFO L134 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:36:54,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:54,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:36:54,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:54,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:36:54,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:36:54,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:36:54,017 INFO L87 Difference]: Start difference. First operand 691 states and 877 transitions. Second operand 17 states. [2019-09-10 08:36:54,701 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:36:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:56,577 INFO L93 Difference]: Finished difference Result 1415 states and 1896 transitions. [2019-09-10 08:36:56,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:36:56,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:36:56,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:56,579 INFO L225 Difference]: With dead ends: 1415 [2019-09-10 08:36:56,579 INFO L226 Difference]: Without dead ends: 1415 [2019-09-10 08:36:56,579 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:36:56,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2019-09-10 08:36:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 677. [2019-09-10 08:36:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-09-10 08:36:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 857 transitions. [2019-09-10 08:36:56,587 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 857 transitions. Word has length 122 [2019-09-10 08:36:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:56,587 INFO L475 AbstractCegarLoop]: Abstraction has 677 states and 857 transitions. [2019-09-10 08:36:56,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:36:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 857 transitions. [2019-09-10 08:36:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:36:56,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:56,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:56,588 INFO L418 AbstractCegarLoop]: === Iteration 147 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:56,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:56,589 INFO L82 PathProgramCache]: Analyzing trace with hash -208354186, now seen corresponding path program 1 times [2019-09-10 08:36:56,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:56,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:56,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:56,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:56,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:57,361 INFO L134 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:36:57,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:57,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:36:57,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:57,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:36:57,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:36:57,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:36:57,362 INFO L87 Difference]: Start difference. First operand 677 states and 857 transitions. Second operand 16 states. [2019-09-10 08:36:58,083 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 08:36:58,243 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:36:58,402 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:36:58,587 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:37:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:00,477 INFO L93 Difference]: Finished difference Result 1240 states and 1606 transitions. [2019-09-10 08:37:00,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:37:00,478 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 122 [2019-09-10 08:37:00,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:00,479 INFO L225 Difference]: With dead ends: 1240 [2019-09-10 08:37:00,480 INFO L226 Difference]: Without dead ends: 1240 [2019-09-10 08:37:00,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:37:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2019-09-10 08:37:00,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 676. [2019-09-10 08:37:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-09-10 08:37:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 855 transitions. [2019-09-10 08:37:00,487 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 855 transitions. Word has length 122 [2019-09-10 08:37:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:00,487 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 855 transitions. [2019-09-10 08:37:00,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:37:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 855 transitions. [2019-09-10 08:37:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:37:00,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:00,488 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:00,488 INFO L418 AbstractCegarLoop]: === Iteration 148 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:00,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:00,489 INFO L82 PathProgramCache]: Analyzing trace with hash -651909446, now seen corresponding path program 1 times [2019-09-10 08:37:00,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:00,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:00,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:00,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:00,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:01,721 INFO L134 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:37:01,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:01,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:37:01,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:01,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:37:01,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:37:01,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:37:01,722 INFO L87 Difference]: Start difference. First operand 676 states and 855 transitions. Second operand 21 states. [2019-09-10 08:37:02,558 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-10 08:37:03,045 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 08:37:05,356 WARN L188 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 08:37:05,539 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:37:05,708 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:37:05,875 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:37:06,348 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:37:06,736 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 08:37:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:09,485 INFO L93 Difference]: Finished difference Result 1809 states and 2444 transitions. [2019-09-10 08:37:09,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:37:09,486 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 122 [2019-09-10 08:37:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:09,488 INFO L225 Difference]: With dead ends: 1809 [2019-09-10 08:37:09,488 INFO L226 Difference]: Without dead ends: 1809 [2019-09-10 08:37:09,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=382, Invalid=1178, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 08:37:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2019-09-10 08:37:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 676. [2019-09-10 08:37:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-09-10 08:37:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 854 transitions. [2019-09-10 08:37:09,498 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 854 transitions. Word has length 122 [2019-09-10 08:37:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:09,499 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 854 transitions. [2019-09-10 08:37:09,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:37:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 854 transitions. [2019-09-10 08:37:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:37:09,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:09,499 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:09,500 INFO L418 AbstractCegarLoop]: === Iteration 149 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:09,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1562732879, now seen corresponding path program 1 times [2019-09-10 08:37:09,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:09,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:09,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:09,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:09,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:10,223 INFO L134 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:37:10,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:10,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:37:10,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:10,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:37:10,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:37:10,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:37:10,224 INFO L87 Difference]: Start difference. First operand 676 states and 854 transitions. Second operand 16 states. [2019-09-10 08:37:10,930 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 08:37:11,063 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:37:11,193 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:37:11,328 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 08:37:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:13,401 INFO L93 Difference]: Finished difference Result 1270 states and 1636 transitions. [2019-09-10 08:37:13,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:37:13,402 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 122 [2019-09-10 08:37:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:13,403 INFO L225 Difference]: With dead ends: 1270 [2019-09-10 08:37:13,404 INFO L226 Difference]: Without dead ends: 1270 [2019-09-10 08:37:13,404 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:37:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-09-10 08:37:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 682. [2019-09-10 08:37:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-10 08:37:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 862 transitions. [2019-09-10 08:37:13,411 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 862 transitions. Word has length 122 [2019-09-10 08:37:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:13,411 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 862 transitions. [2019-09-10 08:37:13,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:37:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 862 transitions. [2019-09-10 08:37:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:37:13,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:13,412 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:13,412 INFO L418 AbstractCegarLoop]: === Iteration 150 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:13,412 INFO L82 PathProgramCache]: Analyzing trace with hash -656104241, now seen corresponding path program 1 times [2019-09-10 08:37:13,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:13,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:13,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:14,942 INFO L134 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:37:14,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:14,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:37:14,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:14,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:37:14,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:37:14,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:37:14,943 INFO L87 Difference]: Start difference. First operand 682 states and 862 transitions. Second operand 21 states. [2019-09-10 08:37:15,159 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 08:37:15,759 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-09-10 08:37:15,966 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:37:16,373 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-09-10 08:37:16,659 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2019-09-10 08:37:16,972 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2019-09-10 08:37:17,372 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 79 [2019-09-10 08:37:17,641 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 08:37:17,984 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-10 08:37:18,408 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 08:37:18,840 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 08:37:19,168 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 08:37:19,401 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:37:19,946 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2019-09-10 08:37:20,267 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-10 08:37:20,588 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-09-10 08:37:22,459 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-10 08:37:22,681 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-09-10 08:37:23,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:23,302 INFO L93 Difference]: Finished difference Result 2432 states and 3368 transitions. [2019-09-10 08:37:23,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:37:23,303 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 122 [2019-09-10 08:37:23,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:23,306 INFO L225 Difference]: With dead ends: 2432 [2019-09-10 08:37:23,306 INFO L226 Difference]: Without dead ends: 2432 [2019-09-10 08:37:23,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:37:23,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2019-09-10 08:37:23,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 668. [2019-09-10 08:37:23,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-10 08:37:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 842 transitions. [2019-09-10 08:37:23,318 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 842 transitions. Word has length 122 [2019-09-10 08:37:23,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:23,318 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 842 transitions. [2019-09-10 08:37:23,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:37:23,319 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 842 transitions. [2019-09-10 08:37:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:37:23,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:23,319 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:23,319 INFO L418 AbstractCegarLoop]: === Iteration 151 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:23,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:23,320 INFO L82 PathProgramCache]: Analyzing trace with hash -314799391, now seen corresponding path program 1 times [2019-09-10 08:37:23,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:23,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:23,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:23,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:23,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:24,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:24,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:37:24,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:24,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:37:24,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:37:24,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:37:24,045 INFO L87 Difference]: Start difference. First operand 668 states and 842 transitions. Second operand 17 states. [2019-09-10 08:37:24,184 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 08:37:24,878 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 08:37:25,043 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 08:37:25,208 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:37:25,407 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:37:25,627 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:37:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:27,203 INFO L93 Difference]: Finished difference Result 2210 states and 3048 transitions. [2019-09-10 08:37:27,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:37:27,204 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-10 08:37:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:27,207 INFO L225 Difference]: With dead ends: 2210 [2019-09-10 08:37:27,207 INFO L226 Difference]: Without dead ends: 2210 [2019-09-10 08:37:27,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:37:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2019-09-10 08:37:27,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 636. [2019-09-10 08:37:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-10 08:37:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 801 transitions. [2019-09-10 08:37:27,218 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 801 transitions. Word has length 122 [2019-09-10 08:37:27,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:27,218 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 801 transitions. [2019-09-10 08:37:27,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:37:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 801 transitions. [2019-09-10 08:37:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:37:27,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:27,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:27,219 INFO L418 AbstractCegarLoop]: === Iteration 152 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:27,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:27,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1079063827, now seen corresponding path program 1 times [2019-09-10 08:37:27,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:27,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:27,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:27,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:27,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:28,112 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:37:28,322 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:37:29,015 INFO L134 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:37:29,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:29,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:37:29,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:29,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:37:29,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:37:29,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:37:29,016 INFO L87 Difference]: Start difference. First operand 636 states and 801 transitions. Second operand 25 states. [2019-09-10 08:37:30,317 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 08:37:30,606 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:37:32,104 WARN L188 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 137 DAG size of output: 121 [2019-09-10 08:37:32,344 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:37:32,525 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:37:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:37,652 INFO L93 Difference]: Finished difference Result 1176 states and 1528 transitions. [2019-09-10 08:37:37,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 08:37:37,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 122 [2019-09-10 08:37:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:37,655 INFO L225 Difference]: With dead ends: 1176 [2019-09-10 08:37:37,655 INFO L226 Difference]: Without dead ends: 1176 [2019-09-10 08:37:37,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=323, Invalid=1747, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 08:37:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2019-09-10 08:37:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 662. [2019-09-10 08:37:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-10 08:37:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 832 transitions. [2019-09-10 08:37:37,662 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 832 transitions. Word has length 122 [2019-09-10 08:37:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:37,662 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 832 transitions. [2019-09-10 08:37:37,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:37:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 832 transitions. [2019-09-10 08:37:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:37:37,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:37,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:37,664 INFO L418 AbstractCegarLoop]: === Iteration 153 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:37,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:37,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1649150532, now seen corresponding path program 1 times [2019-09-10 08:37:37,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:37,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:37,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:37,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:37,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:39,016 INFO L134 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:37:39,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:39,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:37:39,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:39,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:37:39,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:37:39,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:37:39,017 INFO L87 Difference]: Start difference. First operand 662 states and 832 transitions. Second operand 21 states. [2019-09-10 08:37:40,194 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-10 08:37:40,450 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2019-09-10 08:37:40,663 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 08:37:40,863 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 08:37:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:42,849 INFO L93 Difference]: Finished difference Result 725 states and 903 transitions. [2019-09-10 08:37:42,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:37:42,850 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 122 [2019-09-10 08:37:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:42,851 INFO L225 Difference]: With dead ends: 725 [2019-09-10 08:37:42,851 INFO L226 Difference]: Without dead ends: 725 [2019-09-10 08:37:42,852 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:37:42,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-09-10 08:37:42,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 668. [2019-09-10 08:37:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-10 08:37:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 840 transitions. [2019-09-10 08:37:42,857 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 840 transitions. Word has length 122 [2019-09-10 08:37:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:42,857 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 840 transitions. [2019-09-10 08:37:42,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:37:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 840 transitions. [2019-09-10 08:37:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:37:42,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:42,858 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:42,858 INFO L418 AbstractCegarLoop]: === Iteration 154 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:42,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:42,858 INFO L82 PathProgramCache]: Analyzing trace with hash -664679260, now seen corresponding path program 1 times [2019-09-10 08:37:42,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:42,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:42,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:42,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:42,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:43,391 INFO L134 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:37:43,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:43,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:37:43,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:43,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:37:43,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:37:43,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:37:43,392 INFO L87 Difference]: Start difference. First operand 668 states and 840 transitions. Second operand 12 states. [2019-09-10 08:37:44,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:44,410 INFO L93 Difference]: Finished difference Result 1673 states and 2300 transitions. [2019-09-10 08:37:44,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:37:44,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-09-10 08:37:44,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:44,413 INFO L225 Difference]: With dead ends: 1673 [2019-09-10 08:37:44,413 INFO L226 Difference]: Without dead ends: 1673 [2019-09-10 08:37:44,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:37:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-09-10 08:37:44,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 648. [2019-09-10 08:37:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-10 08:37:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 813 transitions. [2019-09-10 08:37:44,422 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 813 transitions. Word has length 122 [2019-09-10 08:37:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:44,423 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 813 transitions. [2019-09-10 08:37:44,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:37:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 813 transitions. [2019-09-10 08:37:44,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:37:44,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37: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, 1, 1] [2019-09-10 08:37:44,424 INFO L418 AbstractCegarLoop]: === Iteration 155 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:44,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2063535099, now seen corresponding path program 1 times [2019-09-10 08:37:44,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:44,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:44,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:44,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:44,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:46,313 INFO L134 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:37:46,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:46,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:37:46,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:46,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:37:46,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:37:46,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:37:46,314 INFO L87 Difference]: Start difference. First operand 648 states and 813 transitions. Second operand 26 states. [2019-09-10 08:37:46,492 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 08:37:47,357 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-10 08:37:47,893 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 08:37:48,188 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-10 08:37:48,518 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2019-09-10 08:37:48,976 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 97 [2019-09-10 08:37:49,246 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 08:37:49,495 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-09-10 08:37:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:52,104 INFO L93 Difference]: Finished difference Result 748 states and 927 transitions. [2019-09-10 08:37:52,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:37:52,104 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 122 [2019-09-10 08:37:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:52,106 INFO L225 Difference]: With dead ends: 748 [2019-09-10 08:37:52,106 INFO L226 Difference]: Without dead ends: 748 [2019-09-10 08:37:52,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=302, Invalid=1420, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:37:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-09-10 08:37:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 670. [2019-09-10 08:37:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-10 08:37:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 840 transitions. [2019-09-10 08:37:52,112 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 840 transitions. Word has length 122 [2019-09-10 08:37:52,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:52,112 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 840 transitions. [2019-09-10 08:37:52,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:37:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 840 transitions. [2019-09-10 08:37:52,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:37:52,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:52,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:52,113 INFO L418 AbstractCegarLoop]: === Iteration 156 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:52,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:52,113 INFO L82 PathProgramCache]: Analyzing trace with hash -731319049, now seen corresponding path program 1 times [2019-09-10 08:37:52,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:52,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:52,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:52,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:52,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:52,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:37:52,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:52,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:52,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:52,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:52,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:52,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:52,285 INFO L87 Difference]: Start difference. First operand 670 states and 840 transitions. Second operand 9 states. [2019-09-10 08:37:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:53,820 INFO L93 Difference]: Finished difference Result 1345 states and 1799 transitions. [2019-09-10 08:37:53,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:53,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:37:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:53,822 INFO L225 Difference]: With dead ends: 1345 [2019-09-10 08:37:53,822 INFO L226 Difference]: Without dead ends: 1345 [2019-09-10 08:37:53,823 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:37:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2019-09-10 08:37:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 670. [2019-09-10 08:37:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-10 08:37:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 838 transitions. [2019-09-10 08:37:53,829 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 838 transitions. Word has length 122 [2019-09-10 08:37:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:53,830 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 838 transitions. [2019-09-10 08:37:53,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 838 transitions. [2019-09-10 08:37:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:37:53,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:53,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:53,831 INFO L418 AbstractCegarLoop]: === Iteration 157 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:53,831 INFO L82 PathProgramCache]: Analyzing trace with hash -838594883, now seen corresponding path program 1 times [2019-09-10 08:37:53,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:53,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:53,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:53,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:53,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:54,850 INFO L134 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:37:54,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:54,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:37:54,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:54,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:37:54,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:37:54,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:37:54,852 INFO L87 Difference]: Start difference. First operand 670 states and 838 transitions. Second operand 20 states. [2019-09-10 08:37:55,001 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 08:37:55,863 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:37:56,069 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 08:37:56,268 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 08:37:56,457 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 08:37:56,684 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 08:37:57,137 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 08:37:57,489 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 08:37:58,052 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 08:37:58,544 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 08:37:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:59,725 INFO L93 Difference]: Finished difference Result 1064 states and 1352 transitions. [2019-09-10 08:37:59,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:37:59,726 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 122 [2019-09-10 08:37:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:59,727 INFO L225 Difference]: With dead ends: 1064 [2019-09-10 08:37:59,728 INFO L226 Difference]: Without dead ends: 1064 [2019-09-10 08:37:59,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=254, Invalid=936, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:37:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2019-09-10 08:37:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 668. [2019-09-10 08:37:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-10 08:37:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 834 transitions. [2019-09-10 08:37:59,734 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 834 transitions. Word has length 122 [2019-09-10 08:37:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:59,735 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 834 transitions. [2019-09-10 08:37:59,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:37:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 834 transitions. [2019-09-10 08:37:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:37:59,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:59,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:59,736 INFO L418 AbstractCegarLoop]: === Iteration 158 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:59,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash -886552860, now seen corresponding path program 1 times [2019-09-10 08:37:59,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:59,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:59,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:59,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:59,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:00,531 INFO L134 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:38:00,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:00,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:38:00,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:00,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:38:00,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:38:00,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:38:00,532 INFO L87 Difference]: Start difference. First operand 668 states and 834 transitions. Second operand 14 states. [2019-09-10 08:38:01,312 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-10 08:38:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:01,848 INFO L93 Difference]: Finished difference Result 1090 states and 1433 transitions. [2019-09-10 08:38:01,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:01,848 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 123 [2019-09-10 08:38:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:01,850 INFO L225 Difference]: With dead ends: 1090 [2019-09-10 08:38:01,850 INFO L226 Difference]: Without dead ends: 1090 [2019-09-10 08:38:01,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:38:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-09-10 08:38:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 620. [2019-09-10 08:38:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 08:38:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 774 transitions. [2019-09-10 08:38:01,857 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 774 transitions. Word has length 123 [2019-09-10 08:38:01,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:01,857 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 774 transitions. [2019-09-10 08:38:01,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:38:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 774 transitions. [2019-09-10 08:38:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:38:01,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:01,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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:01,858 INFO L418 AbstractCegarLoop]: === Iteration 159 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1757262501, now seen corresponding path program 1 times [2019-09-10 08:38:01,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:01,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:01,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:02,658 INFO L134 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:38:02,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:02,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:38:02,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:02,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:38:02,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:38:02,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:38:02,659 INFO L87 Difference]: Start difference. First operand 620 states and 774 transitions. Second operand 17 states. [2019-09-10 08:38:03,372 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 08:38:03,515 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-10 08:38:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:05,403 INFO L93 Difference]: Finished difference Result 1303 states and 1737 transitions. [2019-09-10 08:38:05,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:38:05,403 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 123 [2019-09-10 08:38:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:05,405 INFO L225 Difference]: With dead ends: 1303 [2019-09-10 08:38:05,405 INFO L226 Difference]: Without dead ends: 1303 [2019-09-10 08:38:05,405 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:38:05,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2019-09-10 08:38:05,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 614. [2019-09-10 08:38:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-10 08:38:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 764 transitions. [2019-09-10 08:38:05,412 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 764 transitions. Word has length 123 [2019-09-10 08:38:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:05,412 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 764 transitions. [2019-09-10 08:38:05,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:38:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 764 transitions. [2019-09-10 08:38:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:38:05,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:05,413 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:05,413 INFO L418 AbstractCegarLoop]: === Iteration 160 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:05,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:05,414 INFO L82 PathProgramCache]: Analyzing trace with hash 970951858, now seen corresponding path program 1 times [2019-09-10 08:38:05,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:05,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:05,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:05,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:05,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:05,749 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-09-10 08:38:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:06,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:06,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:38:06,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:06,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:38:06,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:38:06,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:38:06,152 INFO L87 Difference]: Start difference. First operand 614 states and 764 transitions. Second operand 13 states. [2019-09-10 08:38:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:07,222 INFO L93 Difference]: Finished difference Result 2264 states and 3140 transitions. [2019-09-10 08:38:07,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:38:07,222 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2019-09-10 08:38:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:07,225 INFO L225 Difference]: With dead ends: 2264 [2019-09-10 08:38:07,225 INFO L226 Difference]: Without dead ends: 2264 [2019-09-10 08:38:07,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:38:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2019-09-10 08:38:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 515. [2019-09-10 08:38:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-09-10 08:38:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 644 transitions. [2019-09-10 08:38:07,234 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 644 transitions. Word has length 123 [2019-09-10 08:38:07,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:07,235 INFO L475 AbstractCegarLoop]: Abstraction has 515 states and 644 transitions. [2019-09-10 08:38:07,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:38:07,235 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 644 transitions. [2019-09-10 08:38:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:38:07,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:07,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:07,236 INFO L418 AbstractCegarLoop]: === Iteration 161 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:07,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:07,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1385336425, now seen corresponding path program 1 times [2019-09-10 08:38:07,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:07,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:07,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:07,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:07,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:07,629 INFO L134 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:38:07,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:07,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:38:07,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:07,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:38:07,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:38:07,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:38:07,630 INFO L87 Difference]: Start difference. First operand 515 states and 644 transitions. Second operand 12 states. [2019-09-10 08:38:08,071 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 08:38:08,195 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 08:38:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:08,826 INFO L93 Difference]: Finished difference Result 1559 states and 2141 transitions. [2019-09-10 08:38:08,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:38:08,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 123 [2019-09-10 08:38:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:08,828 INFO L225 Difference]: With dead ends: 1559 [2019-09-10 08:38:08,828 INFO L226 Difference]: Without dead ends: 1559 [2019-09-10 08:38:08,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:38:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2019-09-10 08:38:08,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 442. [2019-09-10 08:38:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-10 08:38:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 555 transitions. [2019-09-10 08:38:08,835 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 555 transitions. Word has length 123 [2019-09-10 08:38:08,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:08,835 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 555 transitions. [2019-09-10 08:38:08,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:38:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 555 transitions. [2019-09-10 08:38:08,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:38:08,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:08,836 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:08,836 INFO L418 AbstractCegarLoop]: === Iteration 162 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:08,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:08,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1516793557, now seen corresponding path program 1 times [2019-09-10 08:38:08,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:08,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:08,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:08,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:08,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:09,626 INFO L134 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:38:09,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:09,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:38:09,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:09,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:38:09,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:38:09,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:38:09,627 INFO L87 Difference]: Start difference. First operand 442 states and 555 transitions. Second operand 17 states. [2019-09-10 08:38:10,767 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-09-10 08:38:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:11,555 INFO L93 Difference]: Finished difference Result 686 states and 890 transitions. [2019-09-10 08:38:11,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:38:11,556 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 123 [2019-09-10 08:38:11,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:11,557 INFO L225 Difference]: With dead ends: 686 [2019-09-10 08:38:11,557 INFO L226 Difference]: Without dead ends: 686 [2019-09-10 08:38:11,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:38:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-09-10 08:38:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 428. [2019-09-10 08:38:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-10 08:38:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 538 transitions. [2019-09-10 08:38:11,561 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 538 transitions. Word has length 123 [2019-09-10 08:38:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:11,561 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 538 transitions. [2019-09-10 08:38:11,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:38:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 538 transitions. [2019-09-10 08:38:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:38:11,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:11,562 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:11,562 INFO L418 AbstractCegarLoop]: === Iteration 163 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:11,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:11,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1421470918, now seen corresponding path program 1 times [2019-09-10 08:38:11,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:11,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:11,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:11,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:11,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:11,986 INFO L134 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:38:11,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:11,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:38:11,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:11,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:38:11,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:38:11,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:38:11,988 INFO L87 Difference]: Start difference. First operand 428 states and 538 transitions. Second operand 12 states. [2019-09-10 08:38:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:12,543 INFO L93 Difference]: Finished difference Result 629 states and 832 transitions. [2019-09-10 08:38:12,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:38:12,544 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 123 [2019-09-10 08:38:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:12,545 INFO L225 Difference]: With dead ends: 629 [2019-09-10 08:38:12,545 INFO L226 Difference]: Without dead ends: 629 [2019-09-10 08:38:12,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:38:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-10 08:38:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 365. [2019-09-10 08:38:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-09-10 08:38:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 468 transitions. [2019-09-10 08:38:12,549 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 468 transitions. Word has length 123 [2019-09-10 08:38:12,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:12,549 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 468 transitions. [2019-09-10 08:38:12,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:38:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 468 transitions. [2019-09-10 08:38:12,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:38:12,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:12,550 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:12,550 INFO L418 AbstractCegarLoop]: === Iteration 164 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:12,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:12,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1280768765, now seen corresponding path program 1 times [2019-09-10 08:38:12,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:12,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:12,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:12,743 INFO L134 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:38:12,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:12,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:12,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:12,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:12,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:12,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:12,744 INFO L87 Difference]: Start difference. First operand 365 states and 468 transitions. Second operand 9 states. [2019-09-10 08:38:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:13,587 INFO L93 Difference]: Finished difference Result 567 states and 758 transitions. [2019-09-10 08:38:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:38:13,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:38:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:13,589 INFO L225 Difference]: With dead ends: 567 [2019-09-10 08:38:13,589 INFO L226 Difference]: Without dead ends: 567 [2019-09-10 08:38:13,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:38:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-10 08:38:13,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 365. [2019-09-10 08:38:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-09-10 08:38:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 467 transitions. [2019-09-10 08:38:13,592 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 467 transitions. Word has length 123 [2019-09-10 08:38:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:13,592 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 467 transitions. [2019-09-10 08:38:13,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 467 transitions. [2019-09-10 08:38:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:38:13,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:13,593 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:13,594 INFO L418 AbstractCegarLoop]: === Iteration 165 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:13,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:13,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1758065791, now seen corresponding path program 1 times [2019-09-10 08:38:13,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:13,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:13,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:13,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:13,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:14,309 INFO L134 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:38:14,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:14,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:38:14,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:14,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:38:14,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:38:14,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:38:14,311 INFO L87 Difference]: Start difference. First operand 365 states and 467 transitions. Second operand 16 states. [2019-09-10 08:38:15,039 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 08:38:15,179 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:38:15,319 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:38:15,466 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 08:38:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:16,493 INFO L93 Difference]: Finished difference Result 1267 states and 1791 transitions. [2019-09-10 08:38:16,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:38:16,493 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 124 [2019-09-10 08:38:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:16,494 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 08:38:16,494 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 08:38:16,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:38:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 08:38:16,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 365. [2019-09-10 08:38:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-09-10 08:38:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 466 transitions. [2019-09-10 08:38:16,501 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 466 transitions. Word has length 124 [2019-09-10 08:38:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:16,501 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 466 transitions. [2019-09-10 08:38:16,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:38:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 466 transitions. [2019-09-10 08:38:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:38:16,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:16,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:16,502 INFO L418 AbstractCegarLoop]: === Iteration 166 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:16,502 INFO L82 PathProgramCache]: Analyzing trace with hash -671962513, now seen corresponding path program 1 times [2019-09-10 08:38:16,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:16,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:16,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:16,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:16,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:16,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:38:16,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:16,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:38:16,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:16,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:38:16,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:38:16,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:38:16,907 INFO L87 Difference]: Start difference. First operand 365 states and 466 transitions. Second operand 11 states. [2019-09-10 08:38:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:18,050 INFO L93 Difference]: Finished difference Result 1263 states and 1787 transitions. [2019-09-10 08:38:18,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:38:18,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 125 [2019-09-10 08:38:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:18,052 INFO L225 Difference]: With dead ends: 1263 [2019-09-10 08:38:18,052 INFO L226 Difference]: Without dead ends: 1263 [2019-09-10 08:38:18,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:38:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2019-09-10 08:38:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 359. [2019-09-10 08:38:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-10 08:38:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 460 transitions. [2019-09-10 08:38:18,074 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 460 transitions. Word has length 125 [2019-09-10 08:38:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:18,074 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 460 transitions. [2019-09-10 08:38:18,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:38:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 460 transitions. [2019-09-10 08:38:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:38:18,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:18,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:18,075 INFO L418 AbstractCegarLoop]: === Iteration 167 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:18,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash -778842694, now seen corresponding path program 1 times [2019-09-10 08:38:18,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:18,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:18,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:18,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:18,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:18,526 INFO L134 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:38:18,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:18,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:38:18,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:18,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:38:18,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:38:18,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:38:18,527 INFO L87 Difference]: Start difference. First operand 359 states and 460 transitions. Second operand 12 states. [2019-09-10 08:38:18,990 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:38:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:19,763 INFO L93 Difference]: Finished difference Result 1131 states and 1586 transitions. [2019-09-10 08:38:19,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:38:19,763 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2019-09-10 08:38:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:19,765 INFO L225 Difference]: With dead ends: 1131 [2019-09-10 08:38:19,765 INFO L226 Difference]: Without dead ends: 1131 [2019-09-10 08:38:19,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:38:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2019-09-10 08:38:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 341. [2019-09-10 08:38:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-10 08:38:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 440 transitions. [2019-09-10 08:38:19,771 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 440 transitions. Word has length 125 [2019-09-10 08:38:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:19,772 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 440 transitions. [2019-09-10 08:38:19,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:38:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 440 transitions. [2019-09-10 08:38:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 08:38:19,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:19,772 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:19,773 INFO L418 AbstractCegarLoop]: === Iteration 168 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:19,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:19,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1169571528, now seen corresponding path program 1 times [2019-09-10 08:38:19,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:19,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:19,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:19,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:19,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:19,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:38:19,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:19,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:19,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:19,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:19,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:19,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:19,872 INFO L87 Difference]: Start difference. First operand 341 states and 440 transitions. Second operand 3 states. [2019-09-10 08:38:19,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:19,907 INFO L93 Difference]: Finished difference Result 499 states and 672 transitions. [2019-09-10 08:38:19,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:19,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-10 08:38:19,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:19,908 INFO L225 Difference]: With dead ends: 499 [2019-09-10 08:38:19,908 INFO L226 Difference]: Without dead ends: 499 [2019-09-10 08:38:19,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:19,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-10 08:38:19,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2019-09-10 08:38:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-09-10 08:38:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 671 transitions. [2019-09-10 08:38:19,913 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 671 transitions. Word has length 159 [2019-09-10 08:38:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:19,913 INFO L475 AbstractCegarLoop]: Abstraction has 497 states and 671 transitions. [2019-09-10 08:38:19,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:38:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 671 transitions. [2019-09-10 08:38:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:38:19,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:19,914 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:19,914 INFO L418 AbstractCegarLoop]: === Iteration 169 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:19,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:19,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1559158062, now seen corresponding path program 1 times [2019-09-10 08:38:19,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:19,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:19,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:19,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:19,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:20,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:20,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:38:20,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:20,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:38:20,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:38:20,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:38:20,040 INFO L87 Difference]: Start difference. First operand 497 states and 671 transitions. Second operand 7 states. [2019-09-10 08:38:20,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:20,592 INFO L93 Difference]: Finished difference Result 1727 states and 2482 transitions. [2019-09-10 08:38:20,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:38:20,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-10 08:38:20,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:20,594 INFO L225 Difference]: With dead ends: 1727 [2019-09-10 08:38:20,594 INFO L226 Difference]: Without dead ends: 1727 [2019-09-10 08:38:20,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:38:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2019-09-10 08:38:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 857. [2019-09-10 08:38:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-09-10 08:38:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1207 transitions. [2019-09-10 08:38:20,604 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1207 transitions. Word has length 161 [2019-09-10 08:38:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:20,604 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1207 transitions. [2019-09-10 08:38:20,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:38:20,604 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1207 transitions. [2019-09-10 08:38:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:38:20,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:20,605 INFO L418 AbstractCegarLoop]: === Iteration 170 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:20,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:20,605 INFO L82 PathProgramCache]: Analyzing trace with hash -247233192, now seen corresponding path program 1 times [2019-09-10 08:38:20,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:20,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:20,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:20,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:20,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:20,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:20,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:38:20,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:20,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:38:20,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:38:20,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:38:20,741 INFO L87 Difference]: Start difference. First operand 857 states and 1207 transitions. Second operand 7 states. [2019-09-10 08:38:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:21,315 INFO L93 Difference]: Finished difference Result 3271 states and 4754 transitions. [2019-09-10 08:38:21,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:38:21,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-10 08:38:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:21,318 INFO L225 Difference]: With dead ends: 3271 [2019-09-10 08:38:21,318 INFO L226 Difference]: Without dead ends: 3271 [2019-09-10 08:38:21,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:38:21,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2019-09-10 08:38:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 1617. [2019-09-10 08:38:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2019-09-10 08:38:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2335 transitions. [2019-09-10 08:38:21,333 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2335 transitions. Word has length 161 [2019-09-10 08:38:21,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:21,334 INFO L475 AbstractCegarLoop]: Abstraction has 1617 states and 2335 transitions. [2019-09-10 08:38:21,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:38:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2335 transitions. [2019-09-10 08:38:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:38:21,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:21,335 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:21,335 INFO L418 AbstractCegarLoop]: === Iteration 171 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:21,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1326460766, now seen corresponding path program 1 times [2019-09-10 08:38:21,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:21,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:21,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:21,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:21,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:38:21,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:21,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:38:21,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:38:21,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:38:21,462 INFO L87 Difference]: Start difference. First operand 1617 states and 2335 transitions. Second operand 7 states. [2019-09-10 08:38:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:22,049 INFO L93 Difference]: Finished difference Result 6359 states and 9282 transitions. [2019-09-10 08:38:22,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:38:22,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-10 08:38:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:22,055 INFO L225 Difference]: With dead ends: 6359 [2019-09-10 08:38:22,056 INFO L226 Difference]: Without dead ends: 6359 [2019-09-10 08:38:22,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:38:22,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6359 states. [2019-09-10 08:38:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6359 to 3217. [2019-09-10 08:38:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2019-09-10 08:38:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4703 transitions. [2019-09-10 08:38:22,091 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4703 transitions. Word has length 161 [2019-09-10 08:38:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:22,091 INFO L475 AbstractCegarLoop]: Abstraction has 3217 states and 4703 transitions. [2019-09-10 08:38:22,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:38:22,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4703 transitions. [2019-09-10 08:38:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:38:22,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:22,092 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:22,092 INFO L418 AbstractCegarLoop]: === Iteration 172 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:22,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1747419995, now seen corresponding path program 1 times [2019-09-10 08:38:22,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:22,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:22,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:22,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:22,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:22,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:22,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:22,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:22,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:22,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:22,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:22,192 INFO L87 Difference]: Start difference. First operand 3217 states and 4703 transitions. Second operand 3 states. [2019-09-10 08:38:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:22,243 INFO L93 Difference]: Finished difference Result 4771 states and 6984 transitions. [2019-09-10 08:38:22,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:22,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-10 08:38:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:22,249 INFO L225 Difference]: With dead ends: 4771 [2019-09-10 08:38:22,249 INFO L226 Difference]: Without dead ends: 4771 [2019-09-10 08:38:22,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:22,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4771 states. [2019-09-10 08:38:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4771 to 4769. [2019-09-10 08:38:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4769 states. [2019-09-10 08:38:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4769 states to 4769 states and 6983 transitions. [2019-09-10 08:38:22,284 INFO L78 Accepts]: Start accepts. Automaton has 4769 states and 6983 transitions. Word has length 161 [2019-09-10 08:38:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:22,284 INFO L475 AbstractCegarLoop]: Abstraction has 4769 states and 6983 transitions. [2019-09-10 08:38:22,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:38:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4769 states and 6983 transitions. [2019-09-10 08:38:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:38:22,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:22,286 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:22,286 INFO L418 AbstractCegarLoop]: === Iteration 173 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:22,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1037232346, now seen corresponding path program 1 times [2019-09-10 08:38:22,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:22,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:22,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:22,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:22,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:22,372 INFO L134 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:38:22,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:22,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:22,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:22,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:22,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:22,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:22,374 INFO L87 Difference]: Start difference. First operand 4769 states and 6983 transitions. Second operand 3 states. [2019-09-10 08:38:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:22,420 INFO L93 Difference]: Finished difference Result 9091 states and 13216 transitions. [2019-09-10 08:38:22,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:22,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-10 08:38:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:22,427 INFO L225 Difference]: With dead ends: 9091 [2019-09-10 08:38:22,427 INFO L226 Difference]: Without dead ends: 9091 [2019-09-10 08:38:22,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9091 states. [2019-09-10 08:38:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9091 to 9041. [2019-09-10 08:38:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9041 states. [2019-09-10 08:38:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9041 states to 9041 states and 13167 transitions. [2019-09-10 08:38:22,530 INFO L78 Accepts]: Start accepts. Automaton has 9041 states and 13167 transitions. Word has length 161 [2019-09-10 08:38:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:22,531 INFO L475 AbstractCegarLoop]: Abstraction has 9041 states and 13167 transitions. [2019-09-10 08:38:22,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:38:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 9041 states and 13167 transitions. [2019-09-10 08:38:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:38:22,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:22,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:22,533 INFO L418 AbstractCegarLoop]: === Iteration 174 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:22,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:22,534 INFO L82 PathProgramCache]: Analyzing trace with hash 335880420, now seen corresponding path program 1 times [2019-09-10 08:38:22,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:22,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:22,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:22,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:22,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:22,655 INFO L134 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:38:22,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:22,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:38:22,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:22,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:38:22,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:38:22,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:38:22,656 INFO L87 Difference]: Start difference. First operand 9041 states and 13167 transitions. Second operand 7 states. [2019-09-10 08:38:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:23,254 INFO L93 Difference]: Finished difference Result 36215 states and 52290 transitions. [2019-09-10 08:38:23,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:38:23,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-10 08:38:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:23,286 INFO L225 Difference]: With dead ends: 36215 [2019-09-10 08:38:23,286 INFO L226 Difference]: Without dead ends: 36215 [2019-09-10 08:38:23,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:38:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36215 states. [2019-09-10 08:38:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36215 to 18865. [2019-09-10 08:38:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18865 states. [2019-09-10 08:38:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18865 states to 18865 states and 27487 transitions. [2019-09-10 08:38:23,507 INFO L78 Accepts]: Start accepts. Automaton has 18865 states and 27487 transitions. Word has length 161 [2019-09-10 08:38:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:23,507 INFO L475 AbstractCegarLoop]: Abstraction has 18865 states and 27487 transitions. [2019-09-10 08:38:23,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:38:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand 18865 states and 27487 transitions. [2019-09-10 08:38:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:38:23,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:23,511 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:23,511 INFO L418 AbstractCegarLoop]: === Iteration 175 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:23,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:23,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1123350580, now seen corresponding path program 1 times [2019-09-10 08:38:23,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:23,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:23,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:23,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:23,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:23,631 INFO L134 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:38:23,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:23,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:38:23,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:23,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:38:23,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:38:23,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:38:23,632 INFO L87 Difference]: Start difference. First operand 18865 states and 27487 transitions. Second operand 7 states. [2019-09-10 08:38:24,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:24,300 INFO L93 Difference]: Finished difference Result 70263 states and 101666 transitions. [2019-09-10 08:38:24,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:38:24,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-10 08:38:24,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:24,367 INFO L225 Difference]: With dead ends: 70263 [2019-09-10 08:38:24,368 INFO L226 Difference]: Without dead ends: 70263 [2019-09-10 08:38:24,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:38:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70263 states. [2019-09-10 08:38:24,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70263 to 39473. [2019-09-10 08:38:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39473 states. [2019-09-10 08:38:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39473 states to 39473 states and 57471 transitions. [2019-09-10 08:38:24,820 INFO L78 Accepts]: Start accepts. Automaton has 39473 states and 57471 transitions. Word has length 161 [2019-09-10 08:38:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:24,821 INFO L475 AbstractCegarLoop]: Abstraction has 39473 states and 57471 transitions. [2019-09-10 08:38:24,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:38:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 39473 states and 57471 transitions. [2019-09-10 08:38:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 08:38:24,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:24,827 INFO L418 AbstractCegarLoop]: === Iteration 176 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:24,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:24,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1478282170, now seen corresponding path program 1 times [2019-09-10 08:38:24,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:24,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:24,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:24,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:24,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:24,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:24,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:24,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:38:24,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:24,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:38:24,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:38:24,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:38:24,950 INFO L87 Difference]: Start difference. First operand 39473 states and 57471 transitions. Second operand 7 states. [2019-09-10 08:38:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:26,613 INFO L93 Difference]: Finished difference Result 115443 states and 167196 transitions. [2019-09-10 08:38:26,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:38:26,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-10 08:38:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:26,727 INFO L225 Difference]: With dead ends: 115443 [2019-09-10 08:38:26,727 INFO L226 Difference]: Without dead ends: 115443 [2019-09-10 08:38:26,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:38:26,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115443 states. [2019-09-10 08:38:27,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115443 to 63665. [2019-09-10 08:38:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63665 states. [2019-09-10 08:38:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63665 states to 63665 states and 92703 transitions. [2019-09-10 08:38:27,491 INFO L78 Accepts]: Start accepts. Automaton has 63665 states and 92703 transitions. Word has length 161 [2019-09-10 08:38:27,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:27,491 INFO L475 AbstractCegarLoop]: Abstraction has 63665 states and 92703 transitions. [2019-09-10 08:38:27,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:38:27,492 INFO L276 IsEmpty]: Start isEmpty. Operand 63665 states and 92703 transitions. [2019-09-10 08:38:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 08:38:27,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:27,497 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:27,497 INFO L418 AbstractCegarLoop]: === Iteration 177 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:27,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1159845228, now seen corresponding path program 1 times [2019-09-10 08:38:27,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:27,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:27,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:27,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:27,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:27,578 INFO L134 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:38:27,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:27,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:27,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:27,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:27,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:27,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:27,579 INFO L87 Difference]: Start difference. First operand 63665 states and 92703 transitions. Second operand 3 states. [2019-09-10 08:38:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:27,742 INFO L93 Difference]: Finished difference Result 70323 states and 101952 transitions. [2019-09-10 08:38:27,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:27,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-09-10 08:38:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:27,811 INFO L225 Difference]: With dead ends: 70323 [2019-09-10 08:38:27,811 INFO L226 Difference]: Without dead ends: 70323 [2019-09-10 08:38:27,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70323 states. [2019-09-10 08:38:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70323 to 69937. [2019-09-10 08:38:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69937 states. [2019-09-10 08:38:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69937 states to 69937 states and 101503 transitions. [2019-09-10 08:38:30,384 INFO L78 Accepts]: Start accepts. Automaton has 69937 states and 101503 transitions. Word has length 162 [2019-09-10 08:38:30,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:30,384 INFO L475 AbstractCegarLoop]: Abstraction has 69937 states and 101503 transitions. [2019-09-10 08:38:30,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:38:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 69937 states and 101503 transitions. [2019-09-10 08:38:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 08:38:30,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:30,390 INFO L418 AbstractCegarLoop]: === Iteration 178 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:30,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:30,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1183389190, now seen corresponding path program 1 times [2019-09-10 08:38:30,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:30,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:30,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:30,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:30,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:30,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:30,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:38:30,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:30,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:38:30,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:38:30,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:38:30,512 INFO L87 Difference]: Start difference. First operand 69937 states and 101503 transitions. Second operand 7 states. [2019-09-10 08:38:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:31,227 INFO L93 Difference]: Finished difference Result 145463 states and 209090 transitions. [2019-09-10 08:38:31,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:38:31,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 162 [2019-09-10 08:38:31,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:31,384 INFO L225 Difference]: With dead ends: 145463 [2019-09-10 08:38:31,384 INFO L226 Difference]: Without dead ends: 145463 [2019-09-10 08:38:31,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:38:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145463 states. [2019-09-10 08:38:32,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145463 to 78897. [2019-09-10 08:38:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78897 states. [2019-09-10 08:38:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78897 states to 78897 states and 113471 transitions. [2019-09-10 08:38:32,362 INFO L78 Accepts]: Start accepts. Automaton has 78897 states and 113471 transitions. Word has length 162 [2019-09-10 08:38:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:32,362 INFO L475 AbstractCegarLoop]: Abstraction has 78897 states and 113471 transitions. [2019-09-10 08:38:32,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:38:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 78897 states and 113471 transitions. [2019-09-10 08:38:32,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 08:38:32,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:32,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:32,367 INFO L418 AbstractCegarLoop]: === Iteration 179 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:32,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:32,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1723722371, now seen corresponding path program 1 times [2019-09-10 08:38:32,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:32,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:32,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:32,484 INFO L134 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:38:32,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:32,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:38:32,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:32,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:38:32,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:38:32,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:38:32,485 INFO L87 Difference]: Start difference. First operand 78897 states and 113471 transitions. Second operand 6 states. [2019-09-10 08:38:33,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:33,136 INFO L93 Difference]: Finished difference Result 126139 states and 178586 transitions. [2019-09-10 08:38:33,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:38:33,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-09-10 08:38:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:33,268 INFO L225 Difference]: With dead ends: 126139 [2019-09-10 08:38:33,268 INFO L226 Difference]: Without dead ends: 126139 [2019-09-10 08:38:33,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:33,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126139 states. [2019-09-10 08:38:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126139 to 79665. [2019-09-10 08:38:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79665 states. [2019-09-10 08:38:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79665 states to 79665 states and 113983 transitions. [2019-09-10 08:38:34,125 INFO L78 Accepts]: Start accepts. Automaton has 79665 states and 113983 transitions. Word has length 162 [2019-09-10 08:38:34,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:34,125 INFO L475 AbstractCegarLoop]: Abstraction has 79665 states and 113983 transitions. [2019-09-10 08:38:34,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:38:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 79665 states and 113983 transitions. [2019-09-10 08:38:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 08:38:34,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:34,130 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:34,130 INFO L418 AbstractCegarLoop]: === Iteration 180 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:34,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1208570425, now seen corresponding path program 1 times [2019-09-10 08:38:34,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:34,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:34,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:34,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:34,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:34,221 INFO L134 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:38:34,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:34,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:34,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:34,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:34,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:34,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:34,222 INFO L87 Difference]: Start difference. First operand 79665 states and 113983 transitions. Second operand 3 states. [2019-09-10 08:38:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:34,372 INFO L93 Difference]: Finished difference Result 76019 states and 107904 transitions. [2019-09-10 08:38:34,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:34,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-10 08:38:34,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:34,440 INFO L225 Difference]: With dead ends: 76019 [2019-09-10 08:38:34,440 INFO L226 Difference]: Without dead ends: 76019 [2019-09-10 08:38:34,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76019 states. [2019-09-10 08:38:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76019 to 68817. [2019-09-10 08:38:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68817 states. [2019-09-10 08:38:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68817 states to 68817 states and 97871 transitions. [2019-09-10 08:38:37,116 INFO L78 Accepts]: Start accepts. Automaton has 68817 states and 97871 transitions. Word has length 163 [2019-09-10 08:38:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:37,116 INFO L475 AbstractCegarLoop]: Abstraction has 68817 states and 97871 transitions. [2019-09-10 08:38:37,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:38:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 68817 states and 97871 transitions. [2019-09-10 08:38:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 08:38:37,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:37,119 INFO L418 AbstractCegarLoop]: === Iteration 181 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:37,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:37,119 INFO L82 PathProgramCache]: Analyzing trace with hash 337003315, now seen corresponding path program 1 times [2019-09-10 08:38:37,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:37,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:37,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:37,237 INFO L134 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:38:37,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:37,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:37,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:37,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:37,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:37,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:37,238 INFO L87 Difference]: Start difference. First operand 68817 states and 97871 transitions. Second operand 3 states. [2019-09-10 08:38:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:37,471 INFO L93 Difference]: Finished difference Result 117619 states and 166944 transitions. [2019-09-10 08:38:37,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:37,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-10 08:38:37,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:37,590 INFO L225 Difference]: With dead ends: 117619 [2019-09-10 08:38:37,590 INFO L226 Difference]: Without dead ends: 117619 [2019-09-10 08:38:37,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117619 states. [2019-09-10 08:38:38,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117619 to 86049. [2019-09-10 08:38:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86049 states. [2019-09-10 08:38:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86049 states to 86049 states and 122583 transitions. [2019-09-10 08:38:38,467 INFO L78 Accepts]: Start accepts. Automaton has 86049 states and 122583 transitions. Word has length 164 [2019-09-10 08:38:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:38,467 INFO L475 AbstractCegarLoop]: Abstraction has 86049 states and 122583 transitions. [2019-09-10 08:38:38,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:38:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 86049 states and 122583 transitions. [2019-09-10 08:38:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 08:38:38,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:38,469 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:38,469 INFO L418 AbstractCegarLoop]: === Iteration 182 === [mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:38,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:38,469 INFO L82 PathProgramCache]: Analyzing trace with hash 425140660, now seen corresponding path program 1 times [2019-09-10 08:38:38,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:38,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:38,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:38,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:38,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:38,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:38,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:38:38,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:38,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:38:38,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:38:38,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:38,558 INFO L87 Difference]: Start difference. First operand 86049 states and 122583 transitions. Second operand 3 states. [2019-09-10 08:38:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:38,715 INFO L93 Difference]: Finished difference Result 81227 states and 114544 transitions. [2019-09-10 08:38:38,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:38:38,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-10 08:38:38,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:38,789 INFO L225 Difference]: With dead ends: 81227 [2019-09-10 08:38:38,789 INFO L226 Difference]: Without dead ends: 81227 [2019-09-10 08:38:38,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:38:38,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81227 states.