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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:32:45,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:32:45,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:32:45,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:32:45,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:32:45,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:32:45,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:32:45,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:32:45,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:32:45,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:32:45,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:32:45,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:32:45,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:32:45,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:32:45,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:32:45,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:32:45,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:32:45,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:32:45,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:32:45,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:32:45,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:32:45,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:32:45,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:32:45,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:32:45,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:32:45,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:32:45,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:32:45,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:32:45,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:32:45,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:32:45,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:32:45,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:32:45,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:32:45,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:32:45,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:32:45,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:32:45,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:32:45,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:32:45,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:32:45,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:32:45,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:32:45,602 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:32:45,619 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:32:45,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:32:45,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:32:45,620 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:32:45,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:32:45,621 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:32:45,621 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:32:45,621 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:32:45,622 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:32:45,622 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:32:45,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:32:45,623 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:32:45,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:32:45,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:32:45,624 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:32:45,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:32:45,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:32:45,625 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:32:45,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:32:45,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:32:45,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:32:45,626 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:32:45,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:32:45,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:32:45,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:32:45,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:32:45,626 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:32:45,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:32:45,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:32:45,627 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:32:45,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:32:45,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:32:45,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:32:45,677 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:32:45,677 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:32:45,678 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:32:45,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4ca616c/36ee811601d74ab194fb9e79c43b10a3/FLAG4a6878b60 [2019-09-10 08:32:46,770 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:32:46,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:32:46,839 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4ca616c/36ee811601d74ab194fb9e79c43b10a3/FLAG4a6878b60 [2019-09-10 08:32:47,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4ca616c/36ee811601d74ab194fb9e79c43b10a3 [2019-09-10 08:32:47,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:32:47,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:32:47,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:32:47,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:32:47,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:32:47,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:32:47" (1/1) ... [2019-09-10 08:32:47,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@427c24f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:47, skipping insertion in model container [2019-09-10 08:32:47,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:32:47" (1/1) ... [2019-09-10 08:32:47,138 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:32:47,560 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:32:51,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:32:51,163 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:32:53,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:32:53,536 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:32:53,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:53 WrapperNode [2019-09-10 08:32:53,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:32:53,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:32:53,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:32:53,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:32:53,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:53" (1/1) ... [2019-09-10 08:32:53,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:53" (1/1) ... [2019-09-10 08:32:53,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:53" (1/1) ... [2019-09-10 08:32:53,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:53" (1/1) ... [2019-09-10 08:32:53,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:53" (1/1) ... [2019-09-10 08:32:53,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:53" (1/1) ... [2019-09-10 08:32:53,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:53" (1/1) ... [2019-09-10 08:32:54,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:32:54,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:32:54,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:32:54,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:32:54,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:53" (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:32:54,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:32:54,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:32:54,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:32:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:32:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:32:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:32:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:32:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:32:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:32:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:32:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:32:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:32:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:32:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:32:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:32:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:32:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:32:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:32:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-10 08:32:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:32:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:32:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:32:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:32:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:33:04,962 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:33:04,962 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:33:04,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:33:04 BoogieIcfgContainer [2019-09-10 08:33:04,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:33:04,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:33:04,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:33:04,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:33:04,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:32:47" (1/3) ... [2019-09-10 08:33:04,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24603559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:33:04, skipping insertion in model container [2019-09-10 08:33:04,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:53" (2/3) ... [2019-09-10 08:33:04,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24603559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:33:04, skipping insertion in model container [2019-09-10 08:33:04,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:33:04" (3/3) ... [2019-09-10 08:33:04,974 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:33:04,985 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:33:04,996 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-09-10 08:33:05,013 INFO L252 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-09-10 08:33:05,040 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:33:05,041 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:33:05,041 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:33:05,041 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:33:05,041 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:33:05,041 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:33:05,041 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:33:05,042 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:33:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states. [2019-09-10 08:33:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:33:05,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:05,177 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,180 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:05,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:05,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1910714295, now seen corresponding path program 1 times [2019-09-10 08:33:05,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:05,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:05,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:05,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:05,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:06,155 INFO L134 CoverageAnalysis]: 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,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:06,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:06,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:06,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:06,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:06,183 INFO L87 Difference]: Start difference. First operand 3859 states. Second operand 5 states. [2019-09-10 08:33:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:10,170 INFO L93 Difference]: Finished difference Result 3843 states and 6720 transitions. [2019-09-10 08:33:10,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:10,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-10 08:33:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:10,211 INFO L225 Difference]: With dead ends: 3843 [2019-09-10 08:33:10,211 INFO L226 Difference]: Without dead ends: 3831 [2019-09-10 08:33:10,213 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:33:10,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3831 states. [2019-09-10 08:33:10,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 3705. [2019-09-10 08:33:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3705 states. [2019-09-10 08:33:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 5056 transitions. [2019-09-10 08:33:10,390 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 5056 transitions. Word has length 120 [2019-09-10 08:33:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:10,391 INFO L475 AbstractCegarLoop]: Abstraction has 3705 states and 5056 transitions. [2019-09-10 08:33:10,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 5056 transitions. [2019-09-10 08:33:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:33:10,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:10,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, 1, 1] [2019-09-10 08:33:10,406 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:10,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:10,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2069207436, now seen corresponding path program 1 times [2019-09-10 08:33:10,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:10,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:10,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:10,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:10,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:10,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:10,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:10,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:10,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:10,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:10,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:10,721 INFO L87 Difference]: Start difference. First operand 3705 states and 5056 transitions. Second operand 5 states. [2019-09-10 08:33:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:13,958 INFO L93 Difference]: Finished difference Result 3385 states and 4670 transitions. [2019-09-10 08:33:13,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:13,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-10 08:33:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:13,973 INFO L225 Difference]: With dead ends: 3385 [2019-09-10 08:33:13,974 INFO L226 Difference]: Without dead ends: 3385 [2019-09-10 08:33:13,975 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:33:13,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2019-09-10 08:33:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3385. [2019-09-10 08:33:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2019-09-10 08:33:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4670 transitions. [2019-09-10 08:33:14,053 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4670 transitions. Word has length 121 [2019-09-10 08:33:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:14,055 INFO L475 AbstractCegarLoop]: Abstraction has 3385 states and 4670 transitions. [2019-09-10 08:33:14,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4670 transitions. [2019-09-10 08:33:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:33:14,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:14,067 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,068 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:14,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:14,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1671511983, now seen corresponding path program 1 times [2019-09-10 08:33:14,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:14,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:14,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:14,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:14,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:14,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:33:14,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:14,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:14,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:14,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:14,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:14,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:14,398 INFO L87 Difference]: Start difference. First operand 3385 states and 4670 transitions. Second operand 5 states. [2019-09-10 08:33:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:16,469 INFO L93 Difference]: Finished difference Result 3036 states and 4287 transitions. [2019-09-10 08:33:16,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:16,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-10 08:33:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:16,486 INFO L225 Difference]: With dead ends: 3036 [2019-09-10 08:33:16,486 INFO L226 Difference]: Without dead ends: 3036 [2019-09-10 08:33:16,487 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:33:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2019-09-10 08:33:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 3036. [2019-09-10 08:33:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3036 states. [2019-09-10 08:33:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 4287 transitions. [2019-09-10 08:33:16,547 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 4287 transitions. Word has length 122 [2019-09-10 08:33:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:16,548 INFO L475 AbstractCegarLoop]: Abstraction has 3036 states and 4287 transitions. [2019-09-10 08:33:16,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 4287 transitions. [2019-09-10 08:33:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:33:16,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:16,556 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,557 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:16,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:16,558 INFO L82 PathProgramCache]: Analyzing trace with hash -949726882, now seen corresponding path program 1 times [2019-09-10 08:33:16,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:16,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:16,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:16,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:16,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:16,824 INFO L134 CoverageAnalysis]: 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:16,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:16,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:16,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:16,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:16,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:16,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:16,826 INFO L87 Difference]: Start difference. First operand 3036 states and 4287 transitions. Second operand 5 states. [2019-09-10 08:33:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:18,929 INFO L93 Difference]: Finished difference Result 2908 states and 4141 transitions. [2019-09-10 08:33:18,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:18,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-09-10 08:33:18,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:18,946 INFO L225 Difference]: With dead ends: 2908 [2019-09-10 08:33:18,946 INFO L226 Difference]: Without dead ends: 2908 [2019-09-10 08:33:18,947 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:33:18,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2019-09-10 08:33:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2019-09-10 08:33:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2908 states. [2019-09-10 08:33:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 4141 transitions. [2019-09-10 08:33:19,005 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 4141 transitions. Word has length 123 [2019-09-10 08:33:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:19,006 INFO L475 AbstractCegarLoop]: Abstraction has 2908 states and 4141 transitions. [2019-09-10 08:33:19,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 4141 transitions. [2019-09-10 08:33:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:33:19,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:19,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,014 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:19,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:19,015 INFO L82 PathProgramCache]: Analyzing trace with hash 939412243, now seen corresponding path program 1 times [2019-09-10 08:33:19,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:19,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:19,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:19,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:19,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:19,330 INFO L134 CoverageAnalysis]: 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:19,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:19,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:19,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:19,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:19,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:19,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:19,333 INFO L87 Difference]: Start difference. First operand 2908 states and 4141 transitions. Second operand 5 states. [2019-09-10 08:33:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:21,226 INFO L93 Difference]: Finished difference Result 2802 states and 4025 transitions. [2019-09-10 08:33:21,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:21,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-09-10 08:33:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:21,241 INFO L225 Difference]: With dead ends: 2802 [2019-09-10 08:33:21,241 INFO L226 Difference]: Without dead ends: 2802 [2019-09-10 08:33:21,242 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:33:21,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2019-09-10 08:33:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2802. [2019-09-10 08:33:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2019-09-10 08:33:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4025 transitions. [2019-09-10 08:33:21,299 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4025 transitions. Word has length 124 [2019-09-10 08:33:21,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:21,299 INFO L475 AbstractCegarLoop]: Abstraction has 2802 states and 4025 transitions. [2019-09-10 08:33:21,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4025 transitions. [2019-09-10 08:33:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:33:21,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:21,311 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:21,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash 499065082, now seen corresponding path program 1 times [2019-09-10 08:33:21,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:21,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:21,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:21,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:21,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:21,602 INFO L134 CoverageAnalysis]: 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,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:21,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:21,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:21,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:21,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:21,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:21,604 INFO L87 Difference]: Start difference. First operand 2802 states and 4025 transitions. Second operand 5 states. [2019-09-10 08:33:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:23,362 INFO L93 Difference]: Finished difference Result 2752 states and 3969 transitions. [2019-09-10 08:33:23,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:23,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-09-10 08:33:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:23,377 INFO L225 Difference]: With dead ends: 2752 [2019-09-10 08:33:23,377 INFO L226 Difference]: Without dead ends: 2752 [2019-09-10 08:33:23,377 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:33:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2019-09-10 08:33:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2752. [2019-09-10 08:33:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2752 states. [2019-09-10 08:33:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 3969 transitions. [2019-09-10 08:33:23,429 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 3969 transitions. Word has length 125 [2019-09-10 08:33:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:23,429 INFO L475 AbstractCegarLoop]: Abstraction has 2752 states and 3969 transitions. [2019-09-10 08:33:23,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3969 transitions. [2019-09-10 08:33:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:33:23,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:23,437 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,438 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:23,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:23,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2041572273, now seen corresponding path program 1 times [2019-09-10 08:33:23,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:23,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:23,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:23,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:23,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:23,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:33:23,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:23,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:23,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:23,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:23,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:23,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:23,711 INFO L87 Difference]: Start difference. First operand 2752 states and 3969 transitions. Second operand 5 states. [2019-09-10 08:33:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:25,511 INFO L93 Difference]: Finished difference Result 2721 states and 3934 transitions. [2019-09-10 08:33:25,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:25,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 08:33:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:25,524 INFO L225 Difference]: With dead ends: 2721 [2019-09-10 08:33:25,524 INFO L226 Difference]: Without dead ends: 2721 [2019-09-10 08:33:25,525 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:33:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2019-09-10 08:33:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2721. [2019-09-10 08:33:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2721 states. [2019-09-10 08:33:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3934 transitions. [2019-09-10 08:33:25,575 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3934 transitions. Word has length 126 [2019-09-10 08:33:25,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:25,576 INFO L475 AbstractCegarLoop]: Abstraction has 2721 states and 3934 transitions. [2019-09-10 08:33:25,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:25,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3934 transitions. [2019-09-10 08:33:25,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:33:25,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:25,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,584 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:25,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1952897350, now seen corresponding path program 1 times [2019-09-10 08:33:25,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:25,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:25,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:25,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:25,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:25,834 INFO L134 CoverageAnalysis]: 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,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:25,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:25,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:25,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:25,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:25,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:25,836 INFO L87 Difference]: Start difference. First operand 2721 states and 3934 transitions. Second operand 5 states. [2019-09-10 08:33:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:27,655 INFO L93 Difference]: Finished difference Result 2710 states and 3920 transitions. [2019-09-10 08:33:27,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:33:27,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-09-10 08:33:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:27,667 INFO L225 Difference]: With dead ends: 2710 [2019-09-10 08:33:27,668 INFO L226 Difference]: Without dead ends: 2710 [2019-09-10 08:33:27,668 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:33:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2019-09-10 08:33:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2710. [2019-09-10 08:33:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:33:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3920 transitions. [2019-09-10 08:33:27,717 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3920 transitions. Word has length 127 [2019-09-10 08:33:27,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:27,717 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3920 transitions. [2019-09-10 08:33:27,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3920 transitions. [2019-09-10 08:33:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:33:27,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:27,724 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,725 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:27,725 INFO L82 PathProgramCache]: Analyzing trace with hash 694993039, now seen corresponding path program 1 times [2019-09-10 08:33:27,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:27,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:27,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:28,184 INFO L134 CoverageAnalysis]: 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:28,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:28,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:33:28,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:28,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:33:28,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:33:28,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:33:28,187 INFO L87 Difference]: Start difference. First operand 2710 states and 3920 transitions. Second operand 8 states. [2019-09-10 08:33:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:32,300 INFO L93 Difference]: Finished difference Result 3374 states and 4674 transitions. [2019-09-10 08:33:32,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:33:32,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2019-09-10 08:33:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:32,316 INFO L225 Difference]: With dead ends: 3374 [2019-09-10 08:33:32,316 INFO L226 Difference]: Without dead ends: 3374 [2019-09-10 08:33:32,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:33:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3374 states. [2019-09-10 08:33:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3374 to 2710. [2019-09-10 08:33:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:33:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3919 transitions. [2019-09-10 08:33:32,370 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3919 transitions. Word has length 128 [2019-09-10 08:33:32,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:32,370 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3919 transitions. [2019-09-10 08:33:32,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:33:32,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3919 transitions. [2019-09-10 08:33:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:33:32,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:32,378 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:32,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:32,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1069101216, now seen corresponding path program 1 times [2019-09-10 08:33:32,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:32,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:32,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:32,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:32,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:32,716 INFO L134 CoverageAnalysis]: 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,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:32,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:32,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:32,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:32,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:32,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:32,720 INFO L87 Difference]: Start difference. First operand 2710 states and 3919 transitions. Second operand 9 states. [2019-09-10 08:33:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:38,212 INFO L93 Difference]: Finished difference Result 4558 states and 6596 transitions. [2019-09-10 08:33:38,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:38,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-10 08:33:38,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:38,223 INFO L225 Difference]: With dead ends: 4558 [2019-09-10 08:33:38,223 INFO L226 Difference]: Without dead ends: 4558 [2019-09-10 08:33:38,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:33:38,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-10 08:33:38,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-10 08:33:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:33:38,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3918 transitions. [2019-09-10 08:33:38,282 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3918 transitions. Word has length 128 [2019-09-10 08:33:38,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:38,282 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3918 transitions. [2019-09-10 08:33:38,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3918 transitions. [2019-09-10 08:33:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:33:38,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:38,288 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,289 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:38,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:38,290 INFO L82 PathProgramCache]: Analyzing trace with hash -839566570, now seen corresponding path program 1 times [2019-09-10 08:33:38,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:38,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:38,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:38,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:38,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:38,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:33:38,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:38,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:38,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:38,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:38,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:38,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:38,608 INFO L87 Difference]: Start difference. First operand 2710 states and 3918 transitions. Second operand 9 states. [2019-09-10 08:33:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:44,693 INFO L93 Difference]: Finished difference Result 3187 states and 4628 transitions. [2019-09-10 08:33:44,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:33:44,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-10 08:33:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:44,702 INFO L225 Difference]: With dead ends: 3187 [2019-09-10 08:33:44,702 INFO L226 Difference]: Without dead ends: 3187 [2019-09-10 08:33:44,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:33:44,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states. [2019-09-10 08:33:44,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 2710. [2019-09-10 08:33:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:33:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3917 transitions. [2019-09-10 08:33:44,748 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3917 transitions. Word has length 128 [2019-09-10 08:33:44,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:44,749 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3917 transitions. [2019-09-10 08:33:44,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3917 transitions. [2019-09-10 08:33:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:33:44,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:44,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:44,756 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:44,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:44,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1345754422, now seen corresponding path program 1 times [2019-09-10 08:33:44,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:44,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:44,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:44,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:44,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:45,093 INFO L134 CoverageAnalysis]: 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:45,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:45,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:45,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:45,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:45,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:45,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:45,095 INFO L87 Difference]: Start difference. First operand 2710 states and 3917 transitions. Second operand 9 states. [2019-09-10 08:33:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:52,270 INFO L93 Difference]: Finished difference Result 4594 states and 6653 transitions. [2019-09-10 08:33:52,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:52,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-10 08:33:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:52,283 INFO L225 Difference]: With dead ends: 4594 [2019-09-10 08:33:52,283 INFO L226 Difference]: Without dead ends: 4594 [2019-09-10 08:33:52,284 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:52,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2019-09-10 08:33:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 2710. [2019-09-10 08:33:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:33:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3915 transitions. [2019-09-10 08:33:52,336 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3915 transitions. Word has length 130 [2019-09-10 08:33:52,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:52,337 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3915 transitions. [2019-09-10 08:33:52,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3915 transitions. [2019-09-10 08:33:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:33:52,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:52,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,344 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:52,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:52,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2143106549, now seen corresponding path program 1 times [2019-09-10 08:33:52,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:52,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:52,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:52,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:52,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:52,654 INFO L134 CoverageAnalysis]: 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:52,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:52,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:52,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:52,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:52,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:52,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:52,656 INFO L87 Difference]: Start difference. First operand 2710 states and 3915 transitions. Second operand 9 states. [2019-09-10 08:33:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:59,434 INFO L93 Difference]: Finished difference Result 4558 states and 6591 transitions. [2019-09-10 08:33:59,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:33:59,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-10 08:33:59,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:59,444 INFO L225 Difference]: With dead ends: 4558 [2019-09-10 08:33:59,444 INFO L226 Difference]: Without dead ends: 4558 [2019-09-10 08:33:59,445 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:33:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-10 08:33:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-10 08:33:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:33:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3913 transitions. [2019-09-10 08:33:59,496 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3913 transitions. Word has length 130 [2019-09-10 08:33:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:59,497 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3913 transitions. [2019-09-10 08:33:59,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:33:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3913 transitions. [2019-09-10 08:33:59,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:33:59,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:59,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:59,506 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:59,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:59,506 INFO L82 PathProgramCache]: Analyzing trace with hash 462471382, now seen corresponding path program 1 times [2019-09-10 08:33:59,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:59,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:59,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:59,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:59,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:59,816 INFO L134 CoverageAnalysis]: 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:59,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:59,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:33:59,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:59,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:33:59,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:33:59,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:33:59,818 INFO L87 Difference]: Start difference. First operand 2710 states and 3913 transitions. Second operand 9 states. [2019-09-10 08:34:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:05,654 INFO L93 Difference]: Finished difference Result 3187 states and 4622 transitions. [2019-09-10 08:34:05,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:34:05,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-10 08:34:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:05,660 INFO L225 Difference]: With dead ends: 3187 [2019-09-10 08:34:05,660 INFO L226 Difference]: Without dead ends: 3187 [2019-09-10 08:34:05,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:34:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states. [2019-09-10 08:34:05,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 2710. [2019-09-10 08:34:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:34:05,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3911 transitions. [2019-09-10 08:34:05,700 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3911 transitions. Word has length 130 [2019-09-10 08:34:05,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:05,701 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3911 transitions. [2019-09-10 08:34:05,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3911 transitions. [2019-09-10 08:34:05,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:34:05,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:05,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,707 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:05,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1538510824, now seen corresponding path program 1 times [2019-09-10 08:34:05,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:05,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:05,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:05,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:05,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:06,038 INFO L134 CoverageAnalysis]: 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:06,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:06,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:06,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:06,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:06,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:06,039 INFO L87 Difference]: Start difference. First operand 2710 states and 3911 transitions. Second operand 9 states. [2019-09-10 08:34:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:13,611 INFO L93 Difference]: Finished difference Result 4594 states and 6648 transitions. [2019-09-10 08:34:13,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:13,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-10 08:34:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:13,617 INFO L225 Difference]: With dead ends: 4594 [2019-09-10 08:34:13,617 INFO L226 Difference]: Without dead ends: 4594 [2019-09-10 08:34:13,617 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:34:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2019-09-10 08:34:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 2710. [2019-09-10 08:34:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:34:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3910 transitions. [2019-09-10 08:34:13,664 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3910 transitions. Word has length 130 [2019-09-10 08:34:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:13,665 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3910 transitions. [2019-09-10 08:34:13,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3910 transitions. [2019-09-10 08:34:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:34:13,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:13,673 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:13,674 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:13,674 INFO L82 PathProgramCache]: Analyzing trace with hash 275679986, now seen corresponding path program 1 times [2019-09-10 08:34:13,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:13,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:13,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:13,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:13,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:13,989 INFO L134 CoverageAnalysis]: 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,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:13,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:13,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:13,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:13,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:13,993 INFO L87 Difference]: Start difference. First operand 2710 states and 3910 transitions. Second operand 9 states. [2019-09-10 08:34:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:21,054 INFO L93 Difference]: Finished difference Result 4558 states and 6587 transitions. [2019-09-10 08:34:21,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:21,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-10 08:34:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:21,061 INFO L225 Difference]: With dead ends: 4558 [2019-09-10 08:34:21,061 INFO L226 Difference]: Without dead ends: 4558 [2019-09-10 08:34:21,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:34:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-10 08:34:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-10 08:34:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:34:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3909 transitions. [2019-09-10 08:34:21,107 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3909 transitions. Word has length 130 [2019-09-10 08:34:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:21,108 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3909 transitions. [2019-09-10 08:34:21,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3909 transitions. [2019-09-10 08:34:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:34:21,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:21,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,114 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:21,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:21,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2003857804, now seen corresponding path program 1 times [2019-09-10 08:34:21,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:21,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:21,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:21,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:21,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:21,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:21,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:21,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:21,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:21,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:21,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:21,404 INFO L87 Difference]: Start difference. First operand 2710 states and 3909 transitions. Second operand 9 states. [2019-09-10 08:34:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:28,625 INFO L93 Difference]: Finished difference Result 4558 states and 6586 transitions. [2019-09-10 08:34:28,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:28,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-10 08:34:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:28,632 INFO L225 Difference]: With dead ends: 4558 [2019-09-10 08:34:28,632 INFO L226 Difference]: Without dead ends: 4558 [2019-09-10 08:34:28,633 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:34:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-10 08:34:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-10 08:34:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:34:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3908 transitions. [2019-09-10 08:34:28,678 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3908 transitions. Word has length 130 [2019-09-10 08:34:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:28,679 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3908 transitions. [2019-09-10 08:34:28,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3908 transitions. [2019-09-10 08:34:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:34:28,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:28,685 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:28,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash -153710255, now seen corresponding path program 1 times [2019-09-10 08:34:28,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:28,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:28,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:28,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:28,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:28,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:28,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:28,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:28,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:28,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:28,969 INFO L87 Difference]: Start difference. First operand 2710 states and 3908 transitions. Second operand 9 states. [2019-09-10 08:34:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:36,799 INFO L93 Difference]: Finished difference Result 4594 states and 6643 transitions. [2019-09-10 08:34:36,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:36,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-10 08:34:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:36,805 INFO L225 Difference]: With dead ends: 4594 [2019-09-10 08:34:36,805 INFO L226 Difference]: Without dead ends: 4594 [2019-09-10 08:34:36,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:34:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2019-09-10 08:34:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 2710. [2019-09-10 08:34:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:34:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3907 transitions. [2019-09-10 08:34:36,846 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3907 transitions. Word has length 130 [2019-09-10 08:34:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:36,847 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3907 transitions. [2019-09-10 08:34:36,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3907 transitions. [2019-09-10 08:34:36,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:34:36,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:36,853 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:36,854 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:36,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:36,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1726560325, now seen corresponding path program 1 times [2019-09-10 08:34:36,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:36,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:36,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:36,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:36,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:37,179 INFO L134 CoverageAnalysis]: 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:37,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:37,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:37,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:37,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:37,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:37,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:37,182 INFO L87 Difference]: Start difference. First operand 2710 states and 3907 transitions. Second operand 9 states. [2019-09-10 08:34:44,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:44,373 INFO L93 Difference]: Finished difference Result 4534 states and 6542 transitions. [2019-09-10 08:34:44,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:44,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:34:44,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:44,379 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:34:44,379 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:34:44,380 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:44,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:34:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:34:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:34:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3905 transitions. [2019-09-10 08:34:44,420 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3905 transitions. Word has length 132 [2019-09-10 08:34:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:44,421 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3905 transitions. [2019-09-10 08:34:44,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3905 transitions. [2019-09-10 08:34:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:34:44,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:44,425 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,425 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:44,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:44,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1662178282, now seen corresponding path program 1 times [2019-09-10 08:34:44,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:44,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:44,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:44,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:44,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:44,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:44,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:44,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:44,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:44,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:44,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:44,708 INFO L87 Difference]: Start difference. First operand 2710 states and 3905 transitions. Second operand 9 states. [2019-09-10 08:34:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:52,248 INFO L93 Difference]: Finished difference Result 4558 states and 6581 transitions. [2019-09-10 08:34:52,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:52,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:34:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:52,253 INFO L225 Difference]: With dead ends: 4558 [2019-09-10 08:34:52,254 INFO L226 Difference]: Without dead ends: 4558 [2019-09-10 08:34:52,254 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:34:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-10 08:34:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-10 08:34:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:34:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3903 transitions. [2019-09-10 08:34:52,294 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3903 transitions. Word has length 132 [2019-09-10 08:34:52,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:52,294 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3903 transitions. [2019-09-10 08:34:52,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3903 transitions. [2019-09-10 08:34:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:34:52,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:52,299 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,299 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:52,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:52,300 INFO L82 PathProgramCache]: Analyzing trace with hash -26279808, now seen corresponding path program 1 times [2019-09-10 08:34:52,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:52,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:52,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:52,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:52,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:52,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:52,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:52,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:52,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:52,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:52,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:52,590 INFO L87 Difference]: Start difference. First operand 2710 states and 3903 transitions. Second operand 9 states. [2019-09-10 08:34:58,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:58,826 INFO L93 Difference]: Finished difference Result 4558 states and 6577 transitions. [2019-09-10 08:34:58,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:58,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:34:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:58,831 INFO L225 Difference]: With dead ends: 4558 [2019-09-10 08:34:58,831 INFO L226 Difference]: Without dead ends: 4558 [2019-09-10 08:34:58,832 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:34:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-10 08:34:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-10 08:34:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:34:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3901 transitions. [2019-09-10 08:34:58,858 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3901 transitions. Word has length 132 [2019-09-10 08:34:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:58,858 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3901 transitions. [2019-09-10 08:34:58,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:34:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3901 transitions. [2019-09-10 08:34:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:34:58,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:58,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,862 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:58,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:58,863 INFO L82 PathProgramCache]: Analyzing trace with hash -830173217, now seen corresponding path program 1 times [2019-09-10 08:34:58,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:58,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:58,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:58,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:58,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:59,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:59,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:34:59,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:59,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:34:59,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:34:59,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:34:59,139 INFO L87 Difference]: Start difference. First operand 2710 states and 3901 transitions. Second operand 9 states. [2019-09-10 08:35:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:06,880 INFO L93 Difference]: Finished difference Result 4594 states and 6627 transitions. [2019-09-10 08:35:06,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:06,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:35:06,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:06,890 INFO L225 Difference]: With dead ends: 4594 [2019-09-10 08:35:06,890 INFO L226 Difference]: Without dead ends: 4594 [2019-09-10 08:35:06,890 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:35:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2019-09-10 08:35:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 2710. [2019-09-10 08:35:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:35:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3899 transitions. [2019-09-10 08:35:06,938 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3899 transitions. Word has length 132 [2019-09-10 08:35:06,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:06,938 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3899 transitions. [2019-09-10 08:35:06,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:06,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3899 transitions. [2019-09-10 08:35:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:35:06,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:06,943 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:06,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:06,943 INFO L82 PathProgramCache]: Analyzing trace with hash 211463443, now seen corresponding path program 1 times [2019-09-10 08:35:06,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:06,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:06,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:06,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:06,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:07,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:07,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:07,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:07,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:07,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:07,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:07,310 INFO L87 Difference]: Start difference. First operand 2710 states and 3899 transitions. Second operand 9 states. [2019-09-10 08:35:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:14,947 INFO L93 Difference]: Finished difference Result 4534 states and 6532 transitions. [2019-09-10 08:35:14,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:14,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:35:14,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:14,953 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:35:14,953 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:35:14,954 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:35:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:35:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:35:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:35:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3897 transitions. [2019-09-10 08:35:14,986 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3897 transitions. Word has length 132 [2019-09-10 08:35:14,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:14,986 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3897 transitions. [2019-09-10 08:35:14,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3897 transitions. [2019-09-10 08:35:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:35:14,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:14,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:14,990 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:14,990 INFO L82 PathProgramCache]: Analyzing trace with hash 119954600, now seen corresponding path program 1 times [2019-09-10 08:35:14,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:14,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:14,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:14,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:14,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:15,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:15,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:15,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:15,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:15,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:15,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:15,330 INFO L87 Difference]: Start difference. First operand 2710 states and 3897 transitions. Second operand 9 states. [2019-09-10 08:35:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:22,955 INFO L93 Difference]: Finished difference Result 4534 states and 6530 transitions. [2019-09-10 08:35:22,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:22,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:35:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:22,961 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:35:22,961 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:35:22,962 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:35:22,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:35:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:35:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:35:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3895 transitions. [2019-09-10 08:35:22,994 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3895 transitions. Word has length 132 [2019-09-10 08:35:22,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:22,995 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3895 transitions. [2019-09-10 08:35:22,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3895 transitions. [2019-09-10 08:35:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:35:22,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:22,999 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,000 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:23,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:23,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1481055458, now seen corresponding path program 1 times [2019-09-10 08:35:23,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:23,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:23,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:23,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:23,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:23,272 INFO L134 CoverageAnalysis]: 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:23,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:23,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:23,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:23,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:23,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:23,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:23,274 INFO L87 Difference]: Start difference. First operand 2710 states and 3895 transitions. Second operand 9 states. [2019-09-10 08:35:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:31,004 INFO L93 Difference]: Finished difference Result 4534 states and 6528 transitions. [2019-09-10 08:35:31,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:31,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:35:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:31,016 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:35:31,016 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:35:31,016 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:35:31,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:35:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:35:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:35:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3893 transitions. [2019-09-10 08:35:31,060 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3893 transitions. Word has length 132 [2019-09-10 08:35:31,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:31,060 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3893 transitions. [2019-09-10 08:35:31,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3893 transitions. [2019-09-10 08:35:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:35:31,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:31,069 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,070 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:31,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:31,070 INFO L82 PathProgramCache]: Analyzing trace with hash -737415581, now seen corresponding path program 1 times [2019-09-10 08:35:31,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:31,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:31,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:31,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:31,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:31,362 INFO L134 CoverageAnalysis]: 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:31,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:31,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:31,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:31,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:31,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:31,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:31,365 INFO L87 Difference]: Start difference. First operand 2710 states and 3893 transitions. Second operand 9 states. [2019-09-10 08:35:39,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:39,221 INFO L93 Difference]: Finished difference Result 4558 states and 6563 transitions. [2019-09-10 08:35:39,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:39,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:35:39,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:39,227 INFO L225 Difference]: With dead ends: 4558 [2019-09-10 08:35:39,227 INFO L226 Difference]: Without dead ends: 4558 [2019-09-10 08:35:39,227 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:35:39,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-10 08:35:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-10 08:35:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:35:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3891 transitions. [2019-09-10 08:35:39,258 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3891 transitions. Word has length 132 [2019-09-10 08:35:39,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:39,258 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3891 transitions. [2019-09-10 08:35:39,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:39,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3891 transitions. [2019-09-10 08:35:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:35:39,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:39,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:39,261 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:39,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:39,261 INFO L82 PathProgramCache]: Analyzing trace with hash 719530290, now seen corresponding path program 1 times [2019-09-10 08:35:39,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:39,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:39,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:39,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:39,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:39,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:39,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:39,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:39,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:39,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:39,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:39,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:39,520 INFO L87 Difference]: Start difference. First operand 2710 states and 3891 transitions. Second operand 9 states. [2019-09-10 08:35:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:47,328 INFO L93 Difference]: Finished difference Result 4534 states and 6524 transitions. [2019-09-10 08:35:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:47,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:35:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:47,335 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:35:47,335 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:35:47,335 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:35:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:35:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:35:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:35:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3890 transitions. [2019-09-10 08:35:47,368 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3890 transitions. Word has length 132 [2019-09-10 08:35:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:47,369 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3890 transitions. [2019-09-10 08:35:47,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3890 transitions. [2019-09-10 08:35:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:35:47,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:47,372 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:47,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:47,372 INFO L82 PathProgramCache]: Analyzing trace with hash -66884006, now seen corresponding path program 1 times [2019-09-10 08:35:47,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:47,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:47,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:47,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:47,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:47,710 INFO L134 CoverageAnalysis]: 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:47,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:47,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:47,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:47,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:47,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:47,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:47,712 INFO L87 Difference]: Start difference. First operand 2710 states and 3890 transitions. Second operand 9 states. [2019-09-10 08:35:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:55,447 INFO L93 Difference]: Finished difference Result 4534 states and 6523 transitions. [2019-09-10 08:35:55,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:35:55,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:35:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:55,453 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:35:55,453 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:35:55,453 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:35:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:35:55,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:35:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:35:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3889 transitions. [2019-09-10 08:35:55,481 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3889 transitions. Word has length 132 [2019-09-10 08:35:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:55,482 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3889 transitions. [2019-09-10 08:35:55,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3889 transitions. [2019-09-10 08:35:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:35:55,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:55,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,484 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:55,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1801895648, now seen corresponding path program 1 times [2019-09-10 08:35:55,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:55,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:55,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:55,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:55,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:55,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:55,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:55,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:55,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:55,756 INFO L87 Difference]: Start difference. First operand 2710 states and 3889 transitions. Second operand 9 states. [2019-09-10 08:36:03,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:03,532 INFO L93 Difference]: Finished difference Result 4534 states and 6521 transitions. [2019-09-10 08:36:03,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:03,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:36:03,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:03,538 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:36:03,538 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:36:03,539 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:36:03,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:36:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:36:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:36:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3888 transitions. [2019-09-10 08:36:03,567 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3888 transitions. Word has length 132 [2019-09-10 08:36:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:03,567 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3888 transitions. [2019-09-10 08:36:03,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3888 transitions. [2019-09-10 08:36:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:36:03,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:03,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,569 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:03,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:03,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1708108863, now seen corresponding path program 1 times [2019-09-10 08:36:03,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:03,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:03,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:03,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:03,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:03,810 INFO L134 CoverageAnalysis]: 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:03,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:03,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:03,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:03,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:03,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:03,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:03,812 INFO L87 Difference]: Start difference. First operand 2710 states and 3888 transitions. Second operand 9 states. [2019-09-10 08:36:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:10,415 INFO L93 Difference]: Finished difference Result 4534 states and 6520 transitions. [2019-09-10 08:36:10,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:10,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:36:10,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:10,421 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:36:10,421 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:36:10,421 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:36:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:36:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:36:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:36:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3887 transitions. [2019-09-10 08:36:10,459 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3887 transitions. Word has length 132 [2019-09-10 08:36:10,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:10,459 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3887 transitions. [2019-09-10 08:36:10,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3887 transitions. [2019-09-10 08:36:10,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:36:10,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:10,463 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:10,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:10,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1993031987, now seen corresponding path program 1 times [2019-09-10 08:36:10,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:10,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:10,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:10,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:10,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:10,710 INFO L134 CoverageAnalysis]: 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:10,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:10,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:10,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:10,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:10,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:10,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:10,712 INFO L87 Difference]: Start difference. First operand 2710 states and 3887 transitions. Second operand 9 states. [2019-09-10 08:36:16,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:16,475 INFO L93 Difference]: Finished difference Result 4390 states and 6270 transitions. [2019-09-10 08:36:16,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:16,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:36:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:16,481 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:36:16,481 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:36:16,481 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:36:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:36:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:36:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:36:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3886 transitions. [2019-09-10 08:36:16,510 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3886 transitions. Word has length 132 [2019-09-10 08:36:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:16,510 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3886 transitions. [2019-09-10 08:36:16,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3886 transitions. [2019-09-10 08:36:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:36:16,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:16,512 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:16,513 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:16,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:16,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1821851494, now seen corresponding path program 1 times [2019-09-10 08:36:16,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:16,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:16,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:16,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:16,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:16,780 INFO L134 CoverageAnalysis]: 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,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:16,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:16,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:16,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:16,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:16,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:16,783 INFO L87 Difference]: Start difference. First operand 2710 states and 3886 transitions. Second operand 9 states. [2019-09-10 08:36:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:23,441 INFO L93 Difference]: Finished difference Result 4558 states and 6553 transitions. [2019-09-10 08:36:23,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:23,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:36:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:23,446 INFO L225 Difference]: With dead ends: 4558 [2019-09-10 08:36:23,447 INFO L226 Difference]: Without dead ends: 4558 [2019-09-10 08:36:23,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:36:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-10 08:36:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-10 08:36:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:36:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3885 transitions. [2019-09-10 08:36:23,478 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3885 transitions. Word has length 132 [2019-09-10 08:36:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:23,478 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3885 transitions. [2019-09-10 08:36:23,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3885 transitions. [2019-09-10 08:36:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:36:23,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:23,481 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:23,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1086803298, now seen corresponding path program 1 times [2019-09-10 08:36:23,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:23,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:23,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:23,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:23,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:23,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:23,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:23,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:23,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:23,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:23,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:23,698 INFO L87 Difference]: Start difference. First operand 2710 states and 3885 transitions. Second operand 9 states. [2019-09-10 08:36:29,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:29,374 INFO L93 Difference]: Finished difference Result 4390 states and 6267 transitions. [2019-09-10 08:36:29,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:29,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:36:29,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:29,380 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:36:29,380 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:36:29,381 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:36:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:36:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:36:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:36:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3884 transitions. [2019-09-10 08:36:29,410 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3884 transitions. Word has length 132 [2019-09-10 08:36:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:29,410 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3884 transitions. [2019-09-10 08:36:29,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3884 transitions. [2019-09-10 08:36:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:36:29,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:29,413 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash 113248819, now seen corresponding path program 1 times [2019-09-10 08:36:29,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:29,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:29,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:29,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:29,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:29,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:36:29,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:29,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:29,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:29,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:29,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:29,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:29,724 INFO L87 Difference]: Start difference. First operand 2710 states and 3884 transitions. Second operand 9 states. [2019-09-10 08:36:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:36,675 INFO L93 Difference]: Finished difference Result 4534 states and 6514 transitions. [2019-09-10 08:36:36,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:36,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:36:36,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:36,682 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:36:36,682 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:36:36,682 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:36:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:36:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:36:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:36:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3883 transitions. [2019-09-10 08:36:36,716 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3883 transitions. Word has length 132 [2019-09-10 08:36:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:36,717 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3883 transitions. [2019-09-10 08:36:36,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3883 transitions. [2019-09-10 08:36:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:36:36,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:36,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,720 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:36,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:36,721 INFO L82 PathProgramCache]: Analyzing trace with hash 121315274, now seen corresponding path program 1 times [2019-09-10 08:36:36,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:36,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:36,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:36,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:36,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:36,963 INFO L134 CoverageAnalysis]: 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:36,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:36,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:36,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:36,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:36,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:36,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:36,965 INFO L87 Difference]: Start difference. First operand 2710 states and 3883 transitions. Second operand 9 states. [2019-09-10 08:36:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:44,495 INFO L93 Difference]: Finished difference Result 4534 states and 6513 transitions. [2019-09-10 08:36:44,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:44,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 08:36:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:44,501 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:36:44,501 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:36:44,502 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:36:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:36:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:36:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:36:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3882 transitions. [2019-09-10 08:36:44,530 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3882 transitions. Word has length 132 [2019-09-10 08:36:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:44,530 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3882 transitions. [2019-09-10 08:36:44,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3882 transitions. [2019-09-10 08:36:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:36:44,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:44,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] [2019-09-10 08:36:44,533 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:44,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:44,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1229319912, now seen corresponding path program 1 times [2019-09-10 08:36:44,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:44,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:44,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:44,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:44,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:44,774 INFO L134 CoverageAnalysis]: 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:44,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:44,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:44,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:44,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:44,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:44,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:44,776 INFO L87 Difference]: Start difference. First operand 2710 states and 3882 transitions. Second operand 9 states. [2019-09-10 08:36:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:51,826 INFO L93 Difference]: Finished difference Result 4486 states and 6432 transitions. [2019-09-10 08:36:51,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:36:51,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:36:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:51,832 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:36:51,832 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:36:51,832 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:36:51,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:36:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:36:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:36:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3880 transitions. [2019-09-10 08:36:51,862 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3880 transitions. Word has length 134 [2019-09-10 08:36:51,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:51,862 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3880 transitions. [2019-09-10 08:36:51,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:51,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3880 transitions. [2019-09-10 08:36:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:36:51,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:51,864 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,865 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash -749236097, now seen corresponding path program 1 times [2019-09-10 08:36:51,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:51,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:51,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:51,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:51,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:52,134 INFO L134 CoverageAnalysis]: 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:52,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:52,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:52,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:52,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:52,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:52,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:52,137 INFO L87 Difference]: Start difference. First operand 2710 states and 3880 transitions. Second operand 9 states. [2019-09-10 08:37:00,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:00,469 INFO L93 Difference]: Finished difference Result 4534 states and 6509 transitions. [2019-09-10 08:37:00,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:00,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:37:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:00,475 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:37:00,475 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:37:00,475 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:37:00,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:37:00,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:37:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:37:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3878 transitions. [2019-09-10 08:37:00,508 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3878 transitions. Word has length 134 [2019-09-10 08:37:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:00,509 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3878 transitions. [2019-09-10 08:37:00,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3878 transitions. [2019-09-10 08:37:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:37:00,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:00,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,513 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:00,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:00,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1527859806, now seen corresponding path program 1 times [2019-09-10 08:37:00,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:00,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:00,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:00,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:00,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:00,798 INFO L134 CoverageAnalysis]: 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:00,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:00,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:00,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:00,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:00,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:00,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:00,800 INFO L87 Difference]: Start difference. First operand 2710 states and 3878 transitions. Second operand 9 states. [2019-09-10 08:37:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:08,356 INFO L93 Difference]: Finished difference Result 4486 states and 6428 transitions. [2019-09-10 08:37:08,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:08,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:37:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:08,362 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:37:08,362 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:37:08,362 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:37:08,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:37:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:37:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:37:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3876 transitions. [2019-09-10 08:37:08,390 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3876 transitions. Word has length 134 [2019-09-10 08:37:08,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:08,390 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3876 transitions. [2019-09-10 08:37:08,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3876 transitions. [2019-09-10 08:37:08,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:37:08,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:08,392 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,393 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:08,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:08,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1087460810, now seen corresponding path program 1 times [2019-09-10 08:37:08,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:08,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:08,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:08,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:08,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:08,650 INFO L134 CoverageAnalysis]: 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:08,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:08,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:08,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:08,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:08,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:08,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:08,652 INFO L87 Difference]: Start difference. First operand 2710 states and 3876 transitions. Second operand 9 states. [2019-09-10 08:37:16,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:16,053 INFO L93 Difference]: Finished difference Result 4486 states and 6424 transitions. [2019-09-10 08:37:16,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:16,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:37:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:16,059 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:37:16,059 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:37:16,059 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:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:37:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:37:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:37:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3874 transitions. [2019-09-10 08:37:16,086 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3874 transitions. Word has length 134 [2019-09-10 08:37:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:16,086 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3874 transitions. [2019-09-10 08:37:16,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3874 transitions. [2019-09-10 08:37:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:37:16,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:16,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,089 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:16,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash -485279045, now seen corresponding path program 1 times [2019-09-10 08:37:16,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:16,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:16,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:16,354 INFO L134 CoverageAnalysis]: 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:16,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:16,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:16,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:16,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:16,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:16,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:16,356 INFO L87 Difference]: Start difference. First operand 2710 states and 3874 transitions. Second operand 9 states. [2019-09-10 08:37:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:23,651 INFO L93 Difference]: Finished difference Result 4486 states and 6422 transitions. [2019-09-10 08:37:23,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:23,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:37:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:23,657 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:37:23,658 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:37:23,658 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:37:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:37:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:37:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:37:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3872 transitions. [2019-09-10 08:37:23,699 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3872 transitions. Word has length 134 [2019-09-10 08:37:23,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:23,699 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3872 transitions. [2019-09-10 08:37:23,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3872 transitions. [2019-09-10 08:37:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:37:23,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:23,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,703 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:23,704 INFO L82 PathProgramCache]: Analyzing trace with hash -5195230, now seen corresponding path program 1 times [2019-09-10 08:37:23,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:23,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:23,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:23,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:23,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:23,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:23,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:23,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:23,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:23,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:23,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:23,949 INFO L87 Difference]: Start difference. First operand 2710 states and 3872 transitions. Second operand 9 states. [2019-09-10 08:37:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:31,931 INFO L93 Difference]: Finished difference Result 4534 states and 6497 transitions. [2019-09-10 08:37:31,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:31,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:37:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:31,938 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:37:31,938 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:37:31,938 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:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:37:31,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:37:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:37:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3870 transitions. [2019-09-10 08:37:31,977 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3870 transitions. Word has length 134 [2019-09-10 08:37:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:31,978 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3870 transitions. [2019-09-10 08:37:31,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3870 transitions. [2019-09-10 08:37:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:37:31,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:31,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,982 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:31,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:31,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1013580119, now seen corresponding path program 1 times [2019-09-10 08:37:31,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:31,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:31,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:31,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:31,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:32,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:32,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:32,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:32,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:32,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:32,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:32,213 INFO L87 Difference]: Start difference. First operand 2710 states and 3870 transitions. Second operand 9 states. [2019-09-10 08:37:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:38,075 INFO L93 Difference]: Finished difference Result 4390 states and 6249 transitions. [2019-09-10 08:37:38,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:38,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:37:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:38,085 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:37:38,085 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:37:38,086 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:37:38,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:37:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:37:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:37:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3868 transitions. [2019-09-10 08:37:38,125 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3868 transitions. Word has length 134 [2019-09-10 08:37:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:38,126 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3868 transitions. [2019-09-10 08:37:38,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3868 transitions. [2019-09-10 08:37:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:37:38,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:38,129 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,129 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1702899111, now seen corresponding path program 1 times [2019-09-10 08:37:38,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:38,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:38,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:38,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:38,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:38,352 INFO L134 CoverageAnalysis]: 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:38,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:38,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:38,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:38,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:38,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:38,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:38,354 INFO L87 Difference]: Start difference. First operand 2710 states and 3868 transitions. Second operand 9 states. [2019-09-10 08:37:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:45,835 INFO L93 Difference]: Finished difference Result 4486 states and 6414 transitions. [2019-09-10 08:37:45,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:45,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:37:45,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:45,841 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:37:45,842 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:37:45,842 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:37:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:37:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:37:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:37:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3866 transitions. [2019-09-10 08:37:45,871 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3866 transitions. Word has length 134 [2019-09-10 08:37:45,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:45,871 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3866 transitions. [2019-09-10 08:37:45,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3866 transitions. [2019-09-10 08:37:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:37:45,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:45,874 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,874 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash -450364780, now seen corresponding path program 1 times [2019-09-10 08:37:45,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:45,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:45,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:45,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:45,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:46,068 INFO L134 CoverageAnalysis]: 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,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:46,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:46,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:46,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:46,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:46,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:46,070 INFO L87 Difference]: Start difference. First operand 2710 states and 3866 transitions. Second operand 9 states. [2019-09-10 08:37:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:53,512 INFO L93 Difference]: Finished difference Result 4486 states and 6410 transitions. [2019-09-10 08:37:53,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:37:53,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:37:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:53,517 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:37:53,518 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:37:53,518 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,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:37:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:37:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:37:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3864 transitions. [2019-09-10 08:37:53,544 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3864 transitions. Word has length 134 [2019-09-10 08:37:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:53,544 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3864 transitions. [2019-09-10 08:37:53,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3864 transitions. [2019-09-10 08:37:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:37:53,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:53,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,546 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:53,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:53,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1693121103, now seen corresponding path program 1 times [2019-09-10 08:37:53,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:53,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:53,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:53,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:53,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:53,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:53,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:53,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:53,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:53,776 INFO L87 Difference]: Start difference. First operand 2710 states and 3864 transitions. Second operand 9 states. [2019-09-10 08:38:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:01,167 INFO L93 Difference]: Finished difference Result 4486 states and 6408 transitions. [2019-09-10 08:38:01,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:01,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:38:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:01,172 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:38:01,173 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:38:01,173 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:38:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:38:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:38:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:38:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3862 transitions. [2019-09-10 08:38:01,198 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3862 transitions. Word has length 134 [2019-09-10 08:38:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:01,198 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3862 transitions. [2019-09-10 08:38:01,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3862 transitions. [2019-09-10 08:38:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:38:01,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:01,200 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:01,201 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:01,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:01,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1309753994, now seen corresponding path program 1 times [2019-09-10 08:38:01,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:01,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:01,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:01,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:01,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:01,408 INFO L134 CoverageAnalysis]: 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:01,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:01,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:01,408 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:01,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:01,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:01,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:01,409 INFO L87 Difference]: Start difference. First operand 2710 states and 3862 transitions. Second operand 9 states. [2019-09-10 08:38:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:08,757 INFO L93 Difference]: Finished difference Result 4486 states and 6406 transitions. [2019-09-10 08:38:08,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:08,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:38:08,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:08,762 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:38:08,762 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:38:08,762 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:38:08,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:38:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:38:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:38:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3860 transitions. [2019-09-10 08:38:08,786 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3860 transitions. Word has length 134 [2019-09-10 08:38:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:08,786 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3860 transitions. [2019-09-10 08:38:08,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3860 transitions. [2019-09-10 08:38:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:38:08,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:08,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,790 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:08,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:08,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1999458270, now seen corresponding path program 1 times [2019-09-10 08:38:08,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:08,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:08,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:08,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:08,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:09,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:38:09,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:09,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:09,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:09,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:09,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:09,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:09,021 INFO L87 Difference]: Start difference. First operand 2710 states and 3860 transitions. Second operand 9 states. [2019-09-10 08:38:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:15,203 INFO L93 Difference]: Finished difference Result 4390 states and 6237 transitions. [2019-09-10 08:38:15,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:15,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:38:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:15,209 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:38:15,209 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:38:15,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:38:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:38:15,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:38:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:38:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3858 transitions. [2019-09-10 08:38:15,236 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3858 transitions. Word has length 134 [2019-09-10 08:38:15,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:15,236 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3858 transitions. [2019-09-10 08:38:15,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:15,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3858 transitions. [2019-09-10 08:38:15,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:38:15,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:15,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,239 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:15,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:15,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1599102211, now seen corresponding path program 1 times [2019-09-10 08:38:15,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:15,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:15,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:15,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:15,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:15,466 INFO L134 CoverageAnalysis]: 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:15,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:15,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:15,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:15,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:15,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:15,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:15,467 INFO L87 Difference]: Start difference. First operand 2710 states and 3858 transitions. Second operand 9 states. [2019-09-10 08:38:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:21,926 INFO L93 Difference]: Finished difference Result 4534 states and 6477 transitions. [2019-09-10 08:38:21,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:21,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:38:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:21,932 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:38:21,933 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:38:21,933 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:38:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:38:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:38:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:38:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3856 transitions. [2019-09-10 08:38:21,992 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3856 transitions. Word has length 134 [2019-09-10 08:38:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:21,992 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3856 transitions. [2019-09-10 08:38:21,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3856 transitions. [2019-09-10 08:38:21,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:38:21,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:21,994 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,994 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:21,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:21,995 INFO L82 PathProgramCache]: Analyzing trace with hash 947000823, now seen corresponding path program 1 times [2019-09-10 08:38:21,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:21,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:21,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:21,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:21,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:22,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:22,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:22,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:22,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:22,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:22,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:22,206 INFO L87 Difference]: Start difference. First operand 2710 states and 3856 transitions. Second operand 9 states. [2019-09-10 08:38:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:29,753 INFO L93 Difference]: Finished difference Result 4486 states and 6398 transitions. [2019-09-10 08:38:29,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:29,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:38:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:29,759 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:38:29,759 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:38:29,760 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:38:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:38:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:38:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:38:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3854 transitions. [2019-09-10 08:38:29,797 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3854 transitions. Word has length 134 [2019-09-10 08:38:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:29,797 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3854 transitions. [2019-09-10 08:38:29,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3854 transitions. [2019-09-10 08:38:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:38:29,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:29,800 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:29,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash -34998173, now seen corresponding path program 1 times [2019-09-10 08:38:29,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:29,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:29,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:29,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:29,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:30,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:38:30,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:30,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:30,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:30,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:30,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:30,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:30,009 INFO L87 Difference]: Start difference. First operand 2710 states and 3854 transitions. Second operand 9 states. [2019-09-10 08:38:37,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:37,619 INFO L93 Difference]: Finished difference Result 4486 states and 6397 transitions. [2019-09-10 08:38:37,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:37,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:38:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:37,625 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:38:37,625 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:38:37,629 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:38:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:38:37,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:38:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:38:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3853 transitions. [2019-09-10 08:38:37,661 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3853 transitions. Word has length 134 [2019-09-10 08:38:37,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:37,661 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3853 transitions. [2019-09-10 08:38:37,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3853 transitions. [2019-09-10 08:38:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:38:37,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:37,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,664 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:37,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:37,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1567687842, now seen corresponding path program 1 times [2019-09-10 08:38:37,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:37,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:37,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:37,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:37,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:37,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:37,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:37,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:37,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:37,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:37,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:37,901 INFO L87 Difference]: Start difference. First operand 2710 states and 3853 transitions. Second operand 9 states. [2019-09-10 08:38:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:45,520 INFO L93 Difference]: Finished difference Result 4486 states and 6395 transitions. [2019-09-10 08:38:45,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:45,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:38:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:45,526 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:38:45,526 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:38:45,527 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:38:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:38:45,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:38:45,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:38:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3852 transitions. [2019-09-10 08:38:45,559 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3852 transitions. Word has length 134 [2019-09-10 08:38:45,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:45,559 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3852 transitions. [2019-09-10 08:38:45,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3852 transitions. [2019-09-10 08:38:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:38:45,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:45,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:38:45,565 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1487039590, now seen corresponding path program 1 times [2019-09-10 08:38:45,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:45,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:45,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:45,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:45,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:45,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:45,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:45,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:45,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:45,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:45,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:45,762 INFO L87 Difference]: Start difference. First operand 2710 states and 3852 transitions. Second operand 9 states. [2019-09-10 08:38:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:52,157 INFO L93 Difference]: Finished difference Result 4486 states and 6393 transitions. [2019-09-10 08:38:52,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:52,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:38:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:52,164 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:38:52,164 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:38:52,164 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:38:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:38:52,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:38:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:38:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3851 transitions. [2019-09-10 08:38:52,202 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3851 transitions. Word has length 134 [2019-09-10 08:38:52,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:52,202 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3851 transitions. [2019-09-10 08:38:52,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3851 transitions. [2019-09-10 08:38:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:38:52,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:52,204 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,204 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:52,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:52,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1097686206, now seen corresponding path program 1 times [2019-09-10 08:38:52,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:52,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:52,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:52,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:52,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:52,387 INFO L134 CoverageAnalysis]: 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:52,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:52,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:52,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:52,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:52,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:52,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:52,388 INFO L87 Difference]: Start difference. First operand 2710 states and 3851 transitions. Second operand 9 states. [2019-09-10 08:38:58,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:38:58,200 INFO L93 Difference]: Finished difference Result 4390 states and 6228 transitions. [2019-09-10 08:38:58,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:38:58,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:38:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:38:58,206 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:38:58,206 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:38:58,207 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:38:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:38:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:38:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:38:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3850 transitions. [2019-09-10 08:38:58,236 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3850 transitions. Word has length 134 [2019-09-10 08:38:58,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:38:58,236 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3850 transitions. [2019-09-10 08:38:58,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:38:58,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3850 transitions. [2019-09-10 08:38:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:38:58,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:38:58,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,239 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:38:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:38:58,239 INFO L82 PathProgramCache]: Analyzing trace with hash 410645156, now seen corresponding path program 1 times [2019-09-10 08:38:58,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:38:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:58,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:38:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:38:58,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:38:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:38:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:38:58,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:38:58,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:38:58,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:38:58,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:38:58,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:38:58,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:38:58,480 INFO L87 Difference]: Start difference. First operand 2710 states and 3850 transitions. Second operand 9 states. [2019-09-10 08:39:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:04,772 INFO L93 Difference]: Finished difference Result 4486 states and 6390 transitions. [2019-09-10 08:39:04,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:04,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:39:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:04,778 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:39:04,779 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:39:04,779 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:39:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:39:04,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:39:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:39:04,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3849 transitions. [2019-09-10 08:39:04,817 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3849 transitions. Word has length 134 [2019-09-10 08:39:04,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:04,819 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3849 transitions. [2019-09-10 08:39:04,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3849 transitions. [2019-09-10 08:39:04,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:39:04,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:04,822 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:04,822 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:04,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:04,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1945214812, now seen corresponding path program 1 times [2019-09-10 08:39:04,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:04,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:04,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:04,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:04,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:39:05,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:05,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:05,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:05,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:05,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:05,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:05,054 INFO L87 Difference]: Start difference. First operand 2710 states and 3849 transitions. Second operand 9 states. [2019-09-10 08:39:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:12,325 INFO L93 Difference]: Finished difference Result 4486 states and 6389 transitions. [2019-09-10 08:39:12,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:12,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:39:12,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:12,331 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:39:12,331 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:39:12,331 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:39:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:39:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:39:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:39:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3848 transitions. [2019-09-10 08:39:12,359 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3848 transitions. Word has length 134 [2019-09-10 08:39:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:12,360 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3848 transitions. [2019-09-10 08:39:12,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3848 transitions. [2019-09-10 08:39:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:39:12,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:12,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:12,362 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:12,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:12,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1055577685, now seen corresponding path program 1 times [2019-09-10 08:39:12,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:12,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:12,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:12,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:12,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:39:12,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:12,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:12,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:12,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:12,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:12,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:12,600 INFO L87 Difference]: Start difference. First operand 2710 states and 3848 transitions. Second operand 9 states. [2019-09-10 08:39:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:18,463 INFO L93 Difference]: Finished difference Result 4390 states and 6224 transitions. [2019-09-10 08:39:18,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:18,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:39:18,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:18,469 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:39:18,469 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:39:18,470 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:39:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:39:18,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:39:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:39:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3847 transitions. [2019-09-10 08:39:18,497 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3847 transitions. Word has length 134 [2019-09-10 08:39:18,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:18,497 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3847 transitions. [2019-09-10 08:39:18,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3847 transitions. [2019-09-10 08:39:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:39:18,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:18,500 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:18,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:18,500 INFO L82 PathProgramCache]: Analyzing trace with hash -631298145, now seen corresponding path program 1 times [2019-09-10 08:39:18,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:18,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:18,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:18,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:18,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:39:18,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:18,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:18,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:18,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:18,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:18,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:18,743 INFO L87 Difference]: Start difference. First operand 2710 states and 3847 transitions. Second operand 9 states. [2019-09-10 08:39:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:25,725 INFO L93 Difference]: Finished difference Result 4534 states and 6460 transitions. [2019-09-10 08:39:25,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:25,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:39:25,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:25,731 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:39:25,731 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:39:25,732 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:39:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:39:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:39:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:39:25,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3846 transitions. [2019-09-10 08:39:25,760 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3846 transitions. Word has length 134 [2019-09-10 08:39:25,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:25,761 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3846 transitions. [2019-09-10 08:39:25,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3846 transitions. [2019-09-10 08:39:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:39:25,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:25,763 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:25,763 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:25,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:25,763 INFO L82 PathProgramCache]: Analyzing trace with hash 899376670, now seen corresponding path program 1 times [2019-09-10 08:39:25,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:25,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:25,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:25,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:25,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:39:25,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:25,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:25,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:25,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:25,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:25,955 INFO L87 Difference]: Start difference. First operand 2710 states and 3846 transitions. Second operand 9 states. [2019-09-10 08:39:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:33,086 INFO L93 Difference]: Finished difference Result 4486 states and 6385 transitions. [2019-09-10 08:39:33,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:33,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:39:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:33,092 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:39:33,092 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:39:33,092 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:39:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:39:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:39:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:39:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3845 transitions. [2019-09-10 08:39:33,120 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3845 transitions. Word has length 134 [2019-09-10 08:39:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:33,120 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3845 transitions. [2019-09-10 08:39:33,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3845 transitions. [2019-09-10 08:39:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:39:33,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:33,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:33,123 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:33,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:33,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2060599935, now seen corresponding path program 1 times [2019-09-10 08:39:33,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:33,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:33,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:33,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:33,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:39:33,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:33,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:33,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:33,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:33,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:33,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:33,301 INFO L87 Difference]: Start difference. First operand 2710 states and 3845 transitions. Second operand 9 states. [2019-09-10 08:39:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:40,699 INFO L93 Difference]: Finished difference Result 4534 states and 6458 transitions. [2019-09-10 08:39:40,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:40,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:39:40,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:40,706 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:39:40,706 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:39:40,707 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:39:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:39:40,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:39:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:39:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3844 transitions. [2019-09-10 08:39:40,750 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3844 transitions. Word has length 134 [2019-09-10 08:39:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:40,751 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3844 transitions. [2019-09-10 08:39:40,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3844 transitions. [2019-09-10 08:39:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:39:40,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:40,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:40,754 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:40,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:40,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1178386552, now seen corresponding path program 1 times [2019-09-10 08:39:40,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:40,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:40,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:40,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:40,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:39:41,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:41,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:41,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:41,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:41,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:41,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:41,044 INFO L87 Difference]: Start difference. First operand 2710 states and 3844 transitions. Second operand 9 states. [2019-09-10 08:39:46,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:46,838 INFO L93 Difference]: Finished difference Result 4390 states and 6219 transitions. [2019-09-10 08:39:46,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:46,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:39:46,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:46,844 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:39:46,844 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:39:46,845 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:39:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:39:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:39:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:39:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3843 transitions. [2019-09-10 08:39:46,874 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3843 transitions. Word has length 134 [2019-09-10 08:39:46,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:46,874 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3843 transitions. [2019-09-10 08:39:46,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3843 transitions. [2019-09-10 08:39:46,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:39:46,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:46,876 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:46,876 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:46,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1616019050, now seen corresponding path program 1 times [2019-09-10 08:39:46,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:46,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:46,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:46,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:46,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:39:47,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:47,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:47,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:47,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:47,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:47,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:47,681 INFO L87 Difference]: Start difference. First operand 2710 states and 3843 transitions. Second operand 9 states. [2019-09-10 08:39:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:54,998 INFO L93 Difference]: Finished difference Result 4486 states and 6381 transitions. [2019-09-10 08:39:54,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:39:54,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:39:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:55,003 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:39:55,003 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:39:55,004 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:39:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:39:55,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:39:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:39:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3842 transitions. [2019-09-10 08:39:55,029 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3842 transitions. Word has length 134 [2019-09-10 08:39:55,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:55,029 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3842 transitions. [2019-09-10 08:39:55,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:39:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3842 transitions. [2019-09-10 08:39:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:39:55,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:55,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:55,032 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:55,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:55,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1944837770, now seen corresponding path program 1 times [2019-09-10 08:39:55,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:55,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:55,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:55,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:55,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:39:55,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:55,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:39:55,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:55,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:39:55,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:39:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:39:55,217 INFO L87 Difference]: Start difference. First operand 2710 states and 3842 transitions. Second operand 9 states. [2019-09-10 08:40:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:02,502 INFO L93 Difference]: Finished difference Result 4486 states and 6379 transitions. [2019-09-10 08:40:02,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:02,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:40:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:02,507 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:40:02,507 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:40:02,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:40:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:40:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:40:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:40:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3841 transitions. [2019-09-10 08:40:02,534 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3841 transitions. Word has length 134 [2019-09-10 08:40:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:02,534 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3841 transitions. [2019-09-10 08:40:02,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3841 transitions. [2019-09-10 08:40:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:40:02,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:02,536 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:02,537 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:02,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash 841035314, now seen corresponding path program 1 times [2019-09-10 08:40:02,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:02,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:02,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:02,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:02,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:02,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:02,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:02,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:02,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:02,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:02,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:02,729 INFO L87 Difference]: Start difference. First operand 2710 states and 3841 transitions. Second operand 9 states. [2019-09-10 08:40:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:09,450 INFO L93 Difference]: Finished difference Result 4486 states and 6378 transitions. [2019-09-10 08:40:09,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:09,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:40:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:09,456 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:40:09,456 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:40:09,456 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:40:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:40:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:40:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:40:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3840 transitions. [2019-09-10 08:40:09,481 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3840 transitions. Word has length 135 [2019-09-10 08:40:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:09,482 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3840 transitions. [2019-09-10 08:40:09,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3840 transitions. [2019-09-10 08:40:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:40:09,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:09,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:09,484 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:09,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1755659690, now seen corresponding path program 1 times [2019-09-10 08:40:09,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:09,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:09,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:09,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:09,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:09,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:09,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:09,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:09,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:09,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:09,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:09,717 INFO L87 Difference]: Start difference. First operand 2710 states and 3840 transitions. Second operand 9 states. [2019-09-10 08:40:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:17,127 INFO L93 Difference]: Finished difference Result 4486 states and 6377 transitions. [2019-09-10 08:40:17,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:17,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:40:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:17,131 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:40:17,132 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:40:17,132 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:40:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:40:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:40:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:40:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3839 transitions. [2019-09-10 08:40:17,160 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3839 transitions. Word has length 135 [2019-09-10 08:40:17,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:17,160 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3839 transitions. [2019-09-10 08:40:17,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3839 transitions. [2019-09-10 08:40:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:40:17,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:17,163 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:17,163 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:17,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:17,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1089607547, now seen corresponding path program 1 times [2019-09-10 08:40:17,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:17,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:17,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:17,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:17,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:17,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:17,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:17,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:17,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:17,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:17,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:17,363 INFO L87 Difference]: Start difference. First operand 2710 states and 3839 transitions. Second operand 9 states. [2019-09-10 08:40:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:24,455 INFO L93 Difference]: Finished difference Result 4534 states and 6447 transitions. [2019-09-10 08:40:24,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:24,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:40:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:24,462 INFO L225 Difference]: With dead ends: 4534 [2019-09-10 08:40:24,462 INFO L226 Difference]: Without dead ends: 4534 [2019-09-10 08:40:24,462 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:40:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-10 08:40:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-10 08:40:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:40:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3837 transitions. [2019-09-10 08:40:24,494 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3837 transitions. Word has length 136 [2019-09-10 08:40:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:24,494 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3837 transitions. [2019-09-10 08:40:24,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3837 transitions. [2019-09-10 08:40:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:40:24,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:24,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] [2019-09-10 08:40:24,497 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:24,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:24,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2046822705, now seen corresponding path program 1 times [2019-09-10 08:40:24,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:24,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:24,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:24,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:24,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:24,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:24,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:24,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:24,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:24,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:24,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:24,745 INFO L87 Difference]: Start difference. First operand 2710 states and 3837 transitions. Second operand 9 states. [2019-09-10 08:40:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:31,710 INFO L93 Difference]: Finished difference Result 4390 states and 6211 transitions. [2019-09-10 08:40:31,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:31,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:40:31,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:31,717 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:40:31,717 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:40:31,717 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:40:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:40:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:40:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:40:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3835 transitions. [2019-09-10 08:40:31,745 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3835 transitions. Word has length 136 [2019-09-10 08:40:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:31,745 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3835 transitions. [2019-09-10 08:40:31,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3835 transitions. [2019-09-10 08:40:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:40:31,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:31,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:31,748 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash 189537334, now seen corresponding path program 1 times [2019-09-10 08:40:31,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:31,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:31,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:31,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:31,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:31,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:31,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:31,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:31,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:31,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:31,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:31,932 INFO L87 Difference]: Start difference. First operand 2710 states and 3835 transitions. Second operand 9 states. [2019-09-10 08:40:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:39,725 INFO L93 Difference]: Finished difference Result 4486 states and 6371 transitions. [2019-09-10 08:40:39,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:39,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:40:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:39,732 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:40:39,732 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:40:39,732 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:40:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:40:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:40:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:40:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3833 transitions. [2019-09-10 08:40:39,759 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3833 transitions. Word has length 136 [2019-09-10 08:40:39,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:39,760 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3833 transitions. [2019-09-10 08:40:39,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3833 transitions. [2019-09-10 08:40:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:40:39,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:39,762 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:39,762 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:39,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:39,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1290920479, now seen corresponding path program 1 times [2019-09-10 08:40:39,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:39,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:39,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:39,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:39,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:39,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:39,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:39,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:39,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:39,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:39,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:39,964 INFO L87 Difference]: Start difference. First operand 2710 states and 3833 transitions. Second operand 9 states. [2019-09-10 08:40:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:46,280 INFO L93 Difference]: Finished difference Result 4390 states and 6207 transitions. [2019-09-10 08:40:46,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:46,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:40:46,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:46,287 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:40:46,288 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:40:46,288 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:40:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:40:46,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:40:46,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:40:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3831 transitions. [2019-09-10 08:40:46,320 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3831 transitions. Word has length 136 [2019-09-10 08:40:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:46,320 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3831 transitions. [2019-09-10 08:40:46,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3831 transitions. [2019-09-10 08:40:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:40:46,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:46,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:46,323 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:46,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:46,323 INFO L82 PathProgramCache]: Analyzing trace with hash -767686778, now seen corresponding path program 1 times [2019-09-10 08:40:46,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:46,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:46,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:46,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:46,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:46,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:40:46,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:46,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:46,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:46,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:46,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:46,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:46,554 INFO L87 Difference]: Start difference. First operand 2710 states and 3831 transitions. Second operand 9 states. [2019-09-10 08:40:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:54,370 INFO L93 Difference]: Finished difference Result 4486 states and 6363 transitions. [2019-09-10 08:40:54,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:40:54,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:40:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:54,376 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:40:54,376 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:40:54,377 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:40:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:40:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:40:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:40:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3829 transitions. [2019-09-10 08:40:54,407 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3829 transitions. Word has length 136 [2019-09-10 08:40:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:54,407 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3829 transitions. [2019-09-10 08:40:54,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:40:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3829 transitions. [2019-09-10 08:40:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:40:54,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:54,410 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:54,410 INFO L82 PathProgramCache]: Analyzing trace with hash -766294188, now seen corresponding path program 1 times [2019-09-10 08:40:54,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:54,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:54,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:54,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:54,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:54,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:54,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:40:54,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:54,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:40:54,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:40:54,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:40:54,633 INFO L87 Difference]: Start difference. First operand 2710 states and 3829 transitions. Second operand 9 states. [2019-09-10 08:41:01,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:01,853 INFO L93 Difference]: Finished difference Result 4390 states and 6203 transitions. [2019-09-10 08:41:01,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:01,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:41:01,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:01,858 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:41:01,858 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:41:01,858 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:41:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:41:01,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:41:01,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:41:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3827 transitions. [2019-09-10 08:41:01,888 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3827 transitions. Word has length 136 [2019-09-10 08:41:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:01,889 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3827 transitions. [2019-09-10 08:41:01,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3827 transitions. [2019-09-10 08:41:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:41:01,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:01,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:01,892 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:01,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:01,892 INFO L82 PathProgramCache]: Analyzing trace with hash -377682901, now seen corresponding path program 1 times [2019-09-10 08:41:01,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:01,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:01,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:01,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:01,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:02,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:02,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:02,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:02,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:02,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:02,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:02,103 INFO L87 Difference]: Start difference. First operand 2710 states and 3827 transitions. Second operand 9 states. [2019-09-10 08:41:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:09,494 INFO L93 Difference]: Finished difference Result 4390 states and 6199 transitions. [2019-09-10 08:41:09,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:09,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:41:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:09,500 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:41:09,500 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:41:09,501 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:41:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:41:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:41:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:41:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3825 transitions. [2019-09-10 08:41:09,531 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3825 transitions. Word has length 136 [2019-09-10 08:41:09,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:09,531 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3825 transitions. [2019-09-10 08:41:09,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:09,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3825 transitions. [2019-09-10 08:41:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:41:09,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:09,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] [2019-09-10 08:41:09,534 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:09,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:09,534 INFO L82 PathProgramCache]: Analyzing trace with hash -144035146, now seen corresponding path program 1 times [2019-09-10 08:41:09,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:09,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:09,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:09,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:09,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:09,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:09,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:09,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:09,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:09,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:09,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:09,743 INFO L87 Difference]: Start difference. First operand 2710 states and 3825 transitions. Second operand 9 states. [2019-09-10 08:41:16,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:16,138 INFO L93 Difference]: Finished difference Result 4390 states and 6195 transitions. [2019-09-10 08:41:16,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:16,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:41:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:16,143 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:41:16,143 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:41:16,144 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:41:16,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:41:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:41:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:41:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3823 transitions. [2019-09-10 08:41:16,174 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3823 transitions. Word has length 136 [2019-09-10 08:41:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:16,174 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3823 transitions. [2019-09-10 08:41:16,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3823 transitions. [2019-09-10 08:41:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:41:16,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:16,177 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:16,177 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:16,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash 866292793, now seen corresponding path program 1 times [2019-09-10 08:41:16,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:16,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:16,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:16,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:16,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:16,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:41:16,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:16,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:16,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:16,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:16,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:16,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:16,373 INFO L87 Difference]: Start difference. First operand 2710 states and 3823 transitions. Second operand 9 states. [2019-09-10 08:41:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:23,564 INFO L93 Difference]: Finished difference Result 4390 states and 6193 transitions. [2019-09-10 08:41:23,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:23,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:41:23,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:23,569 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:41:23,569 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:41:23,569 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:41:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:41:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:41:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:41:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3821 transitions. [2019-09-10 08:41:23,593 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3821 transitions. Word has length 136 [2019-09-10 08:41:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:23,593 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3821 transitions. [2019-09-10 08:41:23,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3821 transitions. [2019-09-10 08:41:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:41:23,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:23,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:23,595 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:23,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:23,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1255552509, now seen corresponding path program 1 times [2019-09-10 08:41:23,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:23,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:23,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:23,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:23,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:23,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:41:23,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:23,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:23,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:23,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:23,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:23,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:23,785 INFO L87 Difference]: Start difference. First operand 2710 states and 3821 transitions. Second operand 9 states. [2019-09-10 08:41:30,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:30,971 INFO L93 Difference]: Finished difference Result 4390 states and 6189 transitions. [2019-09-10 08:41:30,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:30,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:41:30,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:30,978 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:41:30,978 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:41:30,978 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:41:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:41:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:41:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:41:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3819 transitions. [2019-09-10 08:41:31,012 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3819 transitions. Word has length 136 [2019-09-10 08:41:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:31,012 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3819 transitions. [2019-09-10 08:41:31,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3819 transitions. [2019-09-10 08:41:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:41:31,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:31,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:31,015 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:31,015 INFO L82 PathProgramCache]: Analyzing trace with hash -945330430, now seen corresponding path program 1 times [2019-09-10 08:41:31,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:31,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:31,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:31,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:31,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:31,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:31,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:31,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:31,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:31,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:31,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:31,213 INFO L87 Difference]: Start difference. First operand 2710 states and 3819 transitions. Second operand 9 states. [2019-09-10 08:41:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:37,502 INFO L93 Difference]: Finished difference Result 4390 states and 6187 transitions. [2019-09-10 08:41:37,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:37,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:41:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:37,509 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:41:37,509 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:41:37,509 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:41:37,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:41:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:41:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:41:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3817 transitions. [2019-09-10 08:41:37,540 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3817 transitions. Word has length 136 [2019-09-10 08:41:37,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:37,540 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3817 transitions. [2019-09-10 08:41:37,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:37,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3817 transitions. [2019-09-10 08:41:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:41:37,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:37,542 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:37,543 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:37,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:37,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1291029609, now seen corresponding path program 1 times [2019-09-10 08:41:37,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:37,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:37,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:37,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:37,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:37,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:41:37,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:37,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:37,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:37,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:37,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:37,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:37,744 INFO L87 Difference]: Start difference. First operand 2710 states and 3817 transitions. Second operand 9 states. [2019-09-10 08:41:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:44,479 INFO L93 Difference]: Finished difference Result 4486 states and 6341 transitions. [2019-09-10 08:41:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:44,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:41:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:44,485 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:41:44,485 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:41:44,485 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:41:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:41:44,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:41:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:41:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3815 transitions. [2019-09-10 08:41:44,512 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3815 transitions. Word has length 136 [2019-09-10 08:41:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:44,512 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3815 transitions. [2019-09-10 08:41:44,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3815 transitions. [2019-09-10 08:41:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:41:44,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:44,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:44,514 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:44,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:44,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1291977335, now seen corresponding path program 1 times [2019-09-10 08:41:44,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:44,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:44,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:44,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:44,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:44,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:44,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:44,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:44,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:44,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:44,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:44,725 INFO L87 Difference]: Start difference. First operand 2710 states and 3815 transitions. Second operand 9 states. [2019-09-10 08:41:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:51,932 INFO L93 Difference]: Finished difference Result 4390 states and 6183 transitions. [2019-09-10 08:41:51,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:51,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:41:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:51,938 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:41:51,938 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:41:51,938 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:41:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:41:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:41:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:41:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3813 transitions. [2019-09-10 08:41:51,966 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3813 transitions. Word has length 136 [2019-09-10 08:41:51,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:51,967 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3813 transitions. [2019-09-10 08:41:51,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3813 transitions. [2019-09-10 08:41:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:41:51,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:51,969 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:51,969 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:51,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1681033486, now seen corresponding path program 1 times [2019-09-10 08:41:51,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:51,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:51,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:51,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:51,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:52,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:52,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:52,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:52,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:52,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:52,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:52,185 INFO L87 Difference]: Start difference. First operand 2710 states and 3813 transitions. Second operand 9 states. [2019-09-10 08:41:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:59,357 INFO L93 Difference]: Finished difference Result 4390 states and 6179 transitions. [2019-09-10 08:41:59,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:41:59,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:41:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:59,361 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:41:59,361 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:41:59,362 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:41:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:41:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:41:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:41:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3811 transitions. [2019-09-10 08:41:59,389 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3811 transitions. Word has length 136 [2019-09-10 08:41:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:59,389 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3811 transitions. [2019-09-10 08:41:59,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:41:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3811 transitions. [2019-09-10 08:41:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:41:59,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:59,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:59,391 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:59,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:59,392 INFO L82 PathProgramCache]: Analyzing trace with hash 252279948, now seen corresponding path program 1 times [2019-09-10 08:41:59,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:59,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:59,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:59,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:59,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:59,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:59,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:41:59,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:59,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:41:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:41:59,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:59,582 INFO L87 Difference]: Start difference. First operand 2710 states and 3811 transitions. Second operand 9 states. [2019-09-10 08:42:06,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:06,244 INFO L93 Difference]: Finished difference Result 4486 states and 6333 transitions. [2019-09-10 08:42:06,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:06,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:42:06,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:06,251 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:42:06,251 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:42:06,251 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:42:06,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:42:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:42:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:42:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3809 transitions. [2019-09-10 08:42:06,285 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3809 transitions. Word has length 136 [2019-09-10 08:42:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:06,285 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3809 transitions. [2019-09-10 08:42:06,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3809 transitions. [2019-09-10 08:42:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:42:06,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:06,288 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:06,288 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:06,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:06,289 INFO L82 PathProgramCache]: Analyzing trace with hash -5220605, now seen corresponding path program 1 times [2019-09-10 08:42:06,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:06,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:06,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:06,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:06,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:06,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:06,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:06,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:06,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:06,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:06,493 INFO L87 Difference]: Start difference. First operand 2710 states and 3809 transitions. Second operand 9 states. [2019-09-10 08:42:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:13,568 INFO L93 Difference]: Finished difference Result 4390 states and 6175 transitions. [2019-09-10 08:42:13,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:13,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:42:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:13,575 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:42:13,575 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:42:13,575 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:42:13,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:42:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:42:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:42:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3807 transitions. [2019-09-10 08:42:13,605 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3807 transitions. Word has length 136 [2019-09-10 08:42:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:13,605 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3807 transitions. [2019-09-10 08:42:13,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3807 transitions. [2019-09-10 08:42:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:42:13,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:13,607 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:13,607 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:13,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:13,608 INFO L82 PathProgramCache]: Analyzing trace with hash -737303364, now seen corresponding path program 1 times [2019-09-10 08:42:13,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:13,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:13,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:13,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:13,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:13,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:13,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:13,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:13,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:13,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:13,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:13,830 INFO L87 Difference]: Start difference. First operand 2710 states and 3807 transitions. Second operand 9 states. [2019-09-10 08:42:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:21,059 INFO L93 Difference]: Finished difference Result 4390 states and 6173 transitions. [2019-09-10 08:42:21,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:21,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:42:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:21,065 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:42:21,066 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:42:21,066 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:42:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:42:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:42:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:42:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3805 transitions. [2019-09-10 08:42:21,100 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3805 transitions. Word has length 136 [2019-09-10 08:42:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:21,100 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3805 transitions. [2019-09-10 08:42:21,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3805 transitions. [2019-09-10 08:42:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:42:21,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:21,103 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:21,103 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:21,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:21,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1728053055, now seen corresponding path program 1 times [2019-09-10 08:42:21,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:21,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:21,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:21,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:21,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:21,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:42:21,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:21,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:21,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:21,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:21,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:21,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:21,302 INFO L87 Difference]: Start difference. First operand 2710 states and 3805 transitions. Second operand 9 states. [2019-09-10 08:42:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:28,564 INFO L93 Difference]: Finished difference Result 4390 states and 6169 transitions. [2019-09-10 08:42:28,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:28,564 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:42:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:28,570 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:42:28,570 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:42:28,570 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:42:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:42:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:42:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:42:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3803 transitions. [2019-09-10 08:42:28,598 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3803 transitions. Word has length 136 [2019-09-10 08:42:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:28,598 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3803 transitions. [2019-09-10 08:42:28,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3803 transitions. [2019-09-10 08:42:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:42:28,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:28,601 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:28,601 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:28,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:28,601 INFO L82 PathProgramCache]: Analyzing trace with hash -822462431, now seen corresponding path program 1 times [2019-09-10 08:42:28,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:28,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:28,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:28,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:28,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:28,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:28,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:28,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:28,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:28,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:28,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:28,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:28,794 INFO L87 Difference]: Start difference. First operand 2710 states and 3803 transitions. Second operand 9 states. [2019-09-10 08:42:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:36,072 INFO L93 Difference]: Finished difference Result 4390 states and 6167 transitions. [2019-09-10 08:42:36,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:36,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:42:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:36,079 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:42:36,079 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:42:36,080 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:42:36,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:42:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:42:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:42:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3801 transitions. [2019-09-10 08:42:36,142 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3801 transitions. Word has length 136 [2019-09-10 08:42:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:36,142 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3801 transitions. [2019-09-10 08:42:36,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3801 transitions. [2019-09-10 08:42:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:42:36,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:36,147 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:36,147 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:36,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:36,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1503867412, now seen corresponding path program 1 times [2019-09-10 08:42:36,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:36,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:36,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:36,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:36,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:36,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:42:36,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:36,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:36,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:36,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:36,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:36,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:36,513 INFO L87 Difference]: Start difference. First operand 2710 states and 3801 transitions. Second operand 9 states. [2019-09-10 08:42:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:43,870 INFO L93 Difference]: Finished difference Result 4390 states and 6163 transitions. [2019-09-10 08:42:43,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:43,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:42:43,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:43,876 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:42:43,876 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:42:43,877 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:42:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:42:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:42:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:42:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3799 transitions. [2019-09-10 08:42:43,906 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3799 transitions. Word has length 136 [2019-09-10 08:42:43,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:43,906 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3799 transitions. [2019-09-10 08:42:43,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3799 transitions. [2019-09-10 08:42:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:42:43,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:43,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:43,908 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:43,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1792529197, now seen corresponding path program 1 times [2019-09-10 08:42:43,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:43,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:43,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:43,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:43,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:44,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:44,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:44,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:44,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:44,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:44,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:44,134 INFO L87 Difference]: Start difference. First operand 2710 states and 3799 transitions. Second operand 9 states. [2019-09-10 08:42:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:50,541 INFO L93 Difference]: Finished difference Result 4390 states and 6159 transitions. [2019-09-10 08:42:50,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:50,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:42:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:50,548 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:42:50,548 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:42:50,548 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:42:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:42:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:42:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:42:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3797 transitions. [2019-09-10 08:42:50,580 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3797 transitions. Word has length 136 [2019-09-10 08:42:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:50,580 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3797 transitions. [2019-09-10 08:42:50,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3797 transitions. [2019-09-10 08:42:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:42:50,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:50,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:50,583 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:50,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1429196231, now seen corresponding path program 1 times [2019-09-10 08:42:50,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:50,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:50,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:50,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:50,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:50,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:50,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:50,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:50,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:50,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:50,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:50,778 INFO L87 Difference]: Start difference. First operand 2710 states and 3797 transitions. Second operand 9 states. [2019-09-10 08:42:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:58,071 INFO L93 Difference]: Finished difference Result 4390 states and 6157 transitions. [2019-09-10 08:42:58,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:42:58,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:42:58,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:58,077 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:42:58,077 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:42:58,078 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:42:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:42:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:42:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:42:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3795 transitions. [2019-09-10 08:42:58,113 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3795 transitions. Word has length 136 [2019-09-10 08:42:58,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:58,113 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3795 transitions. [2019-09-10 08:42:58,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:42:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3795 transitions. [2019-09-10 08:42:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:42:58,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:58,117 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:58,117 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:58,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:58,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1006491598, now seen corresponding path program 1 times [2019-09-10 08:42:58,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:58,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:58,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:58,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:58,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:58,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:42:58,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:58,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:42:58,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:58,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:42:58,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:42:58,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:42:58,315 INFO L87 Difference]: Start difference. First operand 2710 states and 3795 transitions. Second operand 9 states. [2019-09-10 08:43:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:05,494 INFO L93 Difference]: Finished difference Result 4390 states and 6153 transitions. [2019-09-10 08:43:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:05,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:43:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:05,500 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:43:05,501 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:43:05,501 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:43:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:43:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:43:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:43:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3793 transitions. [2019-09-10 08:43:05,530 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3793 transitions. Word has length 136 [2019-09-10 08:43:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:05,530 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3793 transitions. [2019-09-10 08:43:05,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3793 transitions. [2019-09-10 08:43:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:43:05,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:05,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] [2019-09-10 08:43:05,533 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:05,533 INFO L82 PathProgramCache]: Analyzing trace with hash -469281509, now seen corresponding path program 1 times [2019-09-10 08:43:05,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:05,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:05,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:05,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:05,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:05,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:43:05,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:05,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:05,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:05,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:05,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:05,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:05,732 INFO L87 Difference]: Start difference. First operand 2710 states and 3793 transitions. Second operand 9 states. [2019-09-10 08:43:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:13,238 INFO L93 Difference]: Finished difference Result 4486 states and 6307 transitions. [2019-09-10 08:43:13,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:13,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:43:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:13,244 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:43:13,244 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:43:13,245 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:43:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:43:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:43:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:43:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3791 transitions. [2019-09-10 08:43:13,276 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3791 transitions. Word has length 136 [2019-09-10 08:43:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:13,277 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3791 transitions. [2019-09-10 08:43:13,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3791 transitions. [2019-09-10 08:43:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:43:13,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:13,279 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:13,279 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:13,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:13,279 INFO L82 PathProgramCache]: Analyzing trace with hash -726782062, now seen corresponding path program 1 times [2019-09-10 08:43:13,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:13,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:13,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:13,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:13,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:13,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:43:13,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:13,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:13,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:13,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:13,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:13,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:13,512 INFO L87 Difference]: Start difference. First operand 2710 states and 3791 transitions. Second operand 9 states. [2019-09-10 08:43:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:19,827 INFO L93 Difference]: Finished difference Result 4390 states and 6149 transitions. [2019-09-10 08:43:19,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:19,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:43:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:19,833 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:43:19,833 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:43:19,833 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:43:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:43:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:43:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:43:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3789 transitions. [2019-09-10 08:43:19,863 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3789 transitions. Word has length 136 [2019-09-10 08:43:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:19,863 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3789 transitions. [2019-09-10 08:43:19,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3789 transitions. [2019-09-10 08:43:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:43:19,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:19,865 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:19,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1928635381, now seen corresponding path program 1 times [2019-09-10 08:43:19,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:19,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:19,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:19,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:19,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:20,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:20,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:20,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:20,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:20,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:20,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:20,043 INFO L87 Difference]: Start difference. First operand 2710 states and 3789 transitions. Second operand 9 states. [2019-09-10 08:43:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:27,255 INFO L93 Difference]: Finished difference Result 4390 states and 6145 transitions. [2019-09-10 08:43:27,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:27,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:43:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:27,261 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:43:27,261 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:43:27,262 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:43:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:43:27,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:43:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:43:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3787 transitions. [2019-09-10 08:43:27,294 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3787 transitions. Word has length 136 [2019-09-10 08:43:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:27,294 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3787 transitions. [2019-09-10 08:43:27,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3787 transitions. [2019-09-10 08:43:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:43:27,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:27,297 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:27,297 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:27,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:27,297 INFO L82 PathProgramCache]: Analyzing trace with hash 437154291, now seen corresponding path program 1 times [2019-09-10 08:43:27,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:27,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:27,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:27,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:27,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:27,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:27,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:27,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:27,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:27,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:27,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:27,498 INFO L87 Difference]: Start difference. First operand 2710 states and 3787 transitions. Second operand 9 states. [2019-09-10 08:43:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:34,775 INFO L93 Difference]: Finished difference Result 4390 states and 6143 transitions. [2019-09-10 08:43:34,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:34,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:43:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:34,781 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:43:34,781 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:43:34,782 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:43:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:43:34,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:43:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:43:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3785 transitions. [2019-09-10 08:43:34,811 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3785 transitions. Word has length 136 [2019-09-10 08:43:34,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:34,811 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3785 transitions. [2019-09-10 08:43:34,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3785 transitions. [2019-09-10 08:43:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:43:34,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:34,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:34,814 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:34,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:34,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2140262471, now seen corresponding path program 1 times [2019-09-10 08:43:34,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:34,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:34,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:34,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:34,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:35,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:35,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:35,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:35,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:35,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:35,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:35,014 INFO L87 Difference]: Start difference. First operand 2710 states and 3785 transitions. Second operand 9 states. [2019-09-10 08:43:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:41,554 INFO L93 Difference]: Finished difference Result 4390 states and 6139 transitions. [2019-09-10 08:43:41,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:41,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:43:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:41,562 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:43:41,562 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:43:41,563 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:43:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:43:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:43:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:43:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3783 transitions. [2019-09-10 08:43:41,622 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3783 transitions. Word has length 136 [2019-09-10 08:43:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:41,622 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3783 transitions. [2019-09-10 08:43:41,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3783 transitions. [2019-09-10 08:43:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:43:41,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:41,627 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:41,628 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:41,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:41,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1769656664, now seen corresponding path program 1 times [2019-09-10 08:43:41,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:41,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:41,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:41,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:41,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:41,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:41,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:41,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:41,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:41,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:41,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:41,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:41,997 INFO L87 Difference]: Start difference. First operand 2710 states and 3783 transitions. Second operand 9 states. [2019-09-10 08:43:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:49,587 INFO L93 Difference]: Finished difference Result 4486 states and 6291 transitions. [2019-09-10 08:43:49,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:49,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:43:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:49,593 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:43:49,593 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:43:49,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:43:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:43:49,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:43:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:43:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3781 transitions. [2019-09-10 08:43:49,626 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3781 transitions. Word has length 136 [2019-09-10 08:43:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:49,626 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3781 transitions. [2019-09-10 08:43:49,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:49,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3781 transitions. [2019-09-10 08:43:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:43:49,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:49,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:49,629 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:49,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:49,629 INFO L82 PathProgramCache]: Analyzing trace with hash -419637699, now seen corresponding path program 1 times [2019-09-10 08:43:49,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:49,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:49,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:49,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:49,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:49,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:49,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:49,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:49,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:49,824 INFO L87 Difference]: Start difference. First operand 2710 states and 3781 transitions. Second operand 9 states. [2019-09-10 08:43:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:57,126 INFO L93 Difference]: Finished difference Result 4390 states and 6135 transitions. [2019-09-10 08:43:57,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:43:57,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:43:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:57,133 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:43:57,133 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:43:57,133 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:43:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:43:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:43:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:43:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3779 transitions. [2019-09-10 08:43:57,164 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3779 transitions. Word has length 136 [2019-09-10 08:43:57,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:57,164 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3779 transitions. [2019-09-10 08:43:57,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:43:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3779 transitions. [2019-09-10 08:43:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:43:57,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:57,167 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:57,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:57,167 INFO L82 PathProgramCache]: Analyzing trace with hash 102059815, now seen corresponding path program 1 times [2019-09-10 08:43:57,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:57,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:57,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:57,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:57,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:43:57,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:57,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:43:57,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:43:57,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:43:57,364 INFO L87 Difference]: Start difference. First operand 2710 states and 3779 transitions. Second operand 9 states. [2019-09-10 08:44:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:03,931 INFO L93 Difference]: Finished difference Result 4390 states and 6133 transitions. [2019-09-10 08:44:03,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:03,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:44:03,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:03,936 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:44:03,936 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:44:03,937 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:44:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:44:03,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:44:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:44:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3778 transitions. [2019-09-10 08:44:03,963 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3778 transitions. Word has length 136 [2019-09-10 08:44:03,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:03,963 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3778 transitions. [2019-09-10 08:44:03,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:03,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3778 transitions. [2019-09-10 08:44:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:44:03,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:03,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:03,966 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:03,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:03,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1072126581, now seen corresponding path program 1 times [2019-09-10 08:44:03,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:03,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:03,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:03,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:03,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:04,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:04,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:04,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:04,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:04,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:04,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:04,166 INFO L87 Difference]: Start difference. First operand 2710 states and 3778 transitions. Second operand 9 states. [2019-09-10 08:44:11,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:11,313 INFO L93 Difference]: Finished difference Result 4390 states and 6132 transitions. [2019-09-10 08:44:11,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:11,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:44:11,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:11,320 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:44:11,320 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:44:11,321 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:44:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:44:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:44:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:44:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3777 transitions. [2019-09-10 08:44:11,351 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3777 transitions. Word has length 136 [2019-09-10 08:44:11,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:11,352 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3777 transitions. [2019-09-10 08:44:11,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3777 transitions. [2019-09-10 08:44:11,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:44:11,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:11,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:11,354 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:11,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:11,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1001517814, now seen corresponding path program 1 times [2019-09-10 08:44:11,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:11,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:11,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:11,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:11,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:11,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:11,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:11,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:11,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:11,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:11,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:11,550 INFO L87 Difference]: Start difference. First operand 2710 states and 3777 transitions. Second operand 9 states. [2019-09-10 08:44:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:18,887 INFO L93 Difference]: Finished difference Result 4390 states and 6130 transitions. [2019-09-10 08:44:18,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:18,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:44:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:18,894 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:44:18,894 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:44:18,894 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:44:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:44:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:44:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:44:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3776 transitions. [2019-09-10 08:44:18,925 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3776 transitions. Word has length 136 [2019-09-10 08:44:18,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:18,925 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3776 transitions. [2019-09-10 08:44:18,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:18,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3776 transitions. [2019-09-10 08:44:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:44:18,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:18,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:18,928 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:18,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:18,928 INFO L82 PathProgramCache]: Analyzing trace with hash 503595498, now seen corresponding path program 1 times [2019-09-10 08:44:18,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:18,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:18,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:18,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:18,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:19,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:19,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:19,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:19,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:19,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:19,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:19,125 INFO L87 Difference]: Start difference. First operand 2710 states and 3776 transitions. Second operand 9 states. [2019-09-10 08:44:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:25,696 INFO L93 Difference]: Finished difference Result 4390 states and 6128 transitions. [2019-09-10 08:44:25,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:25,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:44:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:25,701 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:44:25,701 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:44:25,702 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:44:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:44:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:44:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:44:25,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3775 transitions. [2019-09-10 08:44:25,731 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3775 transitions. Word has length 136 [2019-09-10 08:44:25,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:25,731 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3775 transitions. [2019-09-10 08:44:25,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3775 transitions. [2019-09-10 08:44:25,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:44:25,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:25,733 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:25,734 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:25,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:25,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1596917454, now seen corresponding path program 1 times [2019-09-10 08:44:25,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:25,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:25,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:25,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:25,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:25,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:25,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:25,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:25,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:25,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:25,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:25,920 INFO L87 Difference]: Start difference. First operand 2710 states and 3775 transitions. Second operand 9 states. [2019-09-10 08:44:32,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:32,939 INFO L93 Difference]: Finished difference Result 4390 states and 6127 transitions. [2019-09-10 08:44:32,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:32,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:44:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:32,945 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:44:32,945 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:44:32,945 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:44:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:44:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:44:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:44:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3774 transitions. [2019-09-10 08:44:32,970 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3774 transitions. Word has length 136 [2019-09-10 08:44:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:32,970 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3774 transitions. [2019-09-10 08:44:32,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3774 transitions. [2019-09-10 08:44:32,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:44:32,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:32,972 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:32,973 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:32,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:32,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1246650529, now seen corresponding path program 1 times [2019-09-10 08:44:32,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:32,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:32,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:32,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:32,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:33,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:33,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:33,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:33,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:33,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:33,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:33,165 INFO L87 Difference]: Start difference. First operand 2710 states and 3774 transitions. Second operand 9 states. [2019-09-10 08:44:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:40,593 INFO L93 Difference]: Finished difference Result 4486 states and 6278 transitions. [2019-09-10 08:44:40,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:40,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:44:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:40,599 INFO L225 Difference]: With dead ends: 4486 [2019-09-10 08:44:40,600 INFO L226 Difference]: Without dead ends: 4486 [2019-09-10 08:44:40,600 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:44:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-10 08:44:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-10 08:44:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:44:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3773 transitions. [2019-09-10 08:44:40,630 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3773 transitions. Word has length 136 [2019-09-10 08:44:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:40,631 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3773 transitions. [2019-09-10 08:44:40,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3773 transitions. [2019-09-10 08:44:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:44:40,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:40,633 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:40,633 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:40,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash 517884233, now seen corresponding path program 1 times [2019-09-10 08:44:40,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:40,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:40,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:40,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:40,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:40,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:40,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:40,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:40,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:40,834 INFO L87 Difference]: Start difference. First operand 2710 states and 3773 transitions. Second operand 9 states. [2019-09-10 08:44:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:47,982 INFO L93 Difference]: Finished difference Result 4390 states and 6125 transitions. [2019-09-10 08:44:47,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:47,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:44:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:47,988 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:44:47,988 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:44:47,988 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:44:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:44:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:44:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:44:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3772 transitions. [2019-09-10 08:44:48,020 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3772 transitions. Word has length 136 [2019-09-10 08:44:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:48,020 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3772 transitions. [2019-09-10 08:44:48,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:48,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3772 transitions. [2019-09-10 08:44:48,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:44:48,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:48,023 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:48,023 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:48,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:48,023 INFO L82 PathProgramCache]: Analyzing trace with hash 392660378, now seen corresponding path program 1 times [2019-09-10 08:44:48,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:48,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:48,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:48,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:48,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:48,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:48,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:48,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:48,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:48,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:48,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:48,214 INFO L87 Difference]: Start difference. First operand 2710 states and 3772 transitions. Second operand 9 states. [2019-09-10 08:44:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:55,409 INFO L93 Difference]: Finished difference Result 4390 states and 6124 transitions. [2019-09-10 08:44:55,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:44:55,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:44:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:55,415 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:44:55,415 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:44:55,415 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:44:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:44:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:44:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:44:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3771 transitions. [2019-09-10 08:44:55,444 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3771 transitions. Word has length 136 [2019-09-10 08:44:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:55,444 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3771 transitions. [2019-09-10 08:44:55,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:44:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3771 transitions. [2019-09-10 08:44:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:44:55,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:55,446 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:55,446 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:55,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:55,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1970263496, now seen corresponding path program 1 times [2019-09-10 08:44:55,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:55,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:55,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:55,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:55,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:55,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:55,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:44:55,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:55,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:44:55,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:44:55,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:44:55,682 INFO L87 Difference]: Start difference. First operand 2710 states and 3771 transitions. Second operand 9 states. [2019-09-10 08:45:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:02,950 INFO L93 Difference]: Finished difference Result 4390 states and 6122 transitions. [2019-09-10 08:45:02,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:45:02,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:45:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:02,956 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:45:02,957 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:45:02,957 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:45:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:45:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:45:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:45:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3770 transitions. [2019-09-10 08:45:02,990 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3770 transitions. Word has length 136 [2019-09-10 08:45:02,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:02,990 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3770 transitions. [2019-09-10 08:45:02,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:45:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3770 transitions. [2019-09-10 08:45:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:45:02,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:02,992 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:02,992 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:02,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash -537341600, now seen corresponding path program 1 times [2019-09-10 08:45:02,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:02,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:02,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:02,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:02,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:03,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:03,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:45:03,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:03,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:45:03,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:45:03,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:45:03,187 INFO L87 Difference]: Start difference. First operand 2710 states and 3770 transitions. Second operand 9 states. [2019-09-10 08:45:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:09,824 INFO L93 Difference]: Finished difference Result 4390 states and 6120 transitions. [2019-09-10 08:45:09,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:45:09,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:45:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:09,832 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:45:09,832 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:45:09,832 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:45:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:45:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:45:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:45:09,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3769 transitions. [2019-09-10 08:45:09,867 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3769 transitions. Word has length 136 [2019-09-10 08:45:09,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:09,867 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3769 transitions. [2019-09-10 08:45:09,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:45:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3769 transitions. [2019-09-10 08:45:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:45:09,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:09,870 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:09,870 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:09,870 INFO L82 PathProgramCache]: Analyzing trace with hash 432725166, now seen corresponding path program 1 times [2019-09-10 08:45:09,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:09,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:09,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:09,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:09,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:10,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:10,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:45:10,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:10,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:45:10,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:45:10,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:45:10,083 INFO L87 Difference]: Start difference. First operand 2710 states and 3769 transitions. Second operand 9 states. [2019-09-10 08:45:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:17,243 INFO L93 Difference]: Finished difference Result 4390 states and 6119 transitions. [2019-09-10 08:45:17,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:45:17,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:45:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:17,249 INFO L225 Difference]: With dead ends: 4390 [2019-09-10 08:45:17,249 INFO L226 Difference]: Without dead ends: 4390 [2019-09-10 08:45:17,250 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:45:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-10 08:45:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-10 08:45:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-10 08:45:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3768 transitions. [2019-09-10 08:45:17,310 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3768 transitions. Word has length 136 [2019-09-10 08:45:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:17,310 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3768 transitions. [2019-09-10 08:45:17,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:45:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3768 transitions. [2019-09-10 08:45:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:45:17,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:17,313 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:17,313 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:17,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:17,313 INFO L82 PathProgramCache]: Analyzing trace with hash -183603700, now seen corresponding path program 1 times [2019-09-10 08:45:17,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:17,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:17,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:17,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:17,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:17,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:45:17,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:17,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:45:17,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:17,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:45:17,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:45:17,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:45:17,501 INFO L87 Difference]: Start difference. First operand 2710 states and 3768 transitions. Second operand 9 states.