java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:50:02,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:50:02,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:50:02,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:50:02,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:50:02,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:50:02,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:50:02,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:50:02,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:50:02,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:50:02,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:50:02,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:50:02,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:50:02,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:50:02,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:50:02,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:50:02,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:50:02,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:50:02,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:50:02,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:50:02,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:50:02,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:50:02,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:50:02,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:50:02,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:50:02,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:50:02,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:50:02,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:50:02,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:50:02,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:50:02,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:50:02,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:50:02,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:50:02,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:50:02,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:50:02,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:50:02,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:50:02,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:50:02,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:50:02,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:50:02,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:50:02,663 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 06:50:02,690 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:50:02,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:50:02,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:50:02,692 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:50:02,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:50:02,693 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:50:02,693 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:50:02,693 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:50:02,694 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:50:02,694 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:50:02,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:50:02,696 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:50:02,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:50:02,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:50:02,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:50:02,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:50:02,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:50:02,698 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:50:02,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:50:02,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:50:02,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:50:02,699 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:50:02,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:50:02,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:50:02,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:50:02,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:50:02,700 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:50:02,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:50:02,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:50:02,701 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:50:02,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:50:02,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:50:02,761 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:50:02,763 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:50:02,763 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:50:02,764 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 06:50:02,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43a5f945/6ddd11570b574a67a1e4a0595808b709/FLAG079f72c16 [2019-09-10 06:50:03,697 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:50:03,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 06:50:03,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43a5f945/6ddd11570b574a67a1e4a0595808b709/FLAG079f72c16 [2019-09-10 06:50:04,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43a5f945/6ddd11570b574a67a1e4a0595808b709 [2019-09-10 06:50:04,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:50:04,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:50:04,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:50:04,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:50:04,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:50:04,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:50:04" (1/1) ... [2019-09-10 06:50:04,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d17fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:04, skipping insertion in model container [2019-09-10 06:50:04,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:50:04" (1/1) ... [2019-09-10 06:50:04,196 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:50:04,512 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:50:06,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:50:06,907 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:50:07,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:50:07,914 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:50:07,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:07 WrapperNode [2019-09-10 06:50:07,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:50:07,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:50:07,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:50:07,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:50:07,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:07" (1/1) ... [2019-09-10 06:50:07,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:07" (1/1) ... [2019-09-10 06:50:08,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:07" (1/1) ... [2019-09-10 06:50:08,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:07" (1/1) ... [2019-09-10 06:50:08,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:07" (1/1) ... [2019-09-10 06:50:08,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:07" (1/1) ... [2019-09-10 06:50:08,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:07" (1/1) ... [2019-09-10 06:50:08,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:50:08,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:50:08,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:50:08,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:50:08,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:07" (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 06:50:08,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:50:08,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:50:08,443 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:50:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:50:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:50:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:50:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:50:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:50:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:50:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:50:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:50:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:50:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:50:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:50:08,445 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:50:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:50:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:50:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:50:08,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:50:17,615 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:50:17,615 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:50:17,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:50:17 BoogieIcfgContainer [2019-09-10 06:50:17,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:50:17,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:50:17,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:50:17,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:50:17,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:50:04" (1/3) ... [2019-09-10 06:50:17,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423cf790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:50:17, skipping insertion in model container [2019-09-10 06:50:17,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:50:07" (2/3) ... [2019-09-10 06:50:17,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423cf790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:50:17, skipping insertion in model container [2019-09-10 06:50:17,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:50:17" (3/3) ... [2019-09-10 06:50:17,629 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 06:50:17,640 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:50:17,652 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-10 06:50:17,672 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-10 06:50:17,704 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:50:17,705 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:50:17,705 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:50:17,705 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:50:17,705 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:50:17,706 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:50:17,706 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:50:17,706 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:50:17,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states. [2019-09-10 06:50:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:50:17,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:17,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:17,835 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:17,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash 659156996, now seen corresponding path program 1 times [2019-09-10 06:50:17,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:17,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:17,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:17,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:17,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:18,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:18,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:50:18,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:18,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:50:18,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:50:18,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:50:18,908 INFO L87 Difference]: Start difference. First operand 3737 states. Second operand 5 states. [2019-09-10 06:50:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:24,798 INFO L93 Difference]: Finished difference Result 4542 states and 7709 transitions. [2019-09-10 06:50:24,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:50:24,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-10 06:50:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:24,855 INFO L225 Difference]: With dead ends: 4542 [2019-09-10 06:50:24,855 INFO L226 Difference]: Without dead ends: 4530 [2019-09-10 06:50:24,861 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 06:50:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4530 states. [2019-09-10 06:50:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4530 to 4505. [2019-09-10 06:50:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4505 states. [2019-09-10 06:50:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4505 states to 4505 states and 5834 transitions. [2019-09-10 06:50:25,119 INFO L78 Accepts]: Start accepts. Automaton has 4505 states and 5834 transitions. Word has length 69 [2019-09-10 06:50:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:25,120 INFO L475 AbstractCegarLoop]: Abstraction has 4505 states and 5834 transitions. [2019-09-10 06:50:25,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:50:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4505 states and 5834 transitions. [2019-09-10 06:50:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:50:25,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:25,137 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:25,138 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:25,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:25,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1884466580, now seen corresponding path program 1 times [2019-09-10 06:50:25,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:25,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:25,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:25,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:25,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:25,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:25,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:50:25,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:25,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:50:25,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:50:25,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:50:25,506 INFO L87 Difference]: Start difference. First operand 4505 states and 5834 transitions. Second operand 6 states. [2019-09-10 06:50:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:29,011 INFO L93 Difference]: Finished difference Result 5966 states and 7762 transitions. [2019-09-10 06:50:29,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:50:29,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:50:29,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:29,048 INFO L225 Difference]: With dead ends: 5966 [2019-09-10 06:50:29,049 INFO L226 Difference]: Without dead ends: 5966 [2019-09-10 06:50:29,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:50:29,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2019-09-10 06:50:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 5934. [2019-09-10 06:50:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5934 states. [2019-09-10 06:50:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5934 states to 5934 states and 7744 transitions. [2019-09-10 06:50:29,247 INFO L78 Accepts]: Start accepts. Automaton has 5934 states and 7744 transitions. Word has length 70 [2019-09-10 06:50:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:29,248 INFO L475 AbstractCegarLoop]: Abstraction has 5934 states and 7744 transitions. [2019-09-10 06:50:29,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:50:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 5934 states and 7744 transitions. [2019-09-10 06:50:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:50:29,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:29,262 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:29,263 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:29,265 INFO L82 PathProgramCache]: Analyzing trace with hash 353186205, now seen corresponding path program 1 times [2019-09-10 06:50:29,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:29,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:29,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:29,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:29,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:29,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:29,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:50:29,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:29,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:50:29,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:50:29,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:50:29,530 INFO L87 Difference]: Start difference. First operand 5934 states and 7744 transitions. Second operand 6 states. [2019-09-10 06:50:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:32,463 INFO L93 Difference]: Finished difference Result 9772 states and 12788 transitions. [2019-09-10 06:50:32,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:50:32,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:50:32,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:32,511 INFO L225 Difference]: With dead ends: 9772 [2019-09-10 06:50:32,511 INFO L226 Difference]: Without dead ends: 9772 [2019-09-10 06:50:32,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:50:32,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9772 states. [2019-09-10 06:50:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9772 to 9727. [2019-09-10 06:50:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9727 states. [2019-09-10 06:50:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9727 states to 9727 states and 12757 transitions. [2019-09-10 06:50:32,727 INFO L78 Accepts]: Start accepts. Automaton has 9727 states and 12757 transitions. Word has length 70 [2019-09-10 06:50:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:32,728 INFO L475 AbstractCegarLoop]: Abstraction has 9727 states and 12757 transitions. [2019-09-10 06:50:32,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:50:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 9727 states and 12757 transitions. [2019-09-10 06:50:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:50:32,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:32,738 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:32,739 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:32,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1292285136, now seen corresponding path program 1 times [2019-09-10 06:50:32,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:32,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:32,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:32,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:32,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:33,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:33,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:50:33,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:33,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:50:33,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:50:33,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:50:33,075 INFO L87 Difference]: Start difference. First operand 9727 states and 12757 transitions. Second operand 6 states. [2019-09-10 06:50:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:35,570 INFO L93 Difference]: Finished difference Result 16122 states and 21514 transitions. [2019-09-10 06:50:35,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:50:35,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-10 06:50:35,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:35,623 INFO L225 Difference]: With dead ends: 16122 [2019-09-10 06:50:35,623 INFO L226 Difference]: Without dead ends: 16122 [2019-09-10 06:50:35,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:50:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16122 states. [2019-09-10 06:50:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16122 to 16072. [2019-09-10 06:50:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16072 states. [2019-09-10 06:50:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16072 states to 16072 states and 21477 transitions. [2019-09-10 06:50:35,886 INFO L78 Accepts]: Start accepts. Automaton has 16072 states and 21477 transitions. Word has length 71 [2019-09-10 06:50:35,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:35,887 INFO L475 AbstractCegarLoop]: Abstraction has 16072 states and 21477 transitions. [2019-09-10 06:50:35,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:50:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand 16072 states and 21477 transitions. [2019-09-10 06:50:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:50:35,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:35,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:35,903 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:35,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:35,904 INFO L82 PathProgramCache]: Analyzing trace with hash 77939992, now seen corresponding path program 1 times [2019-09-10 06:50:35,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:35,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:35,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:35,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:35,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:36,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:36,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:50:36,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:36,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:50:36,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:50:36,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:50:36,253 INFO L87 Difference]: Start difference. First operand 16072 states and 21477 transitions. Second operand 9 states. [2019-09-10 06:50:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:45,238 INFO L93 Difference]: Finished difference Result 43895 states and 61522 transitions. [2019-09-10 06:50:45,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:50:45,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 06:50:45,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:45,361 INFO L225 Difference]: With dead ends: 43895 [2019-09-10 06:50:45,361 INFO L226 Difference]: Without dead ends: 43895 [2019-09-10 06:50:45,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:50:45,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43895 states. [2019-09-10 06:50:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43895 to 15983. [2019-09-10 06:50:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15983 states. [2019-09-10 06:50:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15983 states to 15983 states and 21356 transitions. [2019-09-10 06:50:46,002 INFO L78 Accepts]: Start accepts. Automaton has 15983 states and 21356 transitions. Word has length 72 [2019-09-10 06:50:46,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:46,002 INFO L475 AbstractCegarLoop]: Abstraction has 15983 states and 21356 transitions. [2019-09-10 06:50:46,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:50:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 15983 states and 21356 transitions. [2019-09-10 06:50:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:50:46,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:46,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] [2019-09-10 06:50:46,014 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:46,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:46,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1490375194, now seen corresponding path program 1 times [2019-09-10 06:50:46,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:46,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:46,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:46,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:46,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:46,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:46,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:50:46,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:46,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:50:46,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:50:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:50:46,314 INFO L87 Difference]: Start difference. First operand 15983 states and 21356 transitions. Second operand 8 states. [2019-09-10 06:50:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:51,510 INFO L93 Difference]: Finished difference Result 36291 states and 52329 transitions. [2019-09-10 06:50:51,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:50:51,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-09-10 06:50:51,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:51,601 INFO L225 Difference]: With dead ends: 36291 [2019-09-10 06:50:51,602 INFO L226 Difference]: Without dead ends: 36291 [2019-09-10 06:50:51,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:50:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36291 states. [2019-09-10 06:50:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36291 to 15710. [2019-09-10 06:50:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15710 states. [2019-09-10 06:50:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15710 states to 15710 states and 20999 transitions. [2019-09-10 06:50:52,213 INFO L78 Accepts]: Start accepts. Automaton has 15710 states and 20999 transitions. Word has length 72 [2019-09-10 06:50:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:52,213 INFO L475 AbstractCegarLoop]: Abstraction has 15710 states and 20999 transitions. [2019-09-10 06:50:52,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:50:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states and 20999 transitions. [2019-09-10 06:50:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:50:52,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:52,226 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:52,227 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:52,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:52,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2027444782, now seen corresponding path program 1 times [2019-09-10 06:50:52,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:52,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:52,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:52,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:52,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:52,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:52,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:50:52,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:52,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:50:52,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:50:52,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:50:52,540 INFO L87 Difference]: Start difference. First operand 15710 states and 20999 transitions. Second operand 9 states. [2019-09-10 06:50:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:57,764 INFO L93 Difference]: Finished difference Result 21312 states and 29436 transitions. [2019-09-10 06:50:57,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:50:57,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 06:50:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:57,796 INFO L225 Difference]: With dead ends: 21312 [2019-09-10 06:50:57,796 INFO L226 Difference]: Without dead ends: 21312 [2019-09-10 06:50:57,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:50:57,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21312 states. [2019-09-10 06:50:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21312 to 15710. [2019-09-10 06:50:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15710 states. [2019-09-10 06:50:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15710 states to 15710 states and 20998 transitions. [2019-09-10 06:50:58,080 INFO L78 Accepts]: Start accepts. Automaton has 15710 states and 20998 transitions. Word has length 73 [2019-09-10 06:50:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:58,080 INFO L475 AbstractCegarLoop]: Abstraction has 15710 states and 20998 transitions. [2019-09-10 06:50:58,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:50:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states and 20998 transitions. [2019-09-10 06:50:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:50:58,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:58,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] [2019-09-10 06:50:58,090 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:58,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:58,091 INFO L82 PathProgramCache]: Analyzing trace with hash 233124012, now seen corresponding path program 1 times [2019-09-10 06:50:58,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:58,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:58,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:58,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:58,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:58,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 06:50:58,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:58,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:50:58,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:58,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:50:58,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:50:58,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:50:58,365 INFO L87 Difference]: Start difference. First operand 15710 states and 20998 transitions. Second operand 9 states. [2019-09-10 06:51:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:04,517 INFO L93 Difference]: Finished difference Result 24317 states and 33926 transitions. [2019-09-10 06:51:04,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:51:04,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-10 06:51:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:04,543 INFO L225 Difference]: With dead ends: 24317 [2019-09-10 06:51:04,543 INFO L226 Difference]: Without dead ends: 24317 [2019-09-10 06:51:04,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-10 06:51:04,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24317 states. [2019-09-10 06:51:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24317 to 15710. [2019-09-10 06:51:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15710 states. [2019-09-10 06:51:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15710 states to 15710 states and 20997 transitions. [2019-09-10 06:51:04,799 INFO L78 Accepts]: Start accepts. Automaton has 15710 states and 20997 transitions. Word has length 73 [2019-09-10 06:51:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:04,799 INFO L475 AbstractCegarLoop]: Abstraction has 15710 states and 20997 transitions. [2019-09-10 06:51:04,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:51:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states and 20997 transitions. [2019-09-10 06:51:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:51:04,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:04,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:04,809 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:04,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:04,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2061206434, now seen corresponding path program 1 times [2019-09-10 06:51:04,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:04,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:04,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:04,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:04,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:05,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:05,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:05,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:51:05,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:05,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:51:05,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:51:05,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:51:05,370 INFO L87 Difference]: Start difference. First operand 15710 states and 20997 transitions. Second operand 13 states. [2019-09-10 06:51:05,508 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-09-10 06:51:06,054 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 06:51:06,271 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 06:51:06,551 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 06:51:06,894 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-09-10 06:51:08,204 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 06:51:09,038 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 06:51:09,442 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-10 06:51:14,030 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 06:51:14,539 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 06:51:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:16,565 INFO L93 Difference]: Finished difference Result 89810 states and 132873 transitions. [2019-09-10 06:51:16,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 06:51:16,566 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2019-09-10 06:51:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:16,665 INFO L225 Difference]: With dead ends: 89810 [2019-09-10 06:51:16,665 INFO L226 Difference]: Without dead ends: 89810 [2019-09-10 06:51:16,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 06:51:16,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89810 states. [2019-09-10 06:51:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89810 to 15706. [2019-09-10 06:51:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15706 states. [2019-09-10 06:51:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15706 states to 15706 states and 20993 transitions. [2019-09-10 06:51:17,225 INFO L78 Accepts]: Start accepts. Automaton has 15706 states and 20993 transitions. Word has length 73 [2019-09-10 06:51:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:17,225 INFO L475 AbstractCegarLoop]: Abstraction has 15706 states and 20993 transitions. [2019-09-10 06:51:17,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:51:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 15706 states and 20993 transitions. [2019-09-10 06:51:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:51:17,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:17,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:17,235 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:17,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:17,235 INFO L82 PathProgramCache]: Analyzing trace with hash -993343041, now seen corresponding path program 1 times [2019-09-10 06:51:17,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:17,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:17,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:17,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:17,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:17,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:17,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:51:17,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:17,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:51:17,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:51:17,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:51:17,778 INFO L87 Difference]: Start difference. First operand 15706 states and 20993 transitions. Second operand 12 states. [2019-09-10 06:51:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:22,295 INFO L93 Difference]: Finished difference Result 57224 states and 83979 transitions. [2019-09-10 06:51:22,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:51:22,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-10 06:51:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:22,347 INFO L225 Difference]: With dead ends: 57224 [2019-09-10 06:51:22,348 INFO L226 Difference]: Without dead ends: 57224 [2019-09-10 06:51:22,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:51:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57224 states. [2019-09-10 06:51:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57224 to 15614. [2019-09-10 06:51:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15614 states. [2019-09-10 06:51:22,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15614 states to 15614 states and 20864 transitions. [2019-09-10 06:51:22,669 INFO L78 Accepts]: Start accepts. Automaton has 15614 states and 20864 transitions. Word has length 73 [2019-09-10 06:51:22,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:22,669 INFO L475 AbstractCegarLoop]: Abstraction has 15614 states and 20864 transitions. [2019-09-10 06:51:22,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:51:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 15614 states and 20864 transitions. [2019-09-10 06:51:22,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:51:22,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:22,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:22,676 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:22,676 INFO L82 PathProgramCache]: Analyzing trace with hash -20725892, now seen corresponding path program 1 times [2019-09-10 06:51:22,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:22,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:22,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:22,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:22,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:23,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:23,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:51:23,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:23,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:51:23,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:51:23,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:51:23,250 INFO L87 Difference]: Start difference. First operand 15614 states and 20864 transitions. Second operand 12 states. [2019-09-10 06:51:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:27,338 INFO L93 Difference]: Finished difference Result 61637 states and 90644 transitions. [2019-09-10 06:51:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:51:27,338 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-10 06:51:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:27,403 INFO L225 Difference]: With dead ends: 61637 [2019-09-10 06:51:27,404 INFO L226 Difference]: Without dead ends: 61637 [2019-09-10 06:51:27,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:51:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61637 states. [2019-09-10 06:51:27,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61637 to 15605. [2019-09-10 06:51:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15605 states. [2019-09-10 06:51:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15605 states to 15605 states and 20854 transitions. [2019-09-10 06:51:27,788 INFO L78 Accepts]: Start accepts. Automaton has 15605 states and 20854 transitions. Word has length 74 [2019-09-10 06:51:27,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:27,788 INFO L475 AbstractCegarLoop]: Abstraction has 15605 states and 20854 transitions. [2019-09-10 06:51:27,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:51:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 15605 states and 20854 transitions. [2019-09-10 06:51:27,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:51:27,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:27,795 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:27,796 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:27,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:27,796 INFO L82 PathProgramCache]: Analyzing trace with hash 538122635, now seen corresponding path program 1 times [2019-09-10 06:51:27,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:27,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:27,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:27,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:27,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:28,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:28,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:51:28,243 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:28,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:51:28,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:51:28,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:51:28,244 INFO L87 Difference]: Start difference. First operand 15605 states and 20854 transitions. Second operand 10 states. [2019-09-10 06:51:32,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:32,461 INFO L93 Difference]: Finished difference Result 65858 states and 97028 transitions. [2019-09-10 06:51:32,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:51:32,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-10 06:51:32,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:32,536 INFO L225 Difference]: With dead ends: 65858 [2019-09-10 06:51:32,536 INFO L226 Difference]: Without dead ends: 65858 [2019-09-10 06:51:32,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:51:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65858 states. [2019-09-10 06:51:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65858 to 15552. [2019-09-10 06:51:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15552 states. [2019-09-10 06:51:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15552 states to 15552 states and 20793 transitions. [2019-09-10 06:51:33,054 INFO L78 Accepts]: Start accepts. Automaton has 15552 states and 20793 transitions. Word has length 74 [2019-09-10 06:51:33,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:33,054 INFO L475 AbstractCegarLoop]: Abstraction has 15552 states and 20793 transitions. [2019-09-10 06:51:33,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:51:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 15552 states and 20793 transitions. [2019-09-10 06:51:33,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:51:33,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:33,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:33,061 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:33,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:33,062 INFO L82 PathProgramCache]: Analyzing trace with hash -150966617, now seen corresponding path program 1 times [2019-09-10 06:51:33,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:33,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:33,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:33,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:33,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:33,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:33,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:51:33,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:33,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:51:33,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:51:33,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:33,214 INFO L87 Difference]: Start difference. First operand 15552 states and 20793 transitions. Second operand 3 states. [2019-09-10 06:51:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:33,393 INFO L93 Difference]: Finished difference Result 14591 states and 20165 transitions. [2019-09-10 06:51:33,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:51:33,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 06:51:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:33,412 INFO L225 Difference]: With dead ends: 14591 [2019-09-10 06:51:33,412 INFO L226 Difference]: Without dead ends: 14591 [2019-09-10 06:51:33,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14591 states. [2019-09-10 06:51:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14591 to 14572. [2019-09-10 06:51:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14572 states. [2019-09-10 06:51:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 20152 transitions. [2019-09-10 06:51:33,600 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 20152 transitions. Word has length 74 [2019-09-10 06:51:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:33,601 INFO L475 AbstractCegarLoop]: Abstraction has 14572 states and 20152 transitions. [2019-09-10 06:51:33,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:51:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 20152 transitions. [2019-09-10 06:51:33,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:51:33,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:33,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:33,609 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:33,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:33,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2076823766, now seen corresponding path program 1 times [2019-09-10 06:51:33,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:33,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:33,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:33,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:33,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:33,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:33,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:51:33,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:33,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:51:33,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:51:33,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:51:33,914 INFO L87 Difference]: Start difference. First operand 14572 states and 20152 transitions. Second operand 9 states. [2019-09-10 06:51:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:40,176 INFO L93 Difference]: Finished difference Result 55347 states and 79787 transitions. [2019-09-10 06:51:40,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:51:40,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 06:51:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:40,248 INFO L225 Difference]: With dead ends: 55347 [2019-09-10 06:51:40,248 INFO L226 Difference]: Without dead ends: 55347 [2019-09-10 06:51:40,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:51:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55347 states. [2019-09-10 06:51:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55347 to 14572. [2019-09-10 06:51:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14572 states. [2019-09-10 06:51:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 20150 transitions. [2019-09-10 06:51:40,628 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 20150 transitions. Word has length 75 [2019-09-10 06:51:40,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:40,629 INFO L475 AbstractCegarLoop]: Abstraction has 14572 states and 20150 transitions. [2019-09-10 06:51:40,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:51:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 20150 transitions. [2019-09-10 06:51:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:51:40,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:40,635 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:40,636 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:40,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:40,636 INFO L82 PathProgramCache]: Analyzing trace with hash -68973770, now seen corresponding path program 1 times [2019-09-10 06:51:40,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:40,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:40,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:40,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:40,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:40,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:40,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:51:40,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:40,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:51:40,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:51:40,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:51:40,913 INFO L87 Difference]: Start difference. First operand 14572 states and 20150 transitions. Second operand 8 states. [2019-09-10 06:51:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:44,260 INFO L93 Difference]: Finished difference Result 48436 states and 71641 transitions. [2019-09-10 06:51:44,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:51:44,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2019-09-10 06:51:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:44,308 INFO L225 Difference]: With dead ends: 48436 [2019-09-10 06:51:44,308 INFO L226 Difference]: Without dead ends: 48436 [2019-09-10 06:51:44,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:51:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48436 states. [2019-09-10 06:51:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48436 to 14572. [2019-09-10 06:51:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14572 states. [2019-09-10 06:51:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 20149 transitions. [2019-09-10 06:51:44,710 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 20149 transitions. Word has length 75 [2019-09-10 06:51:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:44,711 INFO L475 AbstractCegarLoop]: Abstraction has 14572 states and 20149 transitions. [2019-09-10 06:51:44,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:51:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 20149 transitions. [2019-09-10 06:51:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:51:44,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:44,716 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:44,716 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:44,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:44,717 INFO L82 PathProgramCache]: Analyzing trace with hash 537217189, now seen corresponding path program 1 times [2019-09-10 06:51:44,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:44,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:44,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:44,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:44,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:44,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:44,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:51:44,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:44,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:51:44,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:51:44,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:51:44,978 INFO L87 Difference]: Start difference. First operand 14572 states and 20149 transitions. Second operand 9 states. [2019-09-10 06:51:51,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:51,549 INFO L93 Difference]: Finished difference Result 54477 states and 78715 transitions. [2019-09-10 06:51:51,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:51:51,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 06:51:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:51,609 INFO L225 Difference]: With dead ends: 54477 [2019-09-10 06:51:51,609 INFO L226 Difference]: Without dead ends: 54477 [2019-09-10 06:51:51,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:51:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54477 states. [2019-09-10 06:51:52,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54477 to 14572. [2019-09-10 06:51:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14572 states. [2019-09-10 06:51:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 20148 transitions. [2019-09-10 06:51:52,100 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 20148 transitions. Word has length 75 [2019-09-10 06:51:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:52,101 INFO L475 AbstractCegarLoop]: Abstraction has 14572 states and 20148 transitions. [2019-09-10 06:51:52,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:51:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 20148 transitions. [2019-09-10 06:51:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:51:52,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:52,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:52,105 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:52,106 INFO L82 PathProgramCache]: Analyzing trace with hash 886824694, now seen corresponding path program 1 times [2019-09-10 06:51:52,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:52,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:52,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:52,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:52,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:52,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:52,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:51:52,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:52,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:51:52,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:51:52,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:51:52,363 INFO L87 Difference]: Start difference. First operand 14572 states and 20148 transitions. Second operand 9 states. [2019-09-10 06:51:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:57,064 INFO L93 Difference]: Finished difference Result 49007 states and 72227 transitions. [2019-09-10 06:51:57,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:51:57,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 06:51:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:57,114 INFO L225 Difference]: With dead ends: 49007 [2019-09-10 06:51:57,114 INFO L226 Difference]: Without dead ends: 49007 [2019-09-10 06:51:57,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:51:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49007 states. [2019-09-10 06:51:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49007 to 14572. [2019-09-10 06:51:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14572 states. [2019-09-10 06:51:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 20147 transitions. [2019-09-10 06:51:57,400 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 20147 transitions. Word has length 75 [2019-09-10 06:51:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:57,400 INFO L475 AbstractCegarLoop]: Abstraction has 14572 states and 20147 transitions. [2019-09-10 06:51:57,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:51:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 20147 transitions. [2019-09-10 06:51:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:51:57,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:57,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:57,405 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:57,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:57,405 INFO L82 PathProgramCache]: Analyzing trace with hash -553258111, now seen corresponding path program 1 times [2019-09-10 06:51:57,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:57,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:57,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:57,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:57,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:57,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:57,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:51:57,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:57,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:51:57,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:51:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:57,543 INFO L87 Difference]: Start difference. First operand 14572 states and 20147 transitions. Second operand 3 states. [2019-09-10 06:51:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:57,734 INFO L93 Difference]: Finished difference Result 16786 states and 23974 transitions. [2019-09-10 06:51:57,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:51:57,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 06:51:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:57,751 INFO L225 Difference]: With dead ends: 16786 [2019-09-10 06:51:57,752 INFO L226 Difference]: Without dead ends: 16786 [2019-09-10 06:51:57,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16786 states. [2019-09-10 06:51:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16786 to 16778. [2019-09-10 06:51:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16778 states. [2019-09-10 06:51:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16778 states to 16778 states and 23970 transitions. [2019-09-10 06:51:57,898 INFO L78 Accepts]: Start accepts. Automaton has 16778 states and 23970 transitions. Word has length 75 [2019-09-10 06:51:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:57,898 INFO L475 AbstractCegarLoop]: Abstraction has 16778 states and 23970 transitions. [2019-09-10 06:51:57,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:51:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 16778 states and 23970 transitions. [2019-09-10 06:51:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:51:57,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:57,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:57,902 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:57,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:57,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2136318529, now seen corresponding path program 1 times [2019-09-10 06:51:57,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:57,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:57,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:57,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:58,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:58,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:51:58,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:58,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:51:58,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:51:58,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:58,183 INFO L87 Difference]: Start difference. First operand 16778 states and 23970 transitions. Second operand 3 states. [2019-09-10 06:51:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:58,394 INFO L93 Difference]: Finished difference Result 28215 states and 40132 transitions. [2019-09-10 06:51:58,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:51:58,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:51:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:58,421 INFO L225 Difference]: With dead ends: 28215 [2019-09-10 06:51:58,421 INFO L226 Difference]: Without dead ends: 28215 [2019-09-10 06:51:58,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:58,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28215 states. [2019-09-10 06:51:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28215 to 28207. [2019-09-10 06:51:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28207 states. [2019-09-10 06:51:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28207 states to 28207 states and 40128 transitions. [2019-09-10 06:51:58,694 INFO L78 Accepts]: Start accepts. Automaton has 28207 states and 40128 transitions. Word has length 76 [2019-09-10 06:51:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:58,695 INFO L475 AbstractCegarLoop]: Abstraction has 28207 states and 40128 transitions. [2019-09-10 06:51:58,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:51:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 28207 states and 40128 transitions. [2019-09-10 06:51:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:51:58,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:58,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:58,699 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1610299721, now seen corresponding path program 1 times [2019-09-10 06:51:58,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:58,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:58,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:58,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:58,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:58,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:58,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:51:58,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:58,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:51:58,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:51:58,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:58,845 INFO L87 Difference]: Start difference. First operand 28207 states and 40128 transitions. Second operand 3 states. [2019-09-10 06:51:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:59,050 INFO L93 Difference]: Finished difference Result 47835 states and 68360 transitions. [2019-09-10 06:51:59,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:51:59,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:51:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:59,097 INFO L225 Difference]: With dead ends: 47835 [2019-09-10 06:51:59,097 INFO L226 Difference]: Without dead ends: 47835 [2019-09-10 06:51:59,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47835 states. [2019-09-10 06:51:59,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47835 to 41109. [2019-09-10 06:51:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41109 states. [2019-09-10 06:51:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41109 states to 41109 states and 58436 transitions. [2019-09-10 06:51:59,538 INFO L78 Accepts]: Start accepts. Automaton has 41109 states and 58436 transitions. Word has length 76 [2019-09-10 06:51:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:59,538 INFO L475 AbstractCegarLoop]: Abstraction has 41109 states and 58436 transitions. [2019-09-10 06:51:59,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:51:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 41109 states and 58436 transitions. [2019-09-10 06:51:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:51:59,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:59,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:59,544 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:59,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:59,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1479085215, now seen corresponding path program 1 times [2019-09-10 06:51:59,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:59,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:59,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:59,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:59,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:59,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:59,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:51:59,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:59,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:51:59,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:51:59,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:51:59,686 INFO L87 Difference]: Start difference. First operand 41109 states and 58436 transitions. Second operand 3 states. [2019-09-10 06:51:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:59,929 INFO L93 Difference]: Finished difference Result 68387 states and 98026 transitions. [2019-09-10 06:51:59,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:51:59,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:51:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:00,012 INFO L225 Difference]: With dead ends: 68387 [2019-09-10 06:52:00,012 INFO L226 Difference]: Without dead ends: 68387 [2019-09-10 06:52:00,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:52:00,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68387 states. [2019-09-10 06:52:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68387 to 49295. [2019-09-10 06:52:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49295 states. [2019-09-10 06:52:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49295 states to 49295 states and 70175 transitions. [2019-09-10 06:52:02,573 INFO L78 Accepts]: Start accepts. Automaton has 49295 states and 70175 transitions. Word has length 76 [2019-09-10 06:52:02,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:02,573 INFO L475 AbstractCegarLoop]: Abstraction has 49295 states and 70175 transitions. [2019-09-10 06:52:02,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:52:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 49295 states and 70175 transitions. [2019-09-10 06:52:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:52:02,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:02,579 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:02,579 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:02,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:02,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1487016584, now seen corresponding path program 1 times [2019-09-10 06:52:02,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:02,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:02,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:02,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:02,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:02,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 06:52:02,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:02,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:52:02,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:02,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:52:02,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:52:02,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:52:02,831 INFO L87 Difference]: Start difference. First operand 49295 states and 70175 transitions. Second operand 9 states. [2019-09-10 06:52:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:06,694 INFO L93 Difference]: Finished difference Result 111668 states and 160765 transitions. [2019-09-10 06:52:06,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:52:06,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-09-10 06:52:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:06,842 INFO L225 Difference]: With dead ends: 111668 [2019-09-10 06:52:06,842 INFO L226 Difference]: Without dead ends: 111668 [2019-09-10 06:52:06,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:52:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111668 states. [2019-09-10 06:52:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111668 to 49290. [2019-09-10 06:52:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49290 states. [2019-09-10 06:52:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49290 states to 49290 states and 70166 transitions. [2019-09-10 06:52:07,790 INFO L78 Accepts]: Start accepts. Automaton has 49290 states and 70166 transitions. Word has length 77 [2019-09-10 06:52:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:07,791 INFO L475 AbstractCegarLoop]: Abstraction has 49290 states and 70166 transitions. [2019-09-10 06:52:07,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:52:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 49290 states and 70166 transitions. [2019-09-10 06:52:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:52:07,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:07,796 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:07,796 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:07,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:07,797 INFO L82 PathProgramCache]: Analyzing trace with hash -622390050, now seen corresponding path program 1 times [2019-09-10 06:52:07,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:07,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:07,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:07,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:07,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:07,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:07,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:52:07,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:07,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:52:07,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:52:07,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:52:07,927 INFO L87 Difference]: Start difference. First operand 49290 states and 70166 transitions. Second operand 3 states. [2019-09-10 06:52:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:08,671 INFO L93 Difference]: Finished difference Result 80199 states and 115804 transitions. [2019-09-10 06:52:08,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:52:08,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:52:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:08,777 INFO L225 Difference]: With dead ends: 80199 [2019-09-10 06:52:08,778 INFO L226 Difference]: Without dead ends: 80199 [2019-09-10 06:52:08,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:52:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80199 states. [2019-09-10 06:52:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80199 to 62679. [2019-09-10 06:52:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62679 states. [2019-09-10 06:52:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62679 states to 62679 states and 90286 transitions. [2019-09-10 06:52:09,686 INFO L78 Accepts]: Start accepts. Automaton has 62679 states and 90286 transitions. Word has length 77 [2019-09-10 06:52:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:09,686 INFO L475 AbstractCegarLoop]: Abstraction has 62679 states and 90286 transitions. [2019-09-10 06:52:09,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:52:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 62679 states and 90286 transitions. [2019-09-10 06:52:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:52:09,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:09,692 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:09,693 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:09,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:09,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1208905319, now seen corresponding path program 1 times [2019-09-10 06:52:09,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:09,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:09,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:09,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:09,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:09,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:52:09,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:09,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:52:09,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:52:09,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:52:09,836 INFO L87 Difference]: Start difference. First operand 62679 states and 90286 transitions. Second operand 3 states. [2019-09-10 06:52:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:10,206 INFO L93 Difference]: Finished difference Result 74713 states and 107848 transitions. [2019-09-10 06:52:10,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:52:10,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:52:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:10,311 INFO L225 Difference]: With dead ends: 74713 [2019-09-10 06:52:10,311 INFO L226 Difference]: Without dead ends: 74713 [2019-09-10 06:52:10,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:52:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74713 states. [2019-09-10 06:52:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74713 to 59880. [2019-09-10 06:52:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59880 states. [2019-09-10 06:52:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59880 states to 59880 states and 86575 transitions. [2019-09-10 06:52:11,026 INFO L78 Accepts]: Start accepts. Automaton has 59880 states and 86575 transitions. Word has length 77 [2019-09-10 06:52:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:11,027 INFO L475 AbstractCegarLoop]: Abstraction has 59880 states and 86575 transitions. [2019-09-10 06:52:11,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:52:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 59880 states and 86575 transitions. [2019-09-10 06:52:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:52:11,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:11,029 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:11,030 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:11,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:11,030 INFO L82 PathProgramCache]: Analyzing trace with hash 623453508, now seen corresponding path program 1 times [2019-09-10 06:52:11,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:11,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:11,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:11,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:11,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:13,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:13,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:52:13,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:13,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:52:13,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:52:13,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:52:13,026 INFO L87 Difference]: Start difference. First operand 59880 states and 86575 transitions. Second operand 9 states. [2019-09-10 06:52:16,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:16,585 INFO L93 Difference]: Finished difference Result 141742 states and 205426 transitions. [2019-09-10 06:52:16,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:52:16,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 06:52:16,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:16,778 INFO L225 Difference]: With dead ends: 141742 [2019-09-10 06:52:16,778 INFO L226 Difference]: Without dead ends: 141742 [2019-09-10 06:52:16,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:52:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141742 states. [2019-09-10 06:52:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141742 to 59880. [2019-09-10 06:52:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59880 states. [2019-09-10 06:52:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59880 states to 59880 states and 86573 transitions. [2019-09-10 06:52:17,947 INFO L78 Accepts]: Start accepts. Automaton has 59880 states and 86573 transitions. Word has length 78 [2019-09-10 06:52:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:17,948 INFO L475 AbstractCegarLoop]: Abstraction has 59880 states and 86573 transitions. [2019-09-10 06:52:17,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:52:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 59880 states and 86573 transitions. [2019-09-10 06:52:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:52:17,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:17,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:17,951 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:17,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:17,952 INFO L82 PathProgramCache]: Analyzing trace with hash 858175544, now seen corresponding path program 1 times [2019-09-10 06:52:17,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:17,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:17,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:17,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:18,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:18,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:52:18,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:18,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:52:18,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:52:18,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:52:18,199 INFO L87 Difference]: Start difference. First operand 59880 states and 86573 transitions. Second operand 9 states. [2019-09-10 06:52:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:22,201 INFO L93 Difference]: Finished difference Result 141726 states and 205408 transitions. [2019-09-10 06:52:22,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:52:22,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 06:52:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:22,385 INFO L225 Difference]: With dead ends: 141726 [2019-09-10 06:52:22,385 INFO L226 Difference]: Without dead ends: 141726 [2019-09-10 06:52:22,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:52:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141726 states. [2019-09-10 06:52:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141726 to 59880. [2019-09-10 06:52:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59880 states. [2019-09-10 06:52:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59880 states to 59880 states and 86571 transitions. [2019-09-10 06:52:23,704 INFO L78 Accepts]: Start accepts. Automaton has 59880 states and 86571 transitions. Word has length 78 [2019-09-10 06:52:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:23,704 INFO L475 AbstractCegarLoop]: Abstraction has 59880 states and 86571 transitions. [2019-09-10 06:52:23,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:52:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 59880 states and 86571 transitions. [2019-09-10 06:52:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:52:23,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:23,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] [2019-09-10 06:52:23,707 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:23,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:23,707 INFO L82 PathProgramCache]: Analyzing trace with hash 138734116, now seen corresponding path program 1 times [2019-09-10 06:52:23,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:23,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:23,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:23,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:23,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:23,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:23,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:52:23,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:23,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:52:23,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:52:23,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:52:23,938 INFO L87 Difference]: Start difference. First operand 59880 states and 86571 transitions. Second operand 9 states. [2019-09-10 06:52:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:27,912 INFO L93 Difference]: Finished difference Result 141726 states and 205406 transitions. [2019-09-10 06:52:27,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:52:27,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 06:52:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:28,095 INFO L225 Difference]: With dead ends: 141726 [2019-09-10 06:52:28,095 INFO L226 Difference]: Without dead ends: 141726 [2019-09-10 06:52:28,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:52:28,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141726 states. [2019-09-10 06:52:29,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141726 to 59880. [2019-09-10 06:52:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59880 states. [2019-09-10 06:52:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59880 states to 59880 states and 86569 transitions. [2019-09-10 06:52:29,338 INFO L78 Accepts]: Start accepts. Automaton has 59880 states and 86569 transitions. Word has length 78 [2019-09-10 06:52:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:29,338 INFO L475 AbstractCegarLoop]: Abstraction has 59880 states and 86569 transitions. [2019-09-10 06:52:29,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:52:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 59880 states and 86569 transitions. [2019-09-10 06:52:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:52:29,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:29,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:29,341 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:29,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:29,342 INFO L82 PathProgramCache]: Analyzing trace with hash 960156932, now seen corresponding path program 1 times [2019-09-10 06:52:29,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:29,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:29,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:29,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:29,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:29,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:29,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:52:29,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:29,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:52:29,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:52:29,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:52:29,563 INFO L87 Difference]: Start difference. First operand 59880 states and 86569 transitions. Second operand 9 states. [2019-09-10 06:52:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:33,316 INFO L93 Difference]: Finished difference Result 141726 states and 205404 transitions. [2019-09-10 06:52:33,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:52:33,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 06:52:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:33,507 INFO L225 Difference]: With dead ends: 141726 [2019-09-10 06:52:33,507 INFO L226 Difference]: Without dead ends: 141726 [2019-09-10 06:52:33,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:52:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141726 states. [2019-09-10 06:52:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141726 to 59880. [2019-09-10 06:52:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59880 states. [2019-09-10 06:52:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59880 states to 59880 states and 86567 transitions. [2019-09-10 06:52:34,643 INFO L78 Accepts]: Start accepts. Automaton has 59880 states and 86567 transitions. Word has length 78 [2019-09-10 06:52:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:34,643 INFO L475 AbstractCegarLoop]: Abstraction has 59880 states and 86567 transitions. [2019-09-10 06:52:34,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:52:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 59880 states and 86567 transitions. [2019-09-10 06:52:34,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:52:34,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:34,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:34,646 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:34,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1614737059, now seen corresponding path program 1 times [2019-09-10 06:52:34,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:34,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:34,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:34,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:34,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:52:34,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:34,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:52:34,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:52:34,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:52:34,844 INFO L87 Difference]: Start difference. First operand 59880 states and 86567 transitions. Second operand 9 states. [2019-09-10 06:52:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:38,508 INFO L93 Difference]: Finished difference Result 106840 states and 154397 transitions. [2019-09-10 06:52:38,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:52:38,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-10 06:52:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:38,615 INFO L225 Difference]: With dead ends: 106840 [2019-09-10 06:52:38,616 INFO L226 Difference]: Without dead ends: 106840 [2019-09-10 06:52:38,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:52:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106840 states. [2019-09-10 06:52:39,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106840 to 59880. [2019-09-10 06:52:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59880 states. [2019-09-10 06:52:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59880 states to 59880 states and 86565 transitions. [2019-09-10 06:52:39,396 INFO L78 Accepts]: Start accepts. Automaton has 59880 states and 86565 transitions. Word has length 78 [2019-09-10 06:52:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:39,396 INFO L475 AbstractCegarLoop]: Abstraction has 59880 states and 86565 transitions. [2019-09-10 06:52:39,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:52:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 59880 states and 86565 transitions. [2019-09-10 06:52:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:52:39,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:39,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:39,401 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:39,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:39,401 INFO L82 PathProgramCache]: Analyzing trace with hash -939828288, now seen corresponding path program 1 times [2019-09-10 06:52:39,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:39,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:39,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:39,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:39,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:39,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:39,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:52:39,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:39,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:52:39,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:52:39,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:52:39,523 INFO L87 Difference]: Start difference. First operand 59880 states and 86565 transitions. Second operand 3 states. [2019-09-10 06:52:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:39,820 INFO L93 Difference]: Finished difference Result 108266 states and 155099 transitions. [2019-09-10 06:52:39,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:52:39,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 06:52:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:39,947 INFO L225 Difference]: With dead ends: 108266 [2019-09-10 06:52:39,947 INFO L226 Difference]: Without dead ends: 108266 [2019-09-10 06:52:39,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:52:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108266 states. [2019-09-10 06:52:40,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108266 to 75182. [2019-09-10 06:52:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75182 states. [2019-09-10 06:52:40,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75182 states to 75182 states and 107526 transitions. [2019-09-10 06:52:40,894 INFO L78 Accepts]: Start accepts. Automaton has 75182 states and 107526 transitions. Word has length 79 [2019-09-10 06:52:40,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:40,895 INFO L475 AbstractCegarLoop]: Abstraction has 75182 states and 107526 transitions. [2019-09-10 06:52:40,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:52:40,895 INFO L276 IsEmpty]: Start isEmpty. Operand 75182 states and 107526 transitions. [2019-09-10 06:52:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:52:40,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:40,898 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:40,899 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:40,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:40,899 INFO L82 PathProgramCache]: Analyzing trace with hash 580694754, now seen corresponding path program 1 times [2019-09-10 06:52:40,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:40,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:40,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:40,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:40,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:42,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:42,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:52:42,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:42,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:52:42,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:52:42,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:52:42,043 INFO L87 Difference]: Start difference. First operand 75182 states and 107526 transitions. Second operand 19 states. [2019-09-10 06:52:42,872 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 06:52:43,398 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 06:52:43,750 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 06:52:43,919 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 06:52:44,251 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 06:52:44,414 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-09-10 06:52:44,639 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 06:52:44,809 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-10 06:52:45,002 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-09-10 06:52:45,190 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 06:52:45,651 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-09-10 06:52:45,840 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 06:52:46,399 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-09-10 06:52:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:52,130 INFO L93 Difference]: Finished difference Result 128213 states and 182253 transitions. [2019-09-10 06:52:52,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:52:52,131 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81 [2019-09-10 06:52:52,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:52,261 INFO L225 Difference]: With dead ends: 128213 [2019-09-10 06:52:52,261 INFO L226 Difference]: Without dead ends: 128213 [2019-09-10 06:52:52,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=364, Invalid=1196, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:52:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128213 states. [2019-09-10 06:52:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128213 to 75141. [2019-09-10 06:52:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75141 states. [2019-09-10 06:52:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75141 states to 75141 states and 107472 transitions. [2019-09-10 06:52:55,781 INFO L78 Accepts]: Start accepts. Automaton has 75141 states and 107472 transitions. Word has length 81 [2019-09-10 06:52:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:55,781 INFO L475 AbstractCegarLoop]: Abstraction has 75141 states and 107472 transitions. [2019-09-10 06:52:55,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:52:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 75141 states and 107472 transitions. [2019-09-10 06:52:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:52:55,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:55,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:55,785 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:55,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:55,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2015932355, now seen corresponding path program 1 times [2019-09-10 06:52:55,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:55,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:55,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:55,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:55,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:57,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:57,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:52:57,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:57,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:52:57,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:52:57,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:52:57,146 INFO L87 Difference]: Start difference. First operand 75141 states and 107472 transitions. Second operand 21 states. [2019-09-10 06:52:57,813 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 06:52:58,127 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 06:52:58,573 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-09-10 06:52:58,882 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:53:06,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:06,076 INFO L93 Difference]: Finished difference Result 83123 states and 118634 transitions. [2019-09-10 06:53:06,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:53:06,077 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2019-09-10 06:53:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:06,173 INFO L225 Difference]: With dead ends: 83123 [2019-09-10 06:53:06,174 INFO L226 Difference]: Without dead ends: 83123 [2019-09-10 06:53:06,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:53:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83123 states. [2019-09-10 06:53:06,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83123 to 75132. [2019-09-10 06:53:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75132 states. [2019-09-10 06:53:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75132 states to 75132 states and 107457 transitions. [2019-09-10 06:53:07,016 INFO L78 Accepts]: Start accepts. Automaton has 75132 states and 107457 transitions. Word has length 81 [2019-09-10 06:53:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:07,016 INFO L475 AbstractCegarLoop]: Abstraction has 75132 states and 107457 transitions. [2019-09-10 06:53:07,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:53:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 75132 states and 107457 transitions. [2019-09-10 06:53:07,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:53:07,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:07,020 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:07,020 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:07,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:07,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2007393057, now seen corresponding path program 1 times [2019-09-10 06:53:07,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:07,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:07,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:07,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:07,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:07,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:07,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:53:07,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:07,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:53:07,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:53:07,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:53:07,983 INFO L87 Difference]: Start difference. First operand 75132 states and 107457 transitions. Second operand 14 states. [2019-09-10 06:53:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:10,673 INFO L93 Difference]: Finished difference Result 82470 states and 117860 transitions. [2019-09-10 06:53:10,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:53:10,673 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2019-09-10 06:53:10,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:10,766 INFO L225 Difference]: With dead ends: 82470 [2019-09-10 06:53:10,766 INFO L226 Difference]: Without dead ends: 82470 [2019-09-10 06:53:10,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2019-09-10 06:53:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82470 states. [2019-09-10 06:53:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82470 to 75130. [2019-09-10 06:53:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75130 states. [2019-09-10 06:53:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75130 states to 75130 states and 107453 transitions. [2019-09-10 06:53:11,641 INFO L78 Accepts]: Start accepts. Automaton has 75130 states and 107453 transitions. Word has length 81 [2019-09-10 06:53:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:11,641 INFO L475 AbstractCegarLoop]: Abstraction has 75130 states and 107453 transitions. [2019-09-10 06:53:11,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:53:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 75130 states and 107453 transitions. [2019-09-10 06:53:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:53:11,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:11,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:11,646 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:11,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:11,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1374131754, now seen corresponding path program 1 times [2019-09-10 06:53:11,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:11,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:11,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:11,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:12,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:12,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:53:12,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:12,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:53:12,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:53:12,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:53:12,545 INFO L87 Difference]: Start difference. First operand 75130 states and 107453 transitions. Second operand 17 states. [2019-09-10 06:53:13,058 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 06:53:16,262 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 06:53:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:18,672 INFO L93 Difference]: Finished difference Result 167555 states and 238586 transitions. [2019-09-10 06:53:18,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:53:18,673 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-09-10 06:53:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:18,895 INFO L225 Difference]: With dead ends: 167555 [2019-09-10 06:53:18,895 INFO L226 Difference]: Without dead ends: 167555 [2019-09-10 06:53:18,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:53:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167555 states. [2019-09-10 06:53:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167555 to 75046. [2019-09-10 06:53:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75046 states. [2019-09-10 06:53:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75046 states to 75046 states and 107344 transitions. [2019-09-10 06:53:20,326 INFO L78 Accepts]: Start accepts. Automaton has 75046 states and 107344 transitions. Word has length 81 [2019-09-10 06:53:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:20,326 INFO L475 AbstractCegarLoop]: Abstraction has 75046 states and 107344 transitions. [2019-09-10 06:53:20,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:53:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 75046 states and 107344 transitions. [2019-09-10 06:53:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:53:20,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:20,330 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:20,330 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:20,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:20,331 INFO L82 PathProgramCache]: Analyzing trace with hash -854077492, now seen corresponding path program 1 times [2019-09-10 06:53:20,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:20,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:20,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:20,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:20,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:21,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:21,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:53:21,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:21,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:53:21,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:53:21,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:53:21,326 INFO L87 Difference]: Start difference. First operand 75046 states and 107344 transitions. Second operand 18 states. [2019-09-10 06:53:22,133 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 06:53:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:28,514 INFO L93 Difference]: Finished difference Result 96815 states and 137971 transitions. [2019-09-10 06:53:28,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:53:28,515 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2019-09-10 06:53:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:28,624 INFO L225 Difference]: With dead ends: 96815 [2019-09-10 06:53:28,625 INFO L226 Difference]: Without dead ends: 96815 [2019-09-10 06:53:28,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:53:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96815 states. [2019-09-10 06:53:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96815 to 75042. [2019-09-10 06:53:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75042 states. [2019-09-10 06:53:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75042 states to 75042 states and 107336 transitions. [2019-09-10 06:53:29,498 INFO L78 Accepts]: Start accepts. Automaton has 75042 states and 107336 transitions. Word has length 81 [2019-09-10 06:53:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:29,498 INFO L475 AbstractCegarLoop]: Abstraction has 75042 states and 107336 transitions. [2019-09-10 06:53:29,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:53:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 75042 states and 107336 transitions. [2019-09-10 06:53:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:53:29,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:29,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:29,501 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:29,502 INFO L82 PathProgramCache]: Analyzing trace with hash 48032834, now seen corresponding path program 1 times [2019-09-10 06:53:29,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:29,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:29,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:29,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:29,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:30,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:30,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:53:30,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:30,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:53:30,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:53:30,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:53:30,344 INFO L87 Difference]: Start difference. First operand 75042 states and 107336 transitions. Second operand 16 states. [2019-09-10 06:53:32,445 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 06:53:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:34,927 INFO L93 Difference]: Finished difference Result 156697 states and 224781 transitions. [2019-09-10 06:53:34,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:53:34,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2019-09-10 06:53:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:35,115 INFO L225 Difference]: With dead ends: 156697 [2019-09-10 06:53:35,115 INFO L226 Difference]: Without dead ends: 156697 [2019-09-10 06:53:35,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:53:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156697 states. [2019-09-10 06:53:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156697 to 75038. [2019-09-10 06:53:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75038 states. [2019-09-10 06:53:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75038 states to 75038 states and 107328 transitions. [2019-09-10 06:53:36,772 INFO L78 Accepts]: Start accepts. Automaton has 75038 states and 107328 transitions. Word has length 82 [2019-09-10 06:53:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:36,772 INFO L475 AbstractCegarLoop]: Abstraction has 75038 states and 107328 transitions. [2019-09-10 06:53:36,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:53:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 75038 states and 107328 transitions. [2019-09-10 06:53:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:53:36,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:36,776 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:36,776 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:36,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:36,776 INFO L82 PathProgramCache]: Analyzing trace with hash 88098169, now seen corresponding path program 1 times [2019-09-10 06:53:36,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:36,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:36,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:36,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:36,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:37,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 06:53:37,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:37,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:53:37,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:37,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:53:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:53:37,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:53:37,394 INFO L87 Difference]: Start difference. First operand 75038 states and 107328 transitions. Second operand 10 states. [2019-09-10 06:53:38,077 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-09-10 06:53:38,434 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-09-10 06:53:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:39,968 INFO L93 Difference]: Finished difference Result 195163 states and 279565 transitions. [2019-09-10 06:53:39,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:53:39,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2019-09-10 06:53:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:40,202 INFO L225 Difference]: With dead ends: 195163 [2019-09-10 06:53:40,203 INFO L226 Difference]: Without dead ends: 195163 [2019-09-10 06:53:40,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:53:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195163 states. [2019-09-10 06:53:42,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195163 to 74883. [2019-09-10 06:53:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74883 states. [2019-09-10 06:53:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74883 states to 74883 states and 107146 transitions. [2019-09-10 06:53:42,293 INFO L78 Accepts]: Start accepts. Automaton has 74883 states and 107146 transitions. Word has length 82 [2019-09-10 06:53:42,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:42,293 INFO L475 AbstractCegarLoop]: Abstraction has 74883 states and 107146 transitions. [2019-09-10 06:53:42,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:53:42,293 INFO L276 IsEmpty]: Start isEmpty. Operand 74883 states and 107146 transitions. [2019-09-10 06:53:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:53:42,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:42,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] [2019-09-10 06:53:42,297 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:42,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:42,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1069130758, now seen corresponding path program 1 times [2019-09-10 06:53:42,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:42,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:42,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:42,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:42,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:42,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:42,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:53:42,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:42,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:53:42,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:53:42,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:53:42,854 INFO L87 Difference]: Start difference. First operand 74883 states and 107146 transitions. Second operand 12 states. [2019-09-10 06:53:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:44,931 INFO L93 Difference]: Finished difference Result 203649 states and 292109 transitions. [2019-09-10 06:53:44,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:53:44,931 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2019-09-10 06:53:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:45,166 INFO L225 Difference]: With dead ends: 203649 [2019-09-10 06:53:45,167 INFO L226 Difference]: Without dead ends: 203649 [2019-09-10 06:53:45,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:53:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203649 states. [2019-09-10 06:53:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203649 to 74809. [2019-09-10 06:53:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74809 states. [2019-09-10 06:53:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74809 states to 74809 states and 107057 transitions. [2019-09-10 06:53:46,643 INFO L78 Accepts]: Start accepts. Automaton has 74809 states and 107057 transitions. Word has length 82 [2019-09-10 06:53:46,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:46,644 INFO L475 AbstractCegarLoop]: Abstraction has 74809 states and 107057 transitions. [2019-09-10 06:53:46,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:53:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 74809 states and 107057 transitions. [2019-09-10 06:53:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 06:53:46,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:46,647 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:46,647 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:46,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:46,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1514347485, now seen corresponding path program 1 times [2019-09-10 06:53:46,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:46,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:46,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:46,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:46,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:47,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:47,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:53:47,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:47,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:53:47,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:53:47,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:53:47,108 INFO L87 Difference]: Start difference. First operand 74809 states and 107057 transitions. Second operand 12 states. [2019-09-10 06:53:47,816 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-10 06:53:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:49,530 INFO L93 Difference]: Finished difference Result 131861 states and 188641 transitions. [2019-09-10 06:53:49,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:53:49,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2019-09-10 06:53:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:49,675 INFO L225 Difference]: With dead ends: 131861 [2019-09-10 06:53:49,675 INFO L226 Difference]: Without dead ends: 131861 [2019-09-10 06:53:49,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:53:49,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131861 states. [2019-09-10 06:53:50,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131861 to 74803. [2019-09-10 06:53:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74803 states. [2019-09-10 06:53:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74803 states to 74803 states and 107048 transitions. [2019-09-10 06:53:50,758 INFO L78 Accepts]: Start accepts. Automaton has 74803 states and 107048 transitions. Word has length 82 [2019-09-10 06:53:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:50,759 INFO L475 AbstractCegarLoop]: Abstraction has 74803 states and 107048 transitions. [2019-09-10 06:53:50,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:53:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 74803 states and 107048 transitions. [2019-09-10 06:53:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 06:53:50,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:50,767 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:50,767 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:50,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:50,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1313506110, now seen corresponding path program 1 times [2019-09-10 06:53:50,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:50,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:50,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:50,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:50,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:53:50,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:50,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:53:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:53:50,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:53:50,946 INFO L87 Difference]: Start difference. First operand 74803 states and 107048 transitions. Second operand 7 states. [2019-09-10 06:53:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:52,012 INFO L93 Difference]: Finished difference Result 335469 states and 469869 transitions. [2019-09-10 06:53:52,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:53:52,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 06:53:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:52,455 INFO L225 Difference]: With dead ends: 335469 [2019-09-10 06:53:52,456 INFO L226 Difference]: Without dead ends: 335469 [2019-09-10 06:53:52,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:53:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335469 states. [2019-09-10 06:54:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335469 to 259869. [2019-09-10 06:54:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259869 states. [2019-09-10 06:54:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259869 states to 259869 states and 364671 transitions. [2019-09-10 06:54:01,030 INFO L78 Accepts]: Start accepts. Automaton has 259869 states and 364671 transitions. Word has length 88 [2019-09-10 06:54:01,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:01,031 INFO L475 AbstractCegarLoop]: Abstraction has 259869 states and 364671 transitions. [2019-09-10 06:54:01,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:54:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 259869 states and 364671 transitions. [2019-09-10 06:54:01,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 06:54:01,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:01,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:01,041 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:01,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:01,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1708838686, now seen corresponding path program 1 times [2019-09-10 06:54:01,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:01,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:01,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:01,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:01,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:01,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:01,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:54:01,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:01,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:54:01,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:54:01,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:01,233 INFO L87 Difference]: Start difference. First operand 259869 states and 364671 transitions. Second operand 6 states. [2019-09-10 06:54:02,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:02,264 INFO L93 Difference]: Finished difference Result 247871 states and 344202 transitions. [2019-09-10 06:54:02,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:54:02,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-10 06:54:02,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:02,616 INFO L225 Difference]: With dead ends: 247871 [2019-09-10 06:54:02,617 INFO L226 Difference]: Without dead ends: 247871 [2019-09-10 06:54:02,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:02,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247871 states. [2019-09-10 06:54:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247871 to 247045. [2019-09-10 06:54:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247045 states. [2019-09-10 06:54:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247045 states to 247045 states and 343379 transitions. [2019-09-10 06:54:06,031 INFO L78 Accepts]: Start accepts. Automaton has 247045 states and 343379 transitions. Word has length 89 [2019-09-10 06:54:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:06,031 INFO L475 AbstractCegarLoop]: Abstraction has 247045 states and 343379 transitions. [2019-09-10 06:54:06,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:54:06,031 INFO L276 IsEmpty]: Start isEmpty. Operand 247045 states and 343379 transitions. [2019-09-10 06:54:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 06:54:06,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:06,044 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:06,044 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:06,045 INFO L82 PathProgramCache]: Analyzing trace with hash 853604417, now seen corresponding path program 1 times [2019-09-10 06:54:06,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:06,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:06,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:06,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:06,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:06,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:06,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:54:06,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:06,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:54:06,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:54:06,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:06,211 INFO L87 Difference]: Start difference. First operand 247045 states and 343379 transitions. Second operand 6 states. [2019-09-10 06:54:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:08,369 INFO L93 Difference]: Finished difference Result 429789 states and 588860 transitions. [2019-09-10 06:54:08,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:54:08,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-10 06:54:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:08,936 INFO L225 Difference]: With dead ends: 429789 [2019-09-10 06:54:08,936 INFO L226 Difference]: Without dead ends: 429789 [2019-09-10 06:54:08,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:54:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429789 states. [2019-09-10 06:54:18,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429789 to 253477. [2019-09-10 06:54:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253477 states. [2019-09-10 06:54:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253477 states to 253477 states and 348397 transitions. [2019-09-10 06:54:18,646 INFO L78 Accepts]: Start accepts. Automaton has 253477 states and 348397 transitions. Word has length 91 [2019-09-10 06:54:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:18,646 INFO L475 AbstractCegarLoop]: Abstraction has 253477 states and 348397 transitions. [2019-09-10 06:54:18,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:54:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 253477 states and 348397 transitions. [2019-09-10 06:54:18,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 06:54:18,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:18,660 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:18,661 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:18,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:18,661 INFO L82 PathProgramCache]: Analyzing trace with hash 605690199, now seen corresponding path program 1 times [2019-09-10 06:54:18,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:18,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:18,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:18,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:18,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:18,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:18,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:18,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:18,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:18,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:18,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:18,803 INFO L87 Difference]: Start difference. First operand 253477 states and 348397 transitions. Second operand 3 states. [2019-09-10 06:54:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:20,936 INFO L93 Difference]: Finished difference Result 458217 states and 625673 transitions. [2019-09-10 06:54:20,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:20,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 06:54:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:21,559 INFO L225 Difference]: With dead ends: 458217 [2019-09-10 06:54:21,559 INFO L226 Difference]: Without dead ends: 458217 [2019-09-10 06:54:21,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458217 states. [2019-09-10 06:54:36,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458217 to 458215. [2019-09-10 06:54:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458215 states. [2019-09-10 06:54:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458215 states to 458215 states and 625672 transitions. [2019-09-10 06:54:38,661 INFO L78 Accepts]: Start accepts. Automaton has 458215 states and 625672 transitions. Word has length 92 [2019-09-10 06:54:38,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:38,661 INFO L475 AbstractCegarLoop]: Abstraction has 458215 states and 625672 transitions. [2019-09-10 06:54:38,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:38,662 INFO L276 IsEmpty]: Start isEmpty. Operand 458215 states and 625672 transitions. [2019-09-10 06:54:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:54:38,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:38,675 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:38,676 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:38,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:38,676 INFO L82 PathProgramCache]: Analyzing trace with hash -917889665, now seen corresponding path program 1 times [2019-09-10 06:54:38,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:38,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:38,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:38,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:38,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:38,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 06:54:38,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:38,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:54:38,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:38,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:54:38,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:54:38,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:54:38,817 INFO L87 Difference]: Start difference. First operand 458215 states and 625672 transitions. Second operand 5 states. [2019-09-10 06:54:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:44,352 INFO L93 Difference]: Finished difference Result 1302125 states and 1751163 transitions. [2019-09-10 06:54:44,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:54:44,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 06:54:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:56,842 INFO L225 Difference]: With dead ends: 1302125 [2019-09-10 06:54:56,842 INFO L226 Difference]: Without dead ends: 1302125 [2019-09-10 06:54:56,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:54:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302125 states. [2019-09-10 06:55:19,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302125 to 801483. [2019-09-10 06:55:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801483 states. [2019-09-10 06:55:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801483 states to 801483 states and 1082898 transitions. [2019-09-10 06:55:30,561 INFO L78 Accepts]: Start accepts. Automaton has 801483 states and 1082898 transitions. Word has length 93 [2019-09-10 06:55:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:30,561 INFO L475 AbstractCegarLoop]: Abstraction has 801483 states and 1082898 transitions. [2019-09-10 06:55:30,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:55:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 801483 states and 1082898 transitions. [2019-09-10 06:55:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:55:30,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:30,578 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:55:30,578 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:30,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:30,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1334123158, now seen corresponding path program 1 times [2019-09-10 06:55:30,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:30,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:30,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:30,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:30,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:30,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:30,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:55:30,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:30,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:55:30,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:55:30,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:55:30,685 INFO L87 Difference]: Start difference. First operand 801483 states and 1082898 transitions. Second operand 5 states. [2019-09-10 06:55:46,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:46,910 INFO L93 Difference]: Finished difference Result 1735451 states and 2319965 transitions. [2019-09-10 06:55:46,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:55:46,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-10 06:55:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:50,294 INFO L225 Difference]: With dead ends: 1735451 [2019-09-10 06:55:50,294 INFO L226 Difference]: Without dead ends: 1735451 [2019-09-10 06:55:50,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:55:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735451 states. [2019-09-10 06:56:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735451 to 796968. [2019-09-10 06:56:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796968 states. [2019-09-10 06:56:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796968 states to 796968 states and 1066636 transitions. [2019-09-10 06:56:29,688 INFO L78 Accepts]: Start accepts. Automaton has 796968 states and 1066636 transitions. Word has length 94 [2019-09-10 06:56:29,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:29,688 INFO L475 AbstractCegarLoop]: Abstraction has 796968 states and 1066636 transitions. [2019-09-10 06:56:29,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:56:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 796968 states and 1066636 transitions. [2019-09-10 06:56:29,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:56:29,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:29,705 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:29,705 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:29,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:29,706 INFO L82 PathProgramCache]: Analyzing trace with hash 19522476, now seen corresponding path program 1 times [2019-09-10 06:56:29,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:29,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:29,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:29,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:29,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:29,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:29,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:29,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:29,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:29,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:29,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:29,807 INFO L87 Difference]: Start difference. First operand 796968 states and 1066636 transitions. Second operand 3 states. [2019-09-10 06:56:34,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:34,323 INFO L93 Difference]: Finished difference Result 796950 states and 1054403 transitions. [2019-09-10 06:56:34,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:34,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 06:56:34,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:37,556 INFO L225 Difference]: With dead ends: 796950 [2019-09-10 06:56:37,556 INFO L226 Difference]: Without dead ends: 796950 [2019-09-10 06:56:37,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796950 states. [2019-09-10 06:56:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796950 to 684826. [2019-09-10 06:56:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684826 states. [2019-09-10 06:56:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684826 states to 684826 states and 908188 transitions. [2019-09-10 06:56:59,918 INFO L78 Accepts]: Start accepts. Automaton has 684826 states and 908188 transitions. Word has length 95 [2019-09-10 06:56:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:59,918 INFO L475 AbstractCegarLoop]: Abstraction has 684826 states and 908188 transitions. [2019-09-10 06:56:59,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 684826 states and 908188 transitions. [2019-09-10 06:56:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:56:59,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:59,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:59,933 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:59,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:59,933 INFO L82 PathProgramCache]: Analyzing trace with hash 383548345, now seen corresponding path program 1 times [2019-09-10 06:56:59,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:59,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:59,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:59,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:59,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:00,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 06:57:00,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:00,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:57:00,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:00,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:57:00,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:57:00,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:57:00,039 INFO L87 Difference]: Start difference. First operand 684826 states and 908188 transitions. Second operand 5 states. [2019-09-10 06:57:13,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:13,357 INFO L93 Difference]: Finished difference Result 1529449 states and 2022285 transitions. [2019-09-10 06:57:13,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:57:13,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 06:57:13,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:15,475 INFO L225 Difference]: With dead ends: 1529449 [2019-09-10 06:57:15,475 INFO L226 Difference]: Without dead ends: 1529449 [2019-09-10 06:57:15,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:57:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529449 states. [2019-09-10 06:57:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529449 to 684798. [2019-09-10 06:57:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684798 states. [2019-09-10 06:57:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684798 states to 684798 states and 908148 transitions. [2019-09-10 06:57:41,290 INFO L78 Accepts]: Start accepts. Automaton has 684798 states and 908148 transitions. Word has length 95 [2019-09-10 06:57:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:41,290 INFO L475 AbstractCegarLoop]: Abstraction has 684798 states and 908148 transitions. [2019-09-10 06:57:41,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:57:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 684798 states and 908148 transitions. [2019-09-10 06:57:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:57:41,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:41,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] [2019-09-10 06:57:41,309 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:41,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:41,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1040044953, now seen corresponding path program 1 times [2019-09-10 06:57:41,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:41,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:41,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:41,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:41,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:41,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:41,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:57:41,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:41,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:57:41,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:57:41,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:57:41,426 INFO L87 Difference]: Start difference. First operand 684798 states and 908148 transitions. Second operand 5 states. [2019-09-10 06:57:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:53,711 INFO L93 Difference]: Finished difference Result 1513003 states and 2000675 transitions. [2019-09-10 06:57:53,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:57:53,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 06:57:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:57,820 INFO L225 Difference]: With dead ends: 1513003 [2019-09-10 06:57:57,821 INFO L226 Difference]: Without dead ends: 1513003 [2019-09-10 06:57:57,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:57:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513003 states. [2019-09-10 06:58:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513003 to 684770. [2019-09-10 06:58:23,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684770 states. [2019-09-10 06:58:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684770 states to 684770 states and 908108 transitions. [2019-09-10 06:58:24,580 INFO L78 Accepts]: Start accepts. Automaton has 684770 states and 908108 transitions. Word has length 95 [2019-09-10 06:58:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:24,580 INFO L475 AbstractCegarLoop]: Abstraction has 684770 states and 908108 transitions. [2019-09-10 06:58:24,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:58:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 684770 states and 908108 transitions. [2019-09-10 06:58:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:58:24,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:24,597 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:24,598 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:24,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1886906773, now seen corresponding path program 1 times [2019-09-10 06:58:24,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:24,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:24,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:24,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:24,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:26,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:26,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:58:26,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:26,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:58:26,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:58:26,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:58:26,509 INFO L87 Difference]: Start difference. First operand 684770 states and 908108 transitions. Second operand 5 states. [2019-09-10 06:58:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:47,494 INFO L93 Difference]: Finished difference Result 1762878 states and 2314658 transitions. [2019-09-10 06:58:47,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:58:47,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 06:58:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:50,759 INFO L225 Difference]: With dead ends: 1762878 [2019-09-10 06:58:50,759 INFO L226 Difference]: Without dead ends: 1762878 [2019-09-10 06:58:50,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:58:52,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762878 states. [2019-09-10 06:59:23,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762878 to 1097521. [2019-09-10 06:59:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097521 states. [2019-09-10 06:59:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097521 states to 1097521 states and 1447082 transitions. [2019-09-10 06:59:27,864 INFO L78 Accepts]: Start accepts. Automaton has 1097521 states and 1447082 transitions. Word has length 97 [2019-09-10 06:59:27,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:27,865 INFO L475 AbstractCegarLoop]: Abstraction has 1097521 states and 1447082 transitions. [2019-09-10 06:59:27,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:59:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1097521 states and 1447082 transitions. [2019-09-10 06:59:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:59:27,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:27,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:27,883 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:27,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1399928965, now seen corresponding path program 1 times [2019-09-10 06:59:27,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:27,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:27,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:27,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:27,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:28,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:28,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:59:28,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:28,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:59:28,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:59:28,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:59:28,023 INFO L87 Difference]: Start difference. First operand 1097521 states and 1447082 transitions. Second operand 5 states. [2019-09-10 06:59:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:46,370 INFO L93 Difference]: Finished difference Result 2717281 states and 3530559 transitions. [2019-09-10 06:59:46,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:59:46,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 06:59:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:04,808 INFO L225 Difference]: With dead ends: 2717281 [2019-09-10 07:00:04,808 INFO L226 Difference]: Without dead ends: 2717281 [2019-09-10 07:00:04,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:00:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717281 states.