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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:32:02,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:32:02,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:32:02,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:32:02,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:32:02,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:32:02,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:32:02,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:32:02,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:32:02,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:32:02,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:32:02,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:32:02,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:32:02,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:32:02,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:32:02,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:32:02,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:32:02,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:32:02,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:32:02,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:32:02,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:32:02,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:32:02,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:32:02,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:32:02,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:32:02,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:32:02,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:32:02,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:32:02,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:32:02,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:32:02,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:32:02,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:32:02,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:32:02,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:32:02,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:32:02,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:32:02,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:32:02,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:32:02,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:32:02,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:32:02,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:32:02,712 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:32:02,727 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:32:02,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:32:02,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:32:02,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:32:02,729 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:32:02,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:32:02,729 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:32:02,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:32:02,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:32:02,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:32:02,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:32:02,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:32:02,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:32:02,731 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:32:02,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:32:02,731 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:32:02,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:32:02,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:32:02,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:32:02,732 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:32:02,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:32:02,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:32:02,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:32:02,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:32:02,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:32:02,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:32:02,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:32:02,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:32:02,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:32:02,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:32:02,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:32:02,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:32:02,781 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:32:02,781 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:32:02,782 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:32:02,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc36d8ea/211bd38068ae49d08eadb689822e4f4f/FLAG5948fc90f [2019-09-08 12:32:03,665 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:32:03,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:32:03,718 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc36d8ea/211bd38068ae49d08eadb689822e4f4f/FLAG5948fc90f [2019-09-08 12:32:04,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc36d8ea/211bd38068ae49d08eadb689822e4f4f [2019-09-08 12:32:04,209 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:32:04,211 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:32:04,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:32:04,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:32:04,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:32:04,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:32:04" (1/1) ... [2019-09-08 12:32:04,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5943fbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:04, skipping insertion in model container [2019-09-08 12:32:04,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:32:04" (1/1) ... [2019-09-08 12:32:04,224 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:32:04,461 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:32:06,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:32:06,325 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:32:07,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:32:07,250 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:32:07,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:07 WrapperNode [2019-09-08 12:32:07,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:32:07,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:32:07,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:32:07,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:32:07,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:07" (1/1) ... [2019-09-08 12:32:07,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:07" (1/1) ... [2019-09-08 12:32:07,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:07" (1/1) ... [2019-09-08 12:32:07,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:07" (1/1) ... [2019-09-08 12:32:07,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:07" (1/1) ... [2019-09-08 12:32:07,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:07" (1/1) ... [2019-09-08 12:32:07,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:07" (1/1) ... [2019-09-08 12:32:07,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:32:07,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:32:07,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:32:07,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:32:07,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32: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-08 12:32:07,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:32:07,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:32:07,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:32:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:32:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:32:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:32:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:32:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:32:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:32:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:32:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:32:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:32:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:32:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:32:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:32:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:32:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:32:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:32:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:32:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:32:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:32:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:32:13,331 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:32:13,331 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:32:13,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:32:13 BoogieIcfgContainer [2019-09-08 12:32:13,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:32:13,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:32:13,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:32:13,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:32:13,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:32:04" (1/3) ... [2019-09-08 12:32:13,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613f48b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:32:13, skipping insertion in model container [2019-09-08 12:32:13,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:32:07" (2/3) ... [2019-09-08 12:32:13,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613f48b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:32:13, skipping insertion in model container [2019-09-08 12:32:13,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:32:13" (3/3) ... [2019-09-08 12:32:13,342 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:32:13,354 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:32:13,365 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-08 12:32:13,382 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-08 12:32:13,425 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:32:13,426 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:32:13,426 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:32:13,426 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:32:13,427 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:32:13,427 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:32:13,427 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:32:13,427 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:32:13,427 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:32:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states. [2019-09-08 12:32:13,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:32:13,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:13,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:13,519 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:13,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1894963753, now seen corresponding path program 1 times [2019-09-08 12:32:13,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:13,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:13,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:13,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:13,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:14,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:14,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:14,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:14,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:14,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:14,240 INFO L87 Difference]: Start difference. First operand 2353 states. Second operand 5 states. [2019-09-08 12:32:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:16,491 INFO L93 Difference]: Finished difference Result 2940 states and 5210 transitions. [2019-09-08 12:32:16,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:16,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-08 12:32:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:16,531 INFO L225 Difference]: With dead ends: 2940 [2019-09-08 12:32:16,531 INFO L226 Difference]: Without dead ends: 1747 [2019-09-08 12:32:16,546 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-08 12:32:16,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2019-09-08 12:32:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1747. [2019-09-08 12:32:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2019-09-08 12:32:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2288 transitions. [2019-09-08 12:32:16,705 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2288 transitions. Word has length 90 [2019-09-08 12:32:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:16,706 INFO L475 AbstractCegarLoop]: Abstraction has 1747 states and 2288 transitions. [2019-09-08 12:32:16,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2288 transitions. [2019-09-08 12:32:16,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:32:16,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:16,714 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:16,715 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:16,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:16,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1518436791, now seen corresponding path program 1 times [2019-09-08 12:32:16,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:16,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:16,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:16,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:16,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:16,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:16,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:16,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:16,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:16,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:16,962 INFO L87 Difference]: Start difference. First operand 1747 states and 2288 transitions. Second operand 5 states. [2019-09-08 12:32:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:18,829 INFO L93 Difference]: Finished difference Result 2066 states and 2687 transitions. [2019-09-08 12:32:18,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:18,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-08 12:32:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:18,840 INFO L225 Difference]: With dead ends: 2066 [2019-09-08 12:32:18,840 INFO L226 Difference]: Without dead ends: 1199 [2019-09-08 12:32:18,844 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-08 12:32:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-08 12:32:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2019-09-08 12:32:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-09-08 12:32:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1579 transitions. [2019-09-08 12:32:18,893 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1579 transitions. Word has length 90 [2019-09-08 12:32:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:18,895 INFO L475 AbstractCegarLoop]: Abstraction has 1199 states and 1579 transitions. [2019-09-08 12:32:18,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1579 transitions. [2019-09-08 12:32:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:32:18,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:18,904 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:18,905 INFO L82 PathProgramCache]: Analyzing trace with hash 487198845, now seen corresponding path program 1 times [2019-09-08 12:32:18,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:18,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:18,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:18,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:19,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:19,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:19,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:19,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:19,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:19,103 INFO L87 Difference]: Start difference. First operand 1199 states and 1579 transitions. Second operand 5 states. [2019-09-08 12:32:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:20,056 INFO L93 Difference]: Finished difference Result 1701 states and 2260 transitions. [2019-09-08 12:32:20,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:20,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-08 12:32:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:20,062 INFO L225 Difference]: With dead ends: 1701 [2019-09-08 12:32:20,062 INFO L226 Difference]: Without dead ends: 1073 [2019-09-08 12:32:20,065 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-08 12:32:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2019-09-08 12:32:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2019-09-08 12:32:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2019-09-08 12:32:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1432 transitions. [2019-09-08 12:32:20,111 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1432 transitions. Word has length 90 [2019-09-08 12:32:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:20,111 INFO L475 AbstractCegarLoop]: Abstraction has 1073 states and 1432 transitions. [2019-09-08 12:32:20,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1432 transitions. [2019-09-08 12:32:20,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:32:20,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:20,117 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:20,118 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:20,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:20,118 INFO L82 PathProgramCache]: Analyzing trace with hash -611229365, now seen corresponding path program 1 times [2019-09-08 12:32:20,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:20,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:20,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:20,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:20,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:20,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:20,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:20,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:20,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:20,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:20,384 INFO L87 Difference]: Start difference. First operand 1073 states and 1432 transitions. Second operand 5 states. [2019-09-08 12:32:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:21,394 INFO L93 Difference]: Finished difference Result 1262 states and 1651 transitions. [2019-09-08 12:32:21,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:21,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 12:32:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:21,400 INFO L225 Difference]: With dead ends: 1262 [2019-09-08 12:32:21,400 INFO L226 Difference]: Without dead ends: 731 [2019-09-08 12:32:21,402 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-08 12:32:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-09-08 12:32:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-09-08 12:32:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-09-08 12:32:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 971 transitions. [2019-09-08 12:32:21,448 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 971 transitions. Word has length 91 [2019-09-08 12:32:21,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:21,449 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 971 transitions. [2019-09-08 12:32:21,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 971 transitions. [2019-09-08 12:32:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:32:21,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:21,453 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:21,454 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:21,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1651376349, now seen corresponding path program 1 times [2019-09-08 12:32:21,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:21,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:21,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:21,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:21,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:21,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:21,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:21,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:21,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:21,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:21,705 INFO L87 Difference]: Start difference. First operand 731 states and 971 transitions. Second operand 5 states. [2019-09-08 12:32:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:22,433 INFO L93 Difference]: Finished difference Result 1042 states and 1383 transitions. [2019-09-08 12:32:22,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:22,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-08 12:32:22,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:22,440 INFO L225 Difference]: With dead ends: 1042 [2019-09-08 12:32:22,441 INFO L226 Difference]: Without dead ends: 650 [2019-09-08 12:32:22,442 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-08 12:32:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-08 12:32:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-09-08 12:32:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-09-08 12:32:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 866 transitions. [2019-09-08 12:32:22,478 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 866 transitions. Word has length 92 [2019-09-08 12:32:22,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:22,480 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 866 transitions. [2019-09-08 12:32:22,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 866 transitions. [2019-09-08 12:32:22,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:32:22,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:22,483 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:22,485 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:22,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:22,485 INFO L82 PathProgramCache]: Analyzing trace with hash 620980430, now seen corresponding path program 1 times [2019-09-08 12:32:22,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:22,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:22,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:22,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:22,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:22,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:22,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:32:22,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:32:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:32:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:32:22,642 INFO L87 Difference]: Start difference. First operand 650 states and 866 transitions. Second operand 5 states. [2019-09-08 12:32:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:23,450 INFO L93 Difference]: Finished difference Result 996 states and 1333 transitions. [2019-09-08 12:32:23,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:32:23,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 12:32:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:23,456 INFO L225 Difference]: With dead ends: 996 [2019-09-08 12:32:23,456 INFO L226 Difference]: Without dead ends: 642 [2019-09-08 12:32:23,458 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-08 12:32:23,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-08 12:32:23,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-09-08 12:32:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 856 transitions. [2019-09-08 12:32:23,509 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 856 transitions. Word has length 93 [2019-09-08 12:32:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:23,511 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 856 transitions. [2019-09-08 12:32:23,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:32:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 856 transitions. [2019-09-08 12:32:23,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:32:23,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:23,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:23,517 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:23,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:23,523 INFO L82 PathProgramCache]: Analyzing trace with hash 574019279, now seen corresponding path program 1 times [2019-09-08 12:32:23,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:23,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:23,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:23,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:23,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:23,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:23,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:23,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:23,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:23,953 INFO L87 Difference]: Start difference. First operand 642 states and 856 transitions. Second operand 9 states. [2019-09-08 12:32:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:26,411 INFO L93 Difference]: Finished difference Result 1260 states and 1723 transitions. [2019-09-08 12:32:26,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:26,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-08 12:32:26,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:26,419 INFO L225 Difference]: With dead ends: 1260 [2019-09-08 12:32:26,419 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 12:32:26,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 12:32:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 642. [2019-09-08 12:32:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 855 transitions. [2019-09-08 12:32:26,465 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 855 transitions. Word has length 94 [2019-09-08 12:32:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:26,466 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 855 transitions. [2019-09-08 12:32:26,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 855 transitions. [2019-09-08 12:32:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:32:26,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:26,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:26,469 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:26,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:26,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2033100651, now seen corresponding path program 1 times [2019-09-08 12:32:26,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:26,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:26,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:26,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:26,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:26,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:26,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:26,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:26,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:26,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:26,716 INFO L87 Difference]: Start difference. First operand 642 states and 855 transitions. Second operand 9 states. [2019-09-08 12:32:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:29,306 INFO L93 Difference]: Finished difference Result 1333 states and 1818 transitions. [2019-09-08 12:32:29,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:29,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-08 12:32:29,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:29,315 INFO L225 Difference]: With dead ends: 1333 [2019-09-08 12:32:29,316 INFO L226 Difference]: Without dead ends: 1141 [2019-09-08 12:32:29,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:29,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-09-08 12:32:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 642. [2019-09-08 12:32:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 854 transitions. [2019-09-08 12:32:29,383 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 854 transitions. Word has length 94 [2019-09-08 12:32:29,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:29,383 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 854 transitions. [2019-09-08 12:32:29,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 854 transitions. [2019-09-08 12:32:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:32:29,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:29,386 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:29,387 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:29,387 INFO L82 PathProgramCache]: Analyzing trace with hash -518152584, now seen corresponding path program 1 times [2019-09-08 12:32:29,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:29,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:29,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:29,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:29,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:29,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:29,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:32:29,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:32:29,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:32:29,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:32:29,636 INFO L87 Difference]: Start difference. First operand 642 states and 854 transitions. Second operand 8 states. [2019-09-08 12:32:30,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:30,961 INFO L93 Difference]: Finished difference Result 1205 states and 1564 transitions. [2019-09-08 12:32:30,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:32:30,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-09-08 12:32:30,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:30,968 INFO L225 Difference]: With dead ends: 1205 [2019-09-08 12:32:30,968 INFO L226 Difference]: Without dead ends: 859 [2019-09-08 12:32:30,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:32:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-09-08 12:32:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 642. [2019-09-08 12:32:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 853 transitions. [2019-09-08 12:32:31,008 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 853 transitions. Word has length 94 [2019-09-08 12:32:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:31,008 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 853 transitions. [2019-09-08 12:32:31,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:32:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 853 transitions. [2019-09-08 12:32:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:32:31,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:31,011 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:31,011 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:31,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:31,012 INFO L82 PathProgramCache]: Analyzing trace with hash 103072893, now seen corresponding path program 1 times [2019-09-08 12:32:31,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:31,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:31,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:31,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:31,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:31,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:31,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:31,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:31,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:31,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:31,219 INFO L87 Difference]: Start difference. First operand 642 states and 853 transitions. Second operand 9 states. [2019-09-08 12:32:33,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:33,410 INFO L93 Difference]: Finished difference Result 1228 states and 1666 transitions. [2019-09-08 12:32:33,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:33,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:32:33,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:33,418 INFO L225 Difference]: With dead ends: 1228 [2019-09-08 12:32:33,418 INFO L226 Difference]: Without dead ends: 1129 [2019-09-08 12:32:33,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-08 12:32:33,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-08 12:32:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 852 transitions. [2019-09-08 12:32:33,463 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 852 transitions. Word has length 96 [2019-09-08 12:32:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:33,463 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 852 transitions. [2019-09-08 12:32:33,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 852 transitions. [2019-09-08 12:32:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:32:33,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:33,466 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:33,466 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:33,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:33,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1545982347, now seen corresponding path program 1 times [2019-09-08 12:32:33,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:33,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:33,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:33,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:33,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:33,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:33,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:33,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:33,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:33,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:33,806 INFO L87 Difference]: Start difference. First operand 642 states and 852 transitions. Second operand 9 states. [2019-09-08 12:32:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:35,771 INFO L93 Difference]: Finished difference Result 1274 states and 1730 transitions. [2019-09-08 12:32:35,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:35,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:32:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:35,778 INFO L225 Difference]: With dead ends: 1274 [2019-09-08 12:32:35,778 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 12:32:35,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 12:32:35,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 642. [2019-09-08 12:32:35,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 851 transitions. [2019-09-08 12:32:35,821 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 851 transitions. Word has length 96 [2019-09-08 12:32:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:35,822 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 851 transitions. [2019-09-08 12:32:35,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 851 transitions. [2019-09-08 12:32:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:32:35,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:35,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:35,825 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:35,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:35,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1428928273, now seen corresponding path program 1 times [2019-09-08 12:32:35,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:35,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:35,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:35,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:35,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:36,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:36,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:36,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:36,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:36,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:36,012 INFO L87 Difference]: Start difference. First operand 642 states and 851 transitions. Second operand 9 states. [2019-09-08 12:32:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:38,266 INFO L93 Difference]: Finished difference Result 1363 states and 1839 transitions. [2019-09-08 12:32:38,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:38,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:32:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:38,272 INFO L225 Difference]: With dead ends: 1363 [2019-09-08 12:32:38,272 INFO L226 Difference]: Without dead ends: 1141 [2019-09-08 12:32:38,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-09-08 12:32:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 642. [2019-09-08 12:32:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 850 transitions. [2019-09-08 12:32:38,317 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 850 transitions. Word has length 96 [2019-09-08 12:32:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:38,318 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 850 transitions. [2019-09-08 12:32:38,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 850 transitions. [2019-09-08 12:32:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:32:38,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:38,320 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:38,321 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:38,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2085599014, now seen corresponding path program 1 times [2019-09-08 12:32:38,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:38,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:38,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:38,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:38,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:38,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:38,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:38,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:38,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:38,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:38,505 INFO L87 Difference]: Start difference. First operand 642 states and 850 transitions. Second operand 9 states. [2019-09-08 12:32:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:40,821 INFO L93 Difference]: Finished difference Result 1228 states and 1664 transitions. [2019-09-08 12:32:40,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:40,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:32:40,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:40,827 INFO L225 Difference]: With dead ends: 1228 [2019-09-08 12:32:40,828 INFO L226 Difference]: Without dead ends: 1129 [2019-09-08 12:32:40,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-08 12:32:40,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-08 12:32:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 849 transitions. [2019-09-08 12:32:40,874 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 849 transitions. Word has length 96 [2019-09-08 12:32:40,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:40,874 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 849 transitions. [2019-09-08 12:32:40,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 849 transitions. [2019-09-08 12:32:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:32:40,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:40,877 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:40,878 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:40,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:40,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1937383278, now seen corresponding path program 1 times [2019-09-08 12:32:40,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:40,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:40,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:40,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:40,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:41,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:41,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:41,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:41,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:41,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:41,052 INFO L87 Difference]: Start difference. First operand 642 states and 849 transitions. Second operand 9 states. [2019-09-08 12:32:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:43,506 INFO L93 Difference]: Finished difference Result 1274 states and 1729 transitions. [2019-09-08 12:32:43,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:43,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:32:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:43,513 INFO L225 Difference]: With dead ends: 1274 [2019-09-08 12:32:43,513 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 12:32:43,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 12:32:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 642. [2019-09-08 12:32:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 848 transitions. [2019-09-08 12:32:43,560 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 848 transitions. Word has length 96 [2019-09-08 12:32:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:43,561 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 848 transitions. [2019-09-08 12:32:43,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 848 transitions. [2019-09-08 12:32:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:32:43,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:43,563 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:43,564 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:43,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash -320032428, now seen corresponding path program 1 times [2019-09-08 12:32:43,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:43,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:43,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:43,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:43,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:43,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:43,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:43,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:43,751 INFO L87 Difference]: Start difference. First operand 642 states and 848 transitions. Second operand 9 states. [2019-09-08 12:32:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:46,126 INFO L93 Difference]: Finished difference Result 1228 states and 1661 transitions. [2019-09-08 12:32:46,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:46,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:32:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:46,132 INFO L225 Difference]: With dead ends: 1228 [2019-09-08 12:32:46,132 INFO L226 Difference]: Without dead ends: 1129 [2019-09-08 12:32:46,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:46,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-08 12:32:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-08 12:32:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:46,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 847 transitions. [2019-09-08 12:32:46,181 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 847 transitions. Word has length 96 [2019-09-08 12:32:46,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:46,182 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 847 transitions. [2019-09-08 12:32:46,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 847 transitions. [2019-09-08 12:32:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:32:46,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:46,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:46,185 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:46,185 INFO L82 PathProgramCache]: Analyzing trace with hash -891007590, now seen corresponding path program 1 times [2019-09-08 12:32:46,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:46,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:46,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:46,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:46,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:46,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:46,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:46,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:46,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:46,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:46,365 INFO L87 Difference]: Start difference. First operand 642 states and 847 transitions. Second operand 9 states. [2019-09-08 12:32:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:48,681 INFO L93 Difference]: Finished difference Result 1223 states and 1655 transitions. [2019-09-08 12:32:48,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:48,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:32:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:48,687 INFO L225 Difference]: With dead ends: 1223 [2019-09-08 12:32:48,687 INFO L226 Difference]: Without dead ends: 1129 [2019-09-08 12:32:48,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-08 12:32:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-08 12:32:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 846 transitions. [2019-09-08 12:32:48,730 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 846 transitions. Word has length 96 [2019-09-08 12:32:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:48,730 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 846 transitions. [2019-09-08 12:32:48,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 846 transitions. [2019-09-08 12:32:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:32:48,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:48,733 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:48,733 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:48,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:48,734 INFO L82 PathProgramCache]: Analyzing trace with hash -354416756, now seen corresponding path program 1 times [2019-09-08 12:32:48,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:48,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:48,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:48,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:48,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:48,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:48,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:48,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:48,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:48,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:48,914 INFO L87 Difference]: Start difference. First operand 642 states and 846 transitions. Second operand 9 states. [2019-09-08 12:32:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:51,148 INFO L93 Difference]: Finished difference Result 1237 states and 1667 transitions. [2019-09-08 12:32:51,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:51,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:32:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:51,156 INFO L225 Difference]: With dead ends: 1237 [2019-09-08 12:32:51,156 INFO L226 Difference]: Without dead ends: 1129 [2019-09-08 12:32:51,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-08 12:32:51,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-08 12:32:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 845 transitions. [2019-09-08 12:32:51,232 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 845 transitions. Word has length 98 [2019-09-08 12:32:51,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:51,233 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 845 transitions. [2019-09-08 12:32:51,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 845 transitions. [2019-09-08 12:32:51,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:32:51,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:51,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:51,237 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:51,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:51,238 INFO L82 PathProgramCache]: Analyzing trace with hash 350263078, now seen corresponding path program 1 times [2019-09-08 12:32:51,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:51,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:51,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:51,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:51,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:51,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:51,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:51,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:51,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:51,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:51,491 INFO L87 Difference]: Start difference. First operand 642 states and 845 transitions. Second operand 9 states. [2019-09-08 12:32:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:53,743 INFO L93 Difference]: Finished difference Result 1199 states and 1612 transitions. [2019-09-08 12:32:53,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:53,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:32:53,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:53,750 INFO L225 Difference]: With dead ends: 1199 [2019-09-08 12:32:53,750 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:32:53,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:53,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:32:53,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:32:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 844 transitions. [2019-09-08 12:32:53,803 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 844 transitions. Word has length 98 [2019-09-08 12:32:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:53,804 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 844 transitions. [2019-09-08 12:32:53,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 844 transitions. [2019-09-08 12:32:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:32:53,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:53,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:53,806 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:53,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:53,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1857278271, now seen corresponding path program 1 times [2019-09-08 12:32:53,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:53,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:53,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:53,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:53,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:53,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:53,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:53,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:53,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:53,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:53,999 INFO L87 Difference]: Start difference. First operand 642 states and 844 transitions. Second operand 9 states. [2019-09-08 12:32:56,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:56,421 INFO L93 Difference]: Finished difference Result 1289 states and 1734 transitions. [2019-09-08 12:32:56,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:56,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:32:56,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:56,427 INFO L225 Difference]: With dead ends: 1289 [2019-09-08 12:32:56,427 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 12:32:56,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 12:32:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 642. [2019-09-08 12:32:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 843 transitions. [2019-09-08 12:32:56,484 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 843 transitions. Word has length 98 [2019-09-08 12:32:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:56,485 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 843 transitions. [2019-09-08 12:32:56,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 843 transitions. [2019-09-08 12:32:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:32:56,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:56,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:56,487 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:56,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:56,488 INFO L82 PathProgramCache]: Analyzing trace with hash 647290032, now seen corresponding path program 1 times [2019-09-08 12:32:56,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:56,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:56,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:56,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:56,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:56,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:56,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:56,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:56,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:56,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:56,660 INFO L87 Difference]: Start difference. First operand 642 states and 843 transitions. Second operand 9 states. [2019-09-08 12:32:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:58,891 INFO L93 Difference]: Finished difference Result 1199 states and 1609 transitions. [2019-09-08 12:32:58,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:58,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:32:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:58,896 INFO L225 Difference]: With dead ends: 1199 [2019-09-08 12:32:58,896 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:32:58,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:32:58,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:32:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:32:58,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 842 transitions. [2019-09-08 12:32:58,940 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 842 transitions. Word has length 98 [2019-09-08 12:32:58,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:58,941 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 842 transitions. [2019-09-08 12:32:58,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 842 transitions. [2019-09-08 12:32:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:32:58,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:58,943 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:58,943 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:58,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:58,943 INFO L82 PathProgramCache]: Analyzing trace with hash -427429475, now seen corresponding path program 1 times [2019-09-08 12:32:58,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:58,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:58,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:58,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:58,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:59,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:59,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:59,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:59,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:59,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:59,116 INFO L87 Difference]: Start difference. First operand 642 states and 842 transitions. Second operand 9 states. [2019-09-08 12:33:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:01,645 INFO L93 Difference]: Finished difference Result 1237 states and 1660 transitions. [2019-09-08 12:33:01,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:01,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:33:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:01,655 INFO L225 Difference]: With dead ends: 1237 [2019-09-08 12:33:01,655 INFO L226 Difference]: Without dead ends: 1129 [2019-09-08 12:33:01,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-08 12:33:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-08 12:33:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 841 transitions. [2019-09-08 12:33:01,714 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 841 transitions. Word has length 98 [2019-09-08 12:33:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:01,715 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 841 transitions. [2019-09-08 12:33:01,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 841 transitions. [2019-09-08 12:33:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:33:01,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:01,717 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:01,717 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:01,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1254444936, now seen corresponding path program 1 times [2019-09-08 12:33:01,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:01,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:01,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:01,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:01,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:01,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:01,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:01,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:01,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:01,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:01,886 INFO L87 Difference]: Start difference. First operand 642 states and 841 transitions. Second operand 9 states. [2019-09-08 12:33:04,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:04,215 INFO L93 Difference]: Finished difference Result 1199 states and 1607 transitions. [2019-09-08 12:33:04,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:04,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:33:04,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:04,221 INFO L225 Difference]: With dead ends: 1199 [2019-09-08 12:33:04,221 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:33:04,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:33:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:33:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 840 transitions. [2019-09-08 12:33:04,277 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 840 transitions. Word has length 98 [2019-09-08 12:33:04,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:04,277 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 840 transitions. [2019-09-08 12:33:04,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 840 transitions. [2019-09-08 12:33:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:33:04,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:04,279 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:04,280 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:04,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:04,280 INFO L82 PathProgramCache]: Analyzing trace with hash 398268857, now seen corresponding path program 1 times [2019-09-08 12:33:04,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:04,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:04,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:04,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:04,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:04,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:04,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:04,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:04,452 INFO L87 Difference]: Start difference. First operand 642 states and 840 transitions. Second operand 9 states. [2019-09-08 12:33:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:06,688 INFO L93 Difference]: Finished difference Result 1195 states and 1602 transitions. [2019-09-08 12:33:06,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:06,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:33:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:06,694 INFO L225 Difference]: With dead ends: 1195 [2019-09-08 12:33:06,694 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:33:06,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:06,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:33:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:33:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 839 transitions. [2019-09-08 12:33:06,739 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 839 transitions. Word has length 98 [2019-09-08 12:33:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:06,739 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 839 transitions. [2019-09-08 12:33:06,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 839 transitions. [2019-09-08 12:33:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:33:06,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:06,742 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:06,742 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:06,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:06,742 INFO L82 PathProgramCache]: Analyzing trace with hash -285032083, now seen corresponding path program 1 times [2019-09-08 12:33:06,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:06,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:06,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:06,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:06,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:06,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:06,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:06,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:06,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:06,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:06,920 INFO L87 Difference]: Start difference. First operand 642 states and 839 transitions. Second operand 9 states. [2019-09-08 12:33:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:09,207 INFO L93 Difference]: Finished difference Result 1199 states and 1605 transitions. [2019-09-08 12:33:09,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:09,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:33:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:09,213 INFO L225 Difference]: With dead ends: 1199 [2019-09-08 12:33:09,213 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:33:09,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:33:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:33:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 838 transitions. [2019-09-08 12:33:09,262 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 838 transitions. Word has length 98 [2019-09-08 12:33:09,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:09,263 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 838 transitions. [2019-09-08 12:33:09,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 838 transitions. [2019-09-08 12:33:09,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:33:09,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:09,264 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:09,265 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:09,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1992031926, now seen corresponding path program 1 times [2019-09-08 12:33:09,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:09,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:09,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:09,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:09,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:09,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:09,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:09,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:09,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:09,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:09,473 INFO L87 Difference]: Start difference. First operand 642 states and 838 transitions. Second operand 9 states. [2019-09-08 12:33:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:11,828 INFO L93 Difference]: Finished difference Result 1237 states and 1656 transitions. [2019-09-08 12:33:11,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:11,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:33:11,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:11,833 INFO L225 Difference]: With dead ends: 1237 [2019-09-08 12:33:11,834 INFO L226 Difference]: Without dead ends: 1129 [2019-09-08 12:33:11,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-08 12:33:11,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-08 12:33:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 837 transitions. [2019-09-08 12:33:11,879 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 837 transitions. Word has length 98 [2019-09-08 12:33:11,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:11,879 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 837 transitions. [2019-09-08 12:33:11,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 837 transitions. [2019-09-08 12:33:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:33:11,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:11,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:11,881 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:11,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:11,881 INFO L82 PathProgramCache]: Analyzing trace with hash 310929269, now seen corresponding path program 1 times [2019-09-08 12:33:11,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:11,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:11,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:11,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:11,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:12,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:12,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:12,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:12,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:12,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:12,049 INFO L87 Difference]: Start difference. First operand 642 states and 837 transitions. Second operand 9 states. [2019-09-08 12:33:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:14,403 INFO L93 Difference]: Finished difference Result 1199 states and 1603 transitions. [2019-09-08 12:33:14,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:14,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:33:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:14,408 INFO L225 Difference]: With dead ends: 1199 [2019-09-08 12:33:14,408 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:33:14,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:33:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:33:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 836 transitions. [2019-09-08 12:33:14,456 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 836 transitions. Word has length 98 [2019-09-08 12:33:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:14,456 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 836 transitions. [2019-09-08 12:33:14,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 836 transitions. [2019-09-08 12:33:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:33:14,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:14,457 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:14,457 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:14,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:14,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1777266353, now seen corresponding path program 1 times [2019-09-08 12:33:14,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:14,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:14,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:14,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:14,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:14,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:14,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:14,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:14,641 INFO L87 Difference]: Start difference. First operand 642 states and 836 transitions. Second operand 9 states. [2019-09-08 12:33:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:16,900 INFO L93 Difference]: Finished difference Result 1195 states and 1597 transitions. [2019-09-08 12:33:16,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:16,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:33:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:16,905 INFO L225 Difference]: With dead ends: 1195 [2019-09-08 12:33:16,905 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:33:16,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:33:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:33:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 835 transitions. [2019-09-08 12:33:16,957 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 835 transitions. Word has length 98 [2019-09-08 12:33:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:16,958 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 835 transitions. [2019-09-08 12:33:16,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 835 transitions. [2019-09-08 12:33:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:33:16,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:16,959 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:16,960 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:16,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:16,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2141043087, now seen corresponding path program 1 times [2019-09-08 12:33:16,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:16,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:16,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:16,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:16,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:17,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:17,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:17,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:17,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:17,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:17,131 INFO L87 Difference]: Start difference. First operand 642 states and 835 transitions. Second operand 9 states. [2019-09-08 12:33:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:19,494 INFO L93 Difference]: Finished difference Result 1199 states and 1599 transitions. [2019-09-08 12:33:19,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:19,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:33:19,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:19,497 INFO L225 Difference]: With dead ends: 1199 [2019-09-08 12:33:19,497 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:33:19,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:33:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:33:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 834 transitions. [2019-09-08 12:33:19,549 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 834 transitions. Word has length 98 [2019-09-08 12:33:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:19,549 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 834 transitions. [2019-09-08 12:33:19,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 834 transitions. [2019-09-08 12:33:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:33:19,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:19,550 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:19,550 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:19,551 INFO L82 PathProgramCache]: Analyzing trace with hash 600616519, now seen corresponding path program 1 times [2019-09-08 12:33:19,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:19,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:19,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:19,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:19,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:19,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:19,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:19,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:19,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:19,829 INFO L87 Difference]: Start difference. First operand 642 states and 834 transitions. Second operand 9 states. [2019-09-08 12:33:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:22,184 INFO L93 Difference]: Finished difference Result 1195 states and 1594 transitions. [2019-09-08 12:33:22,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:22,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:33:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:22,187 INFO L225 Difference]: With dead ends: 1195 [2019-09-08 12:33:22,187 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:33:22,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:22,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:33:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:33:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 833 transitions. [2019-09-08 12:33:22,238 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 833 transitions. Word has length 98 [2019-09-08 12:33:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:22,238 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 833 transitions. [2019-09-08 12:33:22,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 833 transitions. [2019-09-08 12:33:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:33:22,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:22,240 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:22,240 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:22,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:22,241 INFO L82 PathProgramCache]: Analyzing trace with hash 513414431, now seen corresponding path program 1 times [2019-09-08 12:33:22,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:22,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:22,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:22,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:22,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:22,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:22,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:22,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:22,429 INFO L87 Difference]: Start difference. First operand 642 states and 833 transitions. Second operand 9 states. [2019-09-08 12:33:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:24,765 INFO L93 Difference]: Finished difference Result 1195 states and 1593 transitions. [2019-09-08 12:33:24,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:24,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:33:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:24,768 INFO L225 Difference]: With dead ends: 1195 [2019-09-08 12:33:24,768 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:33:24,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:33:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:33:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 832 transitions. [2019-09-08 12:33:24,819 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 832 transitions. Word has length 98 [2019-09-08 12:33:24,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:24,819 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 832 transitions. [2019-09-08 12:33:24,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 832 transitions. [2019-09-08 12:33:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:33:24,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:24,821 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:24,821 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:24,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:24,822 INFO L82 PathProgramCache]: Analyzing trace with hash 309455156, now seen corresponding path program 1 times [2019-09-08 12:33:24,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:24,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:24,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:24,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:24,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:25,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:25,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:25,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:25,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:25,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:25,016 INFO L87 Difference]: Start difference. First operand 642 states and 832 transitions. Second operand 9 states. [2019-09-08 12:33:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:27,293 INFO L93 Difference]: Finished difference Result 1194 states and 1590 transitions. [2019-09-08 12:33:27,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:27,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:33:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:27,295 INFO L225 Difference]: With dead ends: 1194 [2019-09-08 12:33:27,295 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:33:27,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:33:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:33:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 831 transitions. [2019-09-08 12:33:27,344 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 831 transitions. Word has length 99 [2019-09-08 12:33:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:27,344 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 831 transitions. [2019-09-08 12:33:27,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 831 transitions. [2019-09-08 12:33:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:27,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:27,346 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:27,346 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:27,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:27,346 INFO L82 PathProgramCache]: Analyzing trace with hash 291193798, now seen corresponding path program 1 times [2019-09-08 12:33:27,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:27,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:27,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:27,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:27,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:27,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:27,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:27,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:27,500 INFO L87 Difference]: Start difference. First operand 642 states and 831 transitions. Second operand 9 states. [2019-09-08 12:33:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:29,733 INFO L93 Difference]: Finished difference Result 1243 states and 1651 transitions. [2019-09-08 12:33:29,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:29,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:33:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:29,736 INFO L225 Difference]: With dead ends: 1243 [2019-09-08 12:33:29,736 INFO L226 Difference]: Without dead ends: 1129 [2019-09-08 12:33:29,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-08 12:33:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 642. [2019-09-08 12:33:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 830 transitions. [2019-09-08 12:33:29,819 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 830 transitions. Word has length 100 [2019-09-08 12:33:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:29,819 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 830 transitions. [2019-09-08 12:33:29,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 830 transitions. [2019-09-08 12:33:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:29,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:29,821 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:29,821 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:29,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1700395306, now seen corresponding path program 1 times [2019-09-08 12:33:29,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:29,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:29,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:29,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:29,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:30,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:30,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:30,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:30,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:30,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:30,014 INFO L87 Difference]: Start difference. First operand 642 states and 830 transitions. Second operand 9 states. [2019-09-08 12:33:32,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:32,214 INFO L93 Difference]: Finished difference Result 1160 states and 1531 transitions. [2019-09-08 12:33:32,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:32,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:33:32,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:32,217 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 12:33:32,217 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:33:32,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:32,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:33:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:33:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 829 transitions. [2019-09-08 12:33:32,301 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 829 transitions. Word has length 100 [2019-09-08 12:33:32,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:32,302 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 829 transitions. [2019-09-08 12:33:32,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 829 transitions. [2019-09-08 12:33:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:32,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:32,304 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:32,304 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:32,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:32,304 INFO L82 PathProgramCache]: Analyzing trace with hash -10584466, now seen corresponding path program 1 times [2019-09-08 12:33:32,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:32,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:32,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:32,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:32,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:32,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:32,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:32,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:32,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:32,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:32,470 INFO L87 Difference]: Start difference. First operand 642 states and 829 transitions. Second operand 9 states. [2019-09-08 12:33:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:34,812 INFO L93 Difference]: Finished difference Result 1204 states and 1596 transitions. [2019-09-08 12:33:34,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:34,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:33:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:34,815 INFO L225 Difference]: With dead ends: 1204 [2019-09-08 12:33:34,815 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:33:34,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:33:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:33:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 828 transitions. [2019-09-08 12:33:34,893 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 828 transitions. Word has length 100 [2019-09-08 12:33:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:34,893 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 828 transitions. [2019-09-08 12:33:34,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 828 transitions. [2019-09-08 12:33:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:34,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:34,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:34,895 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash -906258735, now seen corresponding path program 1 times [2019-09-08 12:33:34,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:34,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:34,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:34,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:34,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:35,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:35,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:35,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:35,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:35,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:35,041 INFO L87 Difference]: Start difference. First operand 642 states and 828 transitions. Second operand 9 states. [2019-09-08 12:33:37,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:37,038 INFO L93 Difference]: Finished difference Result 1204 states and 1595 transitions. [2019-09-08 12:33:37,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:37,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:33:37,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:37,041 INFO L225 Difference]: With dead ends: 1204 [2019-09-08 12:33:37,041 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:33:37,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:33:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:33:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 827 transitions. [2019-09-08 12:33:37,127 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 827 transitions. Word has length 100 [2019-09-08 12:33:37,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:37,127 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 827 transitions. [2019-09-08 12:33:37,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:37,127 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 827 transitions. [2019-09-08 12:33:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:37,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:37,129 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:37,129 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:37,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:37,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1698897721, now seen corresponding path program 1 times [2019-09-08 12:33:37,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:37,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:37,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:37,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:37,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:37,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:37,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:37,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:37,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:37,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:37,305 INFO L87 Difference]: Start difference. First operand 642 states and 827 transitions. Second operand 9 states. [2019-09-08 12:33:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:39,517 INFO L93 Difference]: Finished difference Result 1160 states and 1528 transitions. [2019-09-08 12:33:39,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:39,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:33:39,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:39,520 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 12:33:39,520 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:33:39,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:39,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:33:39,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:33:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 826 transitions. [2019-09-08 12:33:39,604 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 826 transitions. Word has length 100 [2019-09-08 12:33:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:39,604 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 826 transitions. [2019-09-08 12:33:39,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 826 transitions. [2019-09-08 12:33:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:39,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:39,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:39,606 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:39,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:39,607 INFO L82 PathProgramCache]: Analyzing trace with hash -483952406, now seen corresponding path program 1 times [2019-09-08 12:33:39,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:39,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:39,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:39,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:39,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:39,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:39,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:39,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:39,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:39,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:39,772 INFO L87 Difference]: Start difference. First operand 642 states and 826 transitions. Second operand 9 states. [2019-09-08 12:33:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:42,036 INFO L93 Difference]: Finished difference Result 1157 states and 1524 transitions. [2019-09-08 12:33:42,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:42,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:33:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:42,037 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 12:33:42,037 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:33:42,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:33:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:33:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 825 transitions. [2019-09-08 12:33:42,102 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 825 transitions. Word has length 100 [2019-09-08 12:33:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:42,102 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 825 transitions. [2019-09-08 12:33:42,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:42,102 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 825 transitions. [2019-09-08 12:33:42,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:42,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:42,104 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:42,104 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:42,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:42,104 INFO L82 PathProgramCache]: Analyzing trace with hash -18890581, now seen corresponding path program 1 times [2019-09-08 12:33:42,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:42,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:42,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:42,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:42,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:42,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:42,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:42,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:42,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:42,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:42,246 INFO L87 Difference]: Start difference. First operand 642 states and 825 transitions. Second operand 9 states. [2019-09-08 12:33:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:44,486 INFO L93 Difference]: Finished difference Result 1160 states and 1526 transitions. [2019-09-08 12:33:44,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:44,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:33:44,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:44,488 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 12:33:44,488 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:33:44,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:33:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:33:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 824 transitions. [2019-09-08 12:33:44,547 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 824 transitions. Word has length 100 [2019-09-08 12:33:44,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:44,547 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 824 transitions. [2019-09-08 12:33:44,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 824 transitions. [2019-09-08 12:33:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:44,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:44,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:44,549 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:44,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:44,549 INFO L82 PathProgramCache]: Analyzing trace with hash 827980610, now seen corresponding path program 1 times [2019-09-08 12:33:44,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:44,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:44,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:44,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:44,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:44,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:44,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:44,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:44,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:44,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:44,725 INFO L87 Difference]: Start difference. First operand 642 states and 824 transitions. Second operand 9 states. [2019-09-08 12:33:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:46,944 INFO L93 Difference]: Finished difference Result 1086 states and 1413 transitions. [2019-09-08 12:33:46,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:46,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:33:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:46,947 INFO L225 Difference]: With dead ends: 1086 [2019-09-08 12:33:46,947 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:33:46,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:46,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:33:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:33:47,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 823 transitions. [2019-09-08 12:33:47,005 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 823 transitions. Word has length 100 [2019-09-08 12:33:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:47,005 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 823 transitions. [2019-09-08 12:33:47,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 823 transitions. [2019-09-08 12:33:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:47,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:47,006 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:47,006 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:47,007 INFO L82 PathProgramCache]: Analyzing trace with hash -142106022, now seen corresponding path program 1 times [2019-09-08 12:33:47,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:47,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:47,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:47,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:47,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:47,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:47,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:47,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:47,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:47,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:47,163 INFO L87 Difference]: Start difference. First operand 642 states and 823 transitions. Second operand 9 states. [2019-09-08 12:33:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:49,433 INFO L93 Difference]: Finished difference Result 1130 states and 1476 transitions. [2019-09-08 12:33:49,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:49,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:33:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:49,435 INFO L225 Difference]: With dead ends: 1130 [2019-09-08 12:33:49,435 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:33:49,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:33:49,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:33:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 822 transitions. [2019-09-08 12:33:49,494 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 822 transitions. Word has length 100 [2019-09-08 12:33:49,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:49,494 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 822 transitions. [2019-09-08 12:33:49,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 822 transitions. [2019-09-08 12:33:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:49,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:49,495 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:49,496 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:49,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:49,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2085388437, now seen corresponding path program 1 times [2019-09-08 12:33:49,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:49,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:49,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:49,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:49,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:49,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:49,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:49,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:49,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:49,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:49,690 INFO L87 Difference]: Start difference. First operand 642 states and 822 transitions. Second operand 9 states. [2019-09-08 12:33:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:52,174 INFO L93 Difference]: Finished difference Result 1086 states and 1411 transitions. [2019-09-08 12:33:52,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:52,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:33:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:52,179 INFO L225 Difference]: With dead ends: 1086 [2019-09-08 12:33:52,179 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:33:52,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:33:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:33:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 821 transitions. [2019-09-08 12:33:52,249 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 821 transitions. Word has length 100 [2019-09-08 12:33:52,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:52,250 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 821 transitions. [2019-09-08 12:33:52,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 821 transitions. [2019-09-08 12:33:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:52,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:52,251 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:52,251 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:52,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:52,251 INFO L82 PathProgramCache]: Analyzing trace with hash -209751473, now seen corresponding path program 1 times [2019-09-08 12:33:52,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:52,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:52,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:52,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:52,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:52,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:52,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:52,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:52,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:52,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:52,396 INFO L87 Difference]: Start difference. First operand 642 states and 821 transitions. Second operand 9 states. [2019-09-08 12:33:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:54,540 INFO L93 Difference]: Finished difference Result 1157 states and 1517 transitions. [2019-09-08 12:33:54,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:54,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:33:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:54,542 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 12:33:54,542 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:33:54,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:33:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:33:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 820 transitions. [2019-09-08 12:33:54,603 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 820 transitions. Word has length 100 [2019-09-08 12:33:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:54,604 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 820 transitions. [2019-09-08 12:33:54,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 820 transitions. [2019-09-08 12:33:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:54,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:54,605 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:54,605 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:54,605 INFO L82 PathProgramCache]: Analyzing trace with hash -120851267, now seen corresponding path program 1 times [2019-09-08 12:33:54,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:54,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:54,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:54,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:54,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:54,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:54,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:54,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:54,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:54,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:54,758 INFO L87 Difference]: Start difference. First operand 642 states and 820 transitions. Second operand 9 states. [2019-09-08 12:33:57,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:57,141 INFO L93 Difference]: Finished difference Result 1086 states and 1408 transitions. [2019-09-08 12:33:57,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:57,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:33:57,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:57,143 INFO L225 Difference]: With dead ends: 1086 [2019-09-08 12:33:57,143 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:33:57,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:33:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:33:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 819 transitions. [2019-09-08 12:33:57,207 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 819 transitions. Word has length 100 [2019-09-08 12:33:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:57,208 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 819 transitions. [2019-09-08 12:33:57,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:57,208 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 819 transitions. [2019-09-08 12:33:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:57,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:57,209 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:57,209 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:57,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:57,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1880101188, now seen corresponding path program 1 times [2019-09-08 12:33:57,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:57,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:57,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:57,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:57,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:57,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-08 12:33:57,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:57,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:57,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:57,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:57,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:57,394 INFO L87 Difference]: Start difference. First operand 642 states and 819 transitions. Second operand 9 states. [2019-09-08 12:33:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:59,488 INFO L93 Difference]: Finished difference Result 1157 states and 1514 transitions. [2019-09-08 12:33:59,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:59,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:33:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:59,490 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 12:33:59,490 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:33:59,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:33:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:33:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:33:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:33:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 818 transitions. [2019-09-08 12:33:59,554 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 818 transitions. Word has length 100 [2019-09-08 12:33:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:59,554 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 818 transitions. [2019-09-08 12:33:59,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:33:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 818 transitions. [2019-09-08 12:33:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:33:59,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:59,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:59,555 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:59,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:59,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1432903500, now seen corresponding path program 1 times [2019-09-08 12:33:59,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:59,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:59,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:59,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:59,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:59,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:59,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:33:59,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:33:59,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:33:59,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:33:59,707 INFO L87 Difference]: Start difference. First operand 642 states and 818 transitions. Second operand 9 states. [2019-09-08 12:34:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:01,911 INFO L93 Difference]: Finished difference Result 1157 states and 1513 transitions. [2019-09-08 12:34:01,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:01,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:34:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:01,913 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 12:34:01,913 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:34:01,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:34:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:34:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:34:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 817 transitions. [2019-09-08 12:34:01,978 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 817 transitions. Word has length 100 [2019-09-08 12:34:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:01,978 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 817 transitions. [2019-09-08 12:34:01,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 817 transitions. [2019-09-08 12:34:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:34:01,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:01,979 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:01,979 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:01,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash 53028367, now seen corresponding path program 1 times [2019-09-08 12:34:01,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:01,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:01,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:01,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:01,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:02,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:02,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:02,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:02,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:02,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:02,111 INFO L87 Difference]: Start difference. First operand 642 states and 817 transitions. Second operand 9 states. [2019-09-08 12:34:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:04,388 INFO L93 Difference]: Finished difference Result 1160 states and 1514 transitions. [2019-09-08 12:34:04,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:04,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:34:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:04,390 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 12:34:04,390 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:34:04,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:34:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:34:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:34:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 816 transitions. [2019-09-08 12:34:04,453 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 816 transitions. Word has length 100 [2019-09-08 12:34:04,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:04,454 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 816 transitions. [2019-09-08 12:34:04,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 816 transitions. [2019-09-08 12:34:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:34:04,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:04,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:04,455 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:04,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1991382183, now seen corresponding path program 1 times [2019-09-08 12:34:04,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:04,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:04,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:04,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:04,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:04,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:04,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:04,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:04,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:04,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:04,601 INFO L87 Difference]: Start difference. First operand 642 states and 816 transitions. Second operand 9 states. [2019-09-08 12:34:06,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:06,734 INFO L93 Difference]: Finished difference Result 1204 states and 1576 transitions. [2019-09-08 12:34:06,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:06,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:34:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:06,735 INFO L225 Difference]: With dead ends: 1204 [2019-09-08 12:34:06,736 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 12:34:06,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 12:34:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 642. [2019-09-08 12:34:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:34:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 815 transitions. [2019-09-08 12:34:06,803 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 815 transitions. Word has length 100 [2019-09-08 12:34:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:06,803 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 815 transitions. [2019-09-08 12:34:06,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 815 transitions. [2019-09-08 12:34:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:34:06,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:06,804 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:06,804 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:06,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:06,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1942716530, now seen corresponding path program 1 times [2019-09-08 12:34:06,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:06,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:06,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:06,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:06,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:06,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:06,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:06,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:06,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:06,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:06,981 INFO L87 Difference]: Start difference. First operand 642 states and 815 transitions. Second operand 9 states. [2019-09-08 12:34:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:09,374 INFO L93 Difference]: Finished difference Result 1160 states and 1512 transitions. [2019-09-08 12:34:09,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:09,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:34:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:09,376 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 12:34:09,376 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:34:09,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:34:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:34:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:34:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 814 transitions. [2019-09-08 12:34:09,444 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 814 transitions. Word has length 100 [2019-09-08 12:34:09,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:09,444 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 814 transitions. [2019-09-08 12:34:09,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 814 transitions. [2019-09-08 12:34:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:34:09,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:09,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:09,445 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:09,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:09,445 INFO L82 PathProgramCache]: Analyzing trace with hash -899406943, now seen corresponding path program 1 times [2019-09-08 12:34:09,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:09,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:09,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:09,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:09,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:09,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:09,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:09,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:09,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:09,622 INFO L87 Difference]: Start difference. First operand 642 states and 814 transitions. Second operand 9 states. [2019-09-08 12:34:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:11,892 INFO L93 Difference]: Finished difference Result 1157 states and 1507 transitions. [2019-09-08 12:34:11,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:11,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:34:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:11,894 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 12:34:11,894 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:34:11,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:34:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:34:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:34:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 813 transitions. [2019-09-08 12:34:11,964 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 813 transitions. Word has length 100 [2019-09-08 12:34:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:11,964 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 813 transitions. [2019-09-08 12:34:11,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 813 transitions. [2019-09-08 12:34:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:34:11,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:11,965 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:11,965 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:11,966 INFO L82 PathProgramCache]: Analyzing trace with hash 410796862, now seen corresponding path program 1 times [2019-09-08 12:34:11,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:11,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:11,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:12,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:12,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:12,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:12,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:12,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:12,120 INFO L87 Difference]: Start difference. First operand 642 states and 813 transitions. Second operand 9 states. [2019-09-08 12:34:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:14,337 INFO L93 Difference]: Finished difference Result 1157 states and 1506 transitions. [2019-09-08 12:34:14,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:14,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:34:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:14,339 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 12:34:14,339 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:34:14,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:14,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:34:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:34:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:34:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 812 transitions. [2019-09-08 12:34:14,412 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 812 transitions. Word has length 100 [2019-09-08 12:34:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:14,412 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 812 transitions. [2019-09-08 12:34:14,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 812 transitions. [2019-09-08 12:34:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:34:14,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:14,413 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:14,414 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash -279511526, now seen corresponding path program 1 times [2019-09-08 12:34:14,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:14,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:14,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:14,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:14,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:14,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:14,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:14,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:14,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:14,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:14,549 INFO L87 Difference]: Start difference. First operand 642 states and 812 transitions. Second operand 9 states. [2019-09-08 12:34:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:16,988 INFO L93 Difference]: Finished difference Result 1160 states and 1508 transitions. [2019-09-08 12:34:16,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:16,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:34:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:16,990 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 12:34:16,990 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:34:16,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:34:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:34:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:34:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 811 transitions. [2019-09-08 12:34:17,060 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 811 transitions. Word has length 100 [2019-09-08 12:34:17,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:17,060 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 811 transitions. [2019-09-08 12:34:17,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:17,060 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 811 transitions. [2019-09-08 12:34:17,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:34:17,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:17,062 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:17,062 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:17,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:17,062 INFO L82 PathProgramCache]: Analyzing trace with hash -188121012, now seen corresponding path program 1 times [2019-09-08 12:34:17,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:17,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:17,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:17,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:17,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:17,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:17,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:17,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:17,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:17,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:17,197 INFO L87 Difference]: Start difference. First operand 642 states and 811 transitions. Second operand 9 states. [2019-09-08 12:34:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:19,277 INFO L93 Difference]: Finished difference Result 1157 states and 1503 transitions. [2019-09-08 12:34:19,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:19,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:34:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:19,280 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 12:34:19,280 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:34:19,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:34:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:34:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:34:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 810 transitions. [2019-09-08 12:34:19,399 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 810 transitions. Word has length 100 [2019-09-08 12:34:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:19,399 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 810 transitions. [2019-09-08 12:34:19,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 810 transitions. [2019-09-08 12:34:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:34:19,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:19,400 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:19,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1783081460, now seen corresponding path program 1 times [2019-09-08 12:34:19,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:19,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:19,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:19,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-08 12:34:19,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:19,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:19,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:19,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:19,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:19,544 INFO L87 Difference]: Start difference. First operand 642 states and 810 transitions. Second operand 9 states. [2019-09-08 12:34:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:21,877 INFO L93 Difference]: Finished difference Result 1086 states and 1393 transitions. [2019-09-08 12:34:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:21,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:34:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:21,878 INFO L225 Difference]: With dead ends: 1086 [2019-09-08 12:34:21,878 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:34:21,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:34:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:34:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:34:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 809 transitions. [2019-09-08 12:34:21,951 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 809 transitions. Word has length 100 [2019-09-08 12:34:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:21,951 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 809 transitions. [2019-09-08 12:34:21,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 809 transitions. [2019-09-08 12:34:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:34:21,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:21,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:21,952 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:21,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:21,953 INFO L82 PathProgramCache]: Analyzing trace with hash -902270955, now seen corresponding path program 1 times [2019-09-08 12:34:21,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:21,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:21,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:21,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:21,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:22,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:22,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:22,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:22,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:22,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:22,092 INFO L87 Difference]: Start difference. First operand 642 states and 809 transitions. Second operand 9 states. [2019-09-08 12:34:24,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:24,160 INFO L93 Difference]: Finished difference Result 1157 states and 1499 transitions. [2019-09-08 12:34:24,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:24,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:34:24,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:24,162 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 12:34:24,162 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:34:24,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:34:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:34:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:34:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 808 transitions. [2019-09-08 12:34:24,235 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 808 transitions. Word has length 100 [2019-09-08 12:34:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:24,235 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 808 transitions. [2019-09-08 12:34:24,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 808 transitions. [2019-09-08 12:34:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:34:24,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:24,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:24,237 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:24,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:24,237 INFO L82 PathProgramCache]: Analyzing trace with hash 535576962, now seen corresponding path program 1 times [2019-09-08 12:34:24,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:24,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:24,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:24,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:24,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:24,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:24,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:24,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:24,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:24,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:24,365 INFO L87 Difference]: Start difference. First operand 642 states and 808 transitions. Second operand 9 states. [2019-09-08 12:34:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:26,528 INFO L93 Difference]: Finished difference Result 1157 states and 1498 transitions. [2019-09-08 12:34:26,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:26,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:34:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:26,530 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 12:34:26,530 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:34:26,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:26,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:34:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:34:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:34:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 807 transitions. [2019-09-08 12:34:26,630 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 807 transitions. Word has length 100 [2019-09-08 12:34:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:26,630 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 807 transitions. [2019-09-08 12:34:26,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 807 transitions. [2019-09-08 12:34:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:34:26,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:26,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:26,631 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:26,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1553613818, now seen corresponding path program 1 times [2019-09-08 12:34:26,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:26,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:26,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:26,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:26,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:26,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:26,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:26,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:26,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:26,771 INFO L87 Difference]: Start difference. First operand 642 states and 807 transitions. Second operand 9 states. [2019-09-08 12:34:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:28,957 INFO L93 Difference]: Finished difference Result 1157 states and 1496 transitions. [2019-09-08 12:34:28,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:28,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:34:28,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:28,959 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 12:34:28,959 INFO L226 Difference]: Without dead ends: 1081 [2019-09-08 12:34:28,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-09-08 12:34:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 642. [2019-09-08 12:34:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 12:34:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 806 transitions. [2019-09-08 12:34:29,035 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 806 transitions. Word has length 100 [2019-09-08 12:34:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:29,035 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 806 transitions. [2019-09-08 12:34:29,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 806 transitions. [2019-09-08 12:34:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:34:29,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:29,037 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:29,037 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:29,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:29,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1511064327, now seen corresponding path program 1 times [2019-09-08 12:34:29,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:29,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:29,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:29,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:29,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:29,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:29,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:29,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:29,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:29,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:29,156 INFO L87 Difference]: Start difference. First operand 642 states and 806 transitions. Second operand 9 states. [2019-09-08 12:34:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:31,394 INFO L93 Difference]: Finished difference Result 1155 states and 1492 transitions. [2019-09-08 12:34:31,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:31,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:34:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:31,396 INFO L225 Difference]: With dead ends: 1155 [2019-09-08 12:34:31,396 INFO L226 Difference]: Without dead ends: 1080 [2019-09-08 12:34:31,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2019-09-08 12:34:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 641. [2019-09-08 12:34:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-08 12:34:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 804 transitions. [2019-09-08 12:34:31,472 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 804 transitions. Word has length 101 [2019-09-08 12:34:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:31,472 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 804 transitions. [2019-09-08 12:34:31,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 804 transitions. [2019-09-08 12:34:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:34:31,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:31,474 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:31,474 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:31,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash 2123623915, now seen corresponding path program 1 times [2019-09-08 12:34:31,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:31,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:31,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:31,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:31,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:31,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:31,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:31,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:31,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:31,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:31,630 INFO L87 Difference]: Start difference. First operand 641 states and 804 transitions. Second operand 9 states. [2019-09-08 12:34:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:33,846 INFO L93 Difference]: Finished difference Result 1154 states and 1490 transitions. [2019-09-08 12:34:33,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:33,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:34:33,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:33,848 INFO L225 Difference]: With dead ends: 1154 [2019-09-08 12:34:33,848 INFO L226 Difference]: Without dead ends: 1080 [2019-09-08 12:34:33,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:33,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2019-09-08 12:34:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 641. [2019-09-08 12:34:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-08 12:34:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 803 transitions. [2019-09-08 12:34:33,931 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 803 transitions. Word has length 101 [2019-09-08 12:34:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:33,931 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 803 transitions. [2019-09-08 12:34:33,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 803 transitions. [2019-09-08 12:34:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:34:33,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:33,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, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:33,933 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:33,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash -686829505, now seen corresponding path program 1 times [2019-09-08 12:34:33,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:33,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:33,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:33,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:33,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:34,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:34,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:34,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:34,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:34,051 INFO L87 Difference]: Start difference. First operand 641 states and 803 transitions. Second operand 9 states. [2019-09-08 12:34:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:36,359 INFO L93 Difference]: Finished difference Result 1154 states and 1489 transitions. [2019-09-08 12:34:36,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:36,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:34:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:36,361 INFO L225 Difference]: With dead ends: 1154 [2019-09-08 12:34:36,361 INFO L226 Difference]: Without dead ends: 1079 [2019-09-08 12:34:36,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-09-08 12:34:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 640. [2019-09-08 12:34:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-08 12:34:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 801 transitions. [2019-09-08 12:34:36,457 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 801 transitions. Word has length 101 [2019-09-08 12:34:36,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:36,457 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 801 transitions. [2019-09-08 12:34:36,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 801 transitions. [2019-09-08 12:34:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:34:36,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:36,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:36,459 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:36,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:36,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1381337777, now seen corresponding path program 1 times [2019-09-08 12:34:36,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:36,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:36,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:36,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:36,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:36,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:36,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:36,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:36,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:36,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:36,587 INFO L87 Difference]: Start difference. First operand 640 states and 801 transitions. Second operand 9 states. [2019-09-08 12:34:38,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:38,895 INFO L93 Difference]: Finished difference Result 1152 states and 1486 transitions. [2019-09-08 12:34:38,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:38,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:34:38,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:38,896 INFO L225 Difference]: With dead ends: 1152 [2019-09-08 12:34:38,896 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:34:38,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:34:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:34:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:34:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 799 transitions. [2019-09-08 12:34:38,978 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 799 transitions. Word has length 101 [2019-09-08 12:34:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:38,979 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 799 transitions. [2019-09-08 12:34:38,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 799 transitions. [2019-09-08 12:34:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:34:38,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:38,980 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:38,980 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash -312727000, now seen corresponding path program 1 times [2019-09-08 12:34:38,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:38,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:38,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:38,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:38,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:39,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:39,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:39,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:39,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:39,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:39,109 INFO L87 Difference]: Start difference. First operand 639 states and 799 transitions. Second operand 9 states. [2019-09-08 12:34:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:41,303 INFO L93 Difference]: Finished difference Result 1152 states and 1484 transitions. [2019-09-08 12:34:41,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:41,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:34:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:41,304 INFO L225 Difference]: With dead ends: 1152 [2019-09-08 12:34:41,304 INFO L226 Difference]: Without dead ends: 1077 [2019-09-08 12:34:41,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:41,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-08 12:34:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 639. [2019-09-08 12:34:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 12:34:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 798 transitions. [2019-09-08 12:34:41,387 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 798 transitions. Word has length 101 [2019-09-08 12:34:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:41,387 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 798 transitions. [2019-09-08 12:34:41,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 798 transitions. [2019-09-08 12:34:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:34:41,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:41,388 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:41,389 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:41,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:41,389 INFO L82 PathProgramCache]: Analyzing trace with hash -69019033, now seen corresponding path program 1 times [2019-09-08 12:34:41,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:41,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:41,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:41,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:41,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:41,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:41,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:34:41,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:34:41,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:34:41,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:34:41,513 INFO L87 Difference]: Start difference. First operand 639 states and 798 transitions. Second operand 9 states. [2019-09-08 12:34:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:43,410 INFO L93 Difference]: Finished difference Result 1151 states and 1482 transitions. [2019-09-08 12:34:43,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:34:43,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:34:43,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:43,412 INFO L225 Difference]: With dead ends: 1151 [2019-09-08 12:34:43,412 INFO L226 Difference]: Without dead ends: 1076 [2019-09-08 12:34:43,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:34:43,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-09-08 12:34:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 638. [2019-09-08 12:34:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 12:34:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 796 transitions. [2019-09-08 12:34:43,493 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 796 transitions. Word has length 101 [2019-09-08 12:34:43,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:43,494 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 796 transitions. [2019-09-08 12:34:43,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:34:43,494 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 796 transitions. [2019-09-08 12:34:43,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:34:43,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:43,495 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:43,495 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:43,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:43,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1147136159, now seen corresponding path program 1 times [2019-09-08 12:34:43,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:43,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:43,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:43,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:43,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:44,258 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-08 12:34:44,693 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:34:44,840 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 12:34:44,993 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-08 12:34:46,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:46,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:46,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:34:46,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:34:46,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:34:46,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:34:46,260 INFO L87 Difference]: Start difference. First operand 638 states and 796 transitions. Second operand 31 states. [2019-09-08 12:34:46,469 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:34:47,537 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:34:47,705 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:34:48,148 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 12:34:48,454 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-08 12:34:48,818 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-09-08 12:34:49,252 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2019-09-08 12:34:49,802 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2019-09-08 12:34:50,084 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:34:50,355 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:34:50,675 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 12:35:01,757 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-08 12:35:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:03,430 INFO L93 Difference]: Finished difference Result 1321 states and 1669 transitions. [2019-09-08 12:35:03,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:35:03,430 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 102 [2019-09-08 12:35:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:03,432 INFO L225 Difference]: With dead ends: 1321 [2019-09-08 12:35:03,433 INFO L226 Difference]: Without dead ends: 1243 [2019-09-08 12:35:03,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=503, Invalid=2047, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:35:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2019-09-08 12:35:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 663. [2019-09-08 12:35:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-08 12:35:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 829 transitions. [2019-09-08 12:35:03,566 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 829 transitions. Word has length 102 [2019-09-08 12:35:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:03,566 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 829 transitions. [2019-09-08 12:35:03,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:35:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 829 transitions. [2019-09-08 12:35:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:35:03,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:03,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:03,568 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:03,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:03,568 INFO L82 PathProgramCache]: Analyzing trace with hash -80543799, now seen corresponding path program 1 times [2019-09-08 12:35:03,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:03,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:03,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:03,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:03,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:04,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:04,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:35:04,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:35:04,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:35:04,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:35:04,329 INFO L87 Difference]: Start difference. First operand 663 states and 829 transitions. Second operand 17 states. [2019-09-08 12:35:04,887 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:35:05,022 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:35:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:07,933 INFO L93 Difference]: Finished difference Result 1336 states and 1722 transitions. [2019-09-08 12:35:07,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:35:07,933 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-08 12:35:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:07,935 INFO L225 Difference]: With dead ends: 1336 [2019-09-08 12:35:07,935 INFO L226 Difference]: Without dead ends: 1233 [2019-09-08 12:35:07,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:35:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-09-08 12:35:08,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 652. [2019-09-08 12:35:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-09-08 12:35:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 814 transitions. [2019-09-08 12:35:08,055 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 814 transitions. Word has length 102 [2019-09-08 12:35:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:08,056 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 814 transitions. [2019-09-08 12:35:08,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:35:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 814 transitions. [2019-09-08 12:35:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:35:08,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:08,057 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:08,058 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:08,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:08,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1830092596, now seen corresponding path program 1 times [2019-09-08 12:35:08,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:08,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:08,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:08,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:08,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:09,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:09,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:35:09,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:35:09,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:35:09,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:35:09,298 INFO L87 Difference]: Start difference. First operand 652 states and 814 transitions. Second operand 22 states. [2019-09-08 12:35:10,305 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-08 12:35:10,565 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-08 12:35:10,894 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-08 12:35:11,061 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:35:11,438 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-08 12:35:11,941 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-09-08 12:35:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:16,114 INFO L93 Difference]: Finished difference Result 1348 states and 1718 transitions. [2019-09-08 12:35:16,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:35:16,114 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2019-09-08 12:35:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:16,116 INFO L225 Difference]: With dead ends: 1348 [2019-09-08 12:35:16,116 INFO L226 Difference]: Without dead ends: 1245 [2019-09-08 12:35:16,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:35:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2019-09-08 12:35:16,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 658. [2019-09-08 12:35:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-08 12:35:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 820 transitions. [2019-09-08 12:35:16,232 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 820 transitions. Word has length 102 [2019-09-08 12:35:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:16,232 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 820 transitions. [2019-09-08 12:35:16,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:35:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 820 transitions. [2019-09-08 12:35:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:35:16,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:16,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:16,234 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:16,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash 562528111, now seen corresponding path program 1 times [2019-09-08 12:35:16,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:16,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:16,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:16,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:16,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:17,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:17,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:35:17,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:35:17,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:35:17,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:35:17,965 INFO L87 Difference]: Start difference. First operand 658 states and 820 transitions. Second operand 26 states. [2019-09-08 12:35:18,105 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 12:35:19,169 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 12:35:19,477 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-08 12:35:19,883 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-09-08 12:35:22,894 WARN L188 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 129 DAG size of output: 120 [2019-09-08 12:35:23,106 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-08 12:35:23,323 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-08 12:35:23,617 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-08 12:35:26,796 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 12:35:35,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:35,307 INFO L93 Difference]: Finished difference Result 1848 states and 2334 transitions. [2019-09-08 12:35:35,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:35:35,307 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2019-09-08 12:35:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:35,309 INFO L225 Difference]: With dead ends: 1848 [2019-09-08 12:35:35,309 INFO L226 Difference]: Without dead ends: 1771 [2019-09-08 12:35:35,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=418, Invalid=1934, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 12:35:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2019-09-08 12:35:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 671. [2019-09-08 12:35:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-09-08 12:35:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 838 transitions. [2019-09-08 12:35:35,463 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 838 transitions. Word has length 102 [2019-09-08 12:35:35,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:35,463 INFO L475 AbstractCegarLoop]: Abstraction has 671 states and 838 transitions. [2019-09-08 12:35:35,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:35:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 838 transitions. [2019-09-08 12:35:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:35:35,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:35,465 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:35,465 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:35,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:35,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1027137318, now seen corresponding path program 1 times [2019-09-08 12:35:35,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:35,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:35,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:35,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:35,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:36,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:36,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:35:36,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:35:36,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:35:36,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:35:36,191 INFO L87 Difference]: Start difference. First operand 671 states and 838 transitions. Second operand 17 states. [2019-09-08 12:35:36,770 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:35:36,906 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:35:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:39,932 INFO L93 Difference]: Finished difference Result 1319 states and 1700 transitions. [2019-09-08 12:35:39,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:35:39,932 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-08 12:35:39,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:39,935 INFO L225 Difference]: With dead ends: 1319 [2019-09-08 12:35:39,935 INFO L226 Difference]: Without dead ends: 1221 [2019-09-08 12:35:39,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:35:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-09-08 12:35:40,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 651. [2019-09-08 12:35:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-08 12:35:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 809 transitions. [2019-09-08 12:35:40,072 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 809 transitions. Word has length 102 [2019-09-08 12:35:40,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:40,073 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 809 transitions. [2019-09-08 12:35:40,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:35:40,073 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 809 transitions. [2019-09-08 12:35:40,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:35:40,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:40,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:40,074 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:40,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:40,074 INFO L82 PathProgramCache]: Analyzing trace with hash 372185749, now seen corresponding path program 1 times [2019-09-08 12:35:40,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:40,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:40,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:40,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:40,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:40,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:40,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:35:40,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:35:40,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:35:40,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:35:40,761 INFO L87 Difference]: Start difference. First operand 651 states and 809 transitions. Second operand 16 states. [2019-09-08 12:35:41,434 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:35:41,690 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:35:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:45,189 INFO L93 Difference]: Finished difference Result 1131 states and 1373 transitions. [2019-09-08 12:35:45,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:35:45,189 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2019-09-08 12:35:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:45,191 INFO L225 Difference]: With dead ends: 1131 [2019-09-08 12:35:45,192 INFO L226 Difference]: Without dead ends: 1127 [2019-09-08 12:35:45,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:35:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2019-09-08 12:35:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 674. [2019-09-08 12:35:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-08 12:35:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 841 transitions. [2019-09-08 12:35:45,368 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 841 transitions. Word has length 102 [2019-09-08 12:35:45,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:45,368 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 841 transitions. [2019-09-08 12:35:45,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:35:45,369 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 841 transitions. [2019-09-08 12:35:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:35:45,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:45,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:45,370 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:45,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:45,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1173487299, now seen corresponding path program 1 times [2019-09-08 12:35:45,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:45,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:45,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:45,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:45,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:46,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:46,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:35:46,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:35:46,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:35:46,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:35:46,630 INFO L87 Difference]: Start difference. First operand 674 states and 841 transitions. Second operand 22 states. [2019-09-08 12:35:47,668 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-08 12:35:47,939 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-08 12:35:48,268 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-09-08 12:35:48,446 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-08 12:35:48,677 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-08 12:35:48,930 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-08 12:35:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:52,431 INFO L93 Difference]: Finished difference Result 1426 states and 1810 transitions. [2019-09-08 12:35:52,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:35:52,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2019-09-08 12:35:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:52,433 INFO L225 Difference]: With dead ends: 1426 [2019-09-08 12:35:52,433 INFO L226 Difference]: Without dead ends: 1281 [2019-09-08 12:35:52,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:35:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-09-08 12:35:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 686. [2019-09-08 12:35:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-09-08 12:35:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 853 transitions. [2019-09-08 12:35:52,585 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 853 transitions. Word has length 102 [2019-09-08 12:35:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:52,585 INFO L475 AbstractCegarLoop]: Abstraction has 686 states and 853 transitions. [2019-09-08 12:35:52,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:35:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 853 transitions. [2019-09-08 12:35:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:35:52,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:52,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:52,587 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:52,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:52,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1827059128, now seen corresponding path program 1 times [2019-09-08 12:35:52,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:52,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:52,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:52,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:52,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:53,755 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:35:53,895 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 12:35:54,058 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 12:35:54,271 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:35:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:55,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:55,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:35:55,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:35:55,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:35:55,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:35:55,236 INFO L87 Difference]: Start difference. First operand 686 states and 853 transitions. Second operand 31 states. [2019-09-08 12:35:55,419 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-08 12:35:56,539 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-08 12:35:56,706 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-08 12:35:57,005 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-08 12:35:57,459 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-08 12:35:57,836 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-08 12:35:58,294 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-09-08 12:36:03,251 WARN L188 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 140 DAG size of output: 121 [2019-09-08 12:36:03,897 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-08 12:36:04,196 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-08 12:36:04,535 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-08 12:36:04,882 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-09-08 12:36:05,177 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-08 12:36:05,596 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-08 12:36:06,076 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-08 12:36:06,532 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-08 12:36:06,912 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-08 12:36:07,662 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-08 12:36:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:19,327 INFO L93 Difference]: Finished difference Result 1504 states and 1864 transitions. [2019-09-08 12:36:19,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 12:36:19,328 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 102 [2019-09-08 12:36:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:19,330 INFO L225 Difference]: With dead ends: 1504 [2019-09-08 12:36:19,330 INFO L226 Difference]: Without dead ends: 1423 [2019-09-08 12:36:19,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=707, Invalid=2599, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 12:36:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-09-08 12:36:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 700. [2019-09-08 12:36:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-09-08 12:36:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 869 transitions. [2019-09-08 12:36:19,498 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 869 transitions. Word has length 102 [2019-09-08 12:36:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:19,498 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 869 transitions. [2019-09-08 12:36:19,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:36:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 869 transitions. [2019-09-08 12:36:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:36:19,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:19,499 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:19,499 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:19,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:19,500 INFO L82 PathProgramCache]: Analyzing trace with hash -337214839, now seen corresponding path program 1 times [2019-09-08 12:36:19,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:19,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:19,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:19,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:19,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:20,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:20,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:36:20,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:36:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:36:20,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:36:20,186 INFO L87 Difference]: Start difference. First operand 700 states and 869 transitions. Second operand 17 states. [2019-09-08 12:36:20,849 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:36:23,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:23,219 INFO L93 Difference]: Finished difference Result 1375 states and 1767 transitions. [2019-09-08 12:36:23,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:36:23,219 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-08 12:36:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:23,221 INFO L225 Difference]: With dead ends: 1375 [2019-09-08 12:36:23,221 INFO L226 Difference]: Without dead ends: 1246 [2019-09-08 12:36:23,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:36:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2019-09-08 12:36:23,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 668. [2019-09-08 12:36:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-08 12:36:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 827 transitions. [2019-09-08 12:36:23,396 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 827 transitions. Word has length 102 [2019-09-08 12:36:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:23,397 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 827 transitions. [2019-09-08 12:36:23,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:36:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 827 transitions. [2019-09-08 12:36:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:36:23,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:23,398 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:23,398 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:23,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1275780606, now seen corresponding path program 1 times [2019-09-08 12:36:23,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:23,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:23,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:24,309 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:36:24,478 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 12:36:24,634 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:36:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:25,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:25,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-08 12:36:25,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 12:36:25,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 12:36:25,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:36:25,655 INFO L87 Difference]: Start difference. First operand 668 states and 827 transitions. Second operand 30 states. [2019-09-08 12:36:25,855 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-08 12:36:26,962 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-08 12:36:27,238 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-09-08 12:36:27,694 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-09-08 12:36:28,059 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 84 [2019-09-08 12:36:28,511 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 95 [2019-09-08 12:36:29,055 WARN L188 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 105 [2019-09-08 12:36:29,330 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-08 12:36:29,635 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 78 [2019-09-08 12:36:29,912 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-08 12:36:30,167 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-09-08 12:36:30,423 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-09-08 12:36:30,815 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-09-08 12:36:42,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:42,757 INFO L93 Difference]: Finished difference Result 1569 states and 1959 transitions. [2019-09-08 12:36:42,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:36:42,758 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 102 [2019-09-08 12:36:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:42,759 INFO L225 Difference]: With dead ends: 1569 [2019-09-08 12:36:42,759 INFO L226 Difference]: Without dead ends: 1466 [2019-09-08 12:36:42,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=549, Invalid=2001, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:36:42,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-09-08 12:36:42,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 684. [2019-09-08 12:36:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-09-08 12:36:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 845 transitions. [2019-09-08 12:36:42,936 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 845 transitions. Word has length 102 [2019-09-08 12:36:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:42,936 INFO L475 AbstractCegarLoop]: Abstraction has 684 states and 845 transitions. [2019-09-08 12:36:42,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 12:36:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 845 transitions. [2019-09-08 12:36:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:36:42,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:42,938 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:42,938 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:42,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:42,938 INFO L82 PathProgramCache]: Analyzing trace with hash 818309933, now seen corresponding path program 1 times [2019-09-08 12:36:42,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:42,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:42,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:42,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:42,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:43,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:43,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 12:36:43,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:36:43,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:36:43,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:36:43,982 INFO L87 Difference]: Start difference. First operand 684 states and 845 transitions. Second operand 20 states. [2019-09-08 12:36:44,870 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-08 12:36:45,109 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-09-08 12:36:45,290 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:36:45,465 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:36:45,632 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:36:45,777 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 12:36:45,918 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 12:36:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:49,837 INFO L93 Difference]: Finished difference Result 1494 states and 1865 transitions. [2019-09-08 12:36:49,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:36:49,838 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 102 [2019-09-08 12:36:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:49,840 INFO L225 Difference]: With dead ends: 1494 [2019-09-08 12:36:49,840 INFO L226 Difference]: Without dead ends: 1301 [2019-09-08 12:36:49,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:36:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2019-09-08 12:36:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 674. [2019-09-08 12:36:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-08 12:36:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 833 transitions. [2019-09-08 12:36:50,023 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 833 transitions. Word has length 102 [2019-09-08 12:36:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:50,024 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 833 transitions. [2019-09-08 12:36:50,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:36:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 833 transitions. [2019-09-08 12:36:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:36:50,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:50,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:50,025 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:50,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:50,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2057276911, now seen corresponding path program 1 times [2019-09-08 12:36:50,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:50,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:50,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:50,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:50,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:51,136 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:36:51,297 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:36:51,465 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:36:51,621 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 12:36:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:52,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:52,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-09-08 12:36:52,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 12:36:52,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 12:36:52,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:36:52,914 INFO L87 Difference]: Start difference. First operand 674 states and 833 transitions. Second operand 32 states. [2019-09-08 12:36:53,127 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2019-09-08 12:36:54,118 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-09-08 12:36:54,295 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-08 12:36:54,527 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-09-08 12:36:55,205 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 97 [2019-09-08 12:36:55,664 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 86 [2019-09-08 12:36:56,157 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 99 [2019-09-08 12:36:56,742 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 111 [2019-09-08 12:36:57,452 WARN L188 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 126 [2019-09-08 12:36:57,757 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-09-08 12:36:58,090 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2019-09-08 12:36:58,439 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2019-09-08 12:36:58,740 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2019-09-08 12:36:59,067 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2019-09-08 12:36:59,525 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-09-08 12:37:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:10,214 INFO L93 Difference]: Finished difference Result 1251 states and 1564 transitions. [2019-09-08 12:37:10,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 12:37:10,214 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 102 [2019-09-08 12:37:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:10,215 INFO L225 Difference]: With dead ends: 1251 [2019-09-08 12:37:10,216 INFO L226 Difference]: Without dead ends: 1170 [2019-09-08 12:37:10,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=572, Invalid=2184, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 12:37:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-08 12:37:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 690. [2019-09-08 12:37:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-09-08 12:37:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 851 transitions. [2019-09-08 12:37:10,392 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 851 transitions. Word has length 102 [2019-09-08 12:37:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:10,392 INFO L475 AbstractCegarLoop]: Abstraction has 690 states and 851 transitions. [2019-09-08 12:37:10,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 12:37:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 851 transitions. [2019-09-08 12:37:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:37:10,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:10,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:10,393 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:10,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1985149574, now seen corresponding path program 1 times [2019-09-08 12:37:10,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:10,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:10,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:10,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:10,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:11,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:11,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:37:11,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:37:11,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:37:11,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:37:11,266 INFO L87 Difference]: Start difference. First operand 690 states and 851 transitions. Second operand 17 states. [2019-09-08 12:37:11,950 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:37:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:16,194 INFO L93 Difference]: Finished difference Result 1269 states and 1624 transitions. [2019-09-08 12:37:16,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:37:16,194 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-08 12:37:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:16,195 INFO L225 Difference]: With dead ends: 1269 [2019-09-08 12:37:16,195 INFO L226 Difference]: Without dead ends: 1192 [2019-09-08 12:37:16,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:37:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-09-08 12:37:16,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 690. [2019-09-08 12:37:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-09-08 12:37:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 849 transitions. [2019-09-08 12:37:16,378 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 849 transitions. Word has length 102 [2019-09-08 12:37:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:16,378 INFO L475 AbstractCegarLoop]: Abstraction has 690 states and 849 transitions. [2019-09-08 12:37:16,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:37:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 849 transitions. [2019-09-08 12:37:16,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:37:16,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:16,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:16,380 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:16,380 INFO L82 PathProgramCache]: Analyzing trace with hash 578828359, now seen corresponding path program 1 times [2019-09-08 12:37:16,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:16,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:16,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:16,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:16,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:17,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:17,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:37:17,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:37:17,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:37:17,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:37:17,075 INFO L87 Difference]: Start difference. First operand 690 states and 849 transitions. Second operand 17 states. [2019-09-08 12:37:17,646 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:37:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:19,748 INFO L93 Difference]: Finished difference Result 1306 states and 1666 transitions. [2019-09-08 12:37:19,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:37:19,749 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-08 12:37:19,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:19,750 INFO L225 Difference]: With dead ends: 1306 [2019-09-08 12:37:19,751 INFO L226 Difference]: Without dead ends: 1131 [2019-09-08 12:37:19,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:37:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2019-09-08 12:37:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 634. [2019-09-08 12:37:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-08 12:37:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 775 transitions. [2019-09-08 12:37:19,953 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 775 transitions. Word has length 102 [2019-09-08 12:37:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:19,953 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 775 transitions. [2019-09-08 12:37:19,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:37:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 775 transitions. [2019-09-08 12:37:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:37:19,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:19,955 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:19,955 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2017856453, now seen corresponding path program 1 times [2019-09-08 12:37:19,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:19,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:20,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:20,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:20,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:20,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:20,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:20,138 INFO L87 Difference]: Start difference. First operand 634 states and 775 transitions. Second operand 9 states. [2019-09-08 12:37:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:22,372 INFO L93 Difference]: Finished difference Result 1145 states and 1464 transitions. [2019-09-08 12:37:22,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:22,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:37:22,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:22,374 INFO L225 Difference]: With dead ends: 1145 [2019-09-08 12:37:22,374 INFO L226 Difference]: Without dead ends: 1053 [2019-09-08 12:37:22,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:37:22,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-08 12:37:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 634. [2019-09-08 12:37:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-08 12:37:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 773 transitions. [2019-09-08 12:37:22,558 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 773 transitions. Word has length 103 [2019-09-08 12:37:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:22,558 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 773 transitions. [2019-09-08 12:37:22,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 773 transitions. [2019-09-08 12:37:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:37:22,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:22,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:22,560 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:22,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:22,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1724675309, now seen corresponding path program 1 times [2019-09-08 12:37:22,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:22,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:22,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:22,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:22,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:22,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:22,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:22,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:22,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:22,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:22,696 INFO L87 Difference]: Start difference. First operand 634 states and 773 transitions. Second operand 9 states. [2019-09-08 12:37:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:24,706 INFO L93 Difference]: Finished difference Result 1029 states and 1295 transitions. [2019-09-08 12:37:24,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:24,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:37:24,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:24,708 INFO L225 Difference]: With dead ends: 1029 [2019-09-08 12:37:24,708 INFO L226 Difference]: Without dead ends: 1022 [2019-09-08 12:37:24,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:37:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2019-09-08 12:37:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 634. [2019-09-08 12:37:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-08 12:37:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 771 transitions. [2019-09-08 12:37:24,879 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 771 transitions. Word has length 103 [2019-09-08 12:37:24,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:24,879 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 771 transitions. [2019-09-08 12:37:24,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 771 transitions. [2019-09-08 12:37:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:37:24,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:24,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:24,880 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash -193101075, now seen corresponding path program 1 times [2019-09-08 12:37:24,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:24,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:24,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:24,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:24,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:25,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:25,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:37:25,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:37:25,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:37:25,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:37:25,384 INFO L87 Difference]: Start difference. First operand 634 states and 771 transitions. Second operand 12 states. [2019-09-08 12:37:25,858 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 12:37:26,003 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 12:37:26,303 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-08 12:37:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:27,442 INFO L93 Difference]: Finished difference Result 1319 states and 1711 transitions. [2019-09-08 12:37:27,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:37:27,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2019-09-08 12:37:27,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:27,444 INFO L225 Difference]: With dead ends: 1319 [2019-09-08 12:37:27,444 INFO L226 Difference]: Without dead ends: 1223 [2019-09-08 12:37:27,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:37:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-09-08 12:37:27,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 612. [2019-09-08 12:37:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 12:37:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 746 transitions. [2019-09-08 12:37:27,662 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 746 transitions. Word has length 103 [2019-09-08 12:37:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:27,663 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 746 transitions. [2019-09-08 12:37:27,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:37:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 746 transitions. [2019-09-08 12:37:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:37:27,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:27,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:27,664 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:27,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:27,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1298823277, now seen corresponding path program 1 times [2019-09-08 12:37:27,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:27,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:27,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:27,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:27,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:28,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:28,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:37:28,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:37:28,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:37:28,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:37:28,433 INFO L87 Difference]: Start difference. First operand 612 states and 746 transitions. Second operand 16 states. [2019-09-08 12:37:29,103 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-08 12:37:30,474 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-08 12:37:32,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:32,568 INFO L93 Difference]: Finished difference Result 1329 states and 1724 transitions. [2019-09-08 12:37:32,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:37:32,569 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-08 12:37:32,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:32,570 INFO L225 Difference]: With dead ends: 1329 [2019-09-08 12:37:32,570 INFO L226 Difference]: Without dead ends: 1239 [2019-09-08 12:37:32,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:37:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-09-08 12:37:32,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 618. [2019-09-08 12:37:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 12:37:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 753 transitions. [2019-09-08 12:37:32,760 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 753 transitions. Word has length 103 [2019-09-08 12:37:32,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:32,760 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 753 transitions. [2019-09-08 12:37:32,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:37:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 753 transitions. [2019-09-08 12:37:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:37:32,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:32,761 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:32,762 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1405459957, now seen corresponding path program 1 times [2019-09-08 12:37:32,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:32,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:32,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:32,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:32,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:33,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:33,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:37:33,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:37:33,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:37:33,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:37:33,497 INFO L87 Difference]: Start difference. First operand 618 states and 753 transitions. Second operand 17 states. [2019-09-08 12:37:34,077 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 12:37:34,224 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-08 12:37:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:36,240 INFO L93 Difference]: Finished difference Result 1145 states and 1465 transitions. [2019-09-08 12:37:36,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:37:36,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:37:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:36,242 INFO L225 Difference]: With dead ends: 1145 [2019-09-08 12:37:36,242 INFO L226 Difference]: Without dead ends: 1030 [2019-09-08 12:37:36,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:37:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-09-08 12:37:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 595. [2019-09-08 12:37:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-08 12:37:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 726 transitions. [2019-09-08 12:37:36,441 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 726 transitions. Word has length 103 [2019-09-08 12:37:36,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:36,441 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 726 transitions. [2019-09-08 12:37:36,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:37:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 726 transitions. [2019-09-08 12:37:36,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:37:36,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:36,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:36,443 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:36,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:36,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2048395954, now seen corresponding path program 1 times [2019-09-08 12:37:36,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:36,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:36,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:36,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:36,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:37,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:37,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:37:37,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:37:37,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:37:37,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:37:37,700 INFO L87 Difference]: Start difference. First operand 595 states and 726 transitions. Second operand 21 states. [2019-09-08 12:37:38,828 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2019-09-08 12:37:39,102 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-09-08 12:37:39,309 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-08 12:37:39,507 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-08 12:37:44,455 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-08 12:37:45,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:45,306 INFO L93 Difference]: Finished difference Result 1091 states and 1339 transitions. [2019-09-08 12:37:45,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:37:45,306 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2019-09-08 12:37:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:45,308 INFO L225 Difference]: With dead ends: 1091 [2019-09-08 12:37:45,308 INFO L226 Difference]: Without dead ends: 1013 [2019-09-08 12:37:45,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=247, Invalid=1085, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:37:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-09-08 12:37:45,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 612. [2019-09-08 12:37:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 12:37:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 748 transitions. [2019-09-08 12:37:45,489 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 748 transitions. Word has length 103 [2019-09-08 12:37:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:45,490 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 748 transitions. [2019-09-08 12:37:45,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:37:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 748 transitions. [2019-09-08 12:37:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:37:45,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:45,491 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:45,491 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1914956223, now seen corresponding path program 1 times [2019-09-08 12:37:45,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:45,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:45,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:45,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:45,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:45,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:45,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:37:45,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:37:45,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:37:45,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:37:45,839 INFO L87 Difference]: Start difference. First operand 612 states and 748 transitions. Second operand 11 states. [2019-09-08 12:37:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:47,796 INFO L93 Difference]: Finished difference Result 1455 states and 1944 transitions. [2019-09-08 12:37:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:37:47,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-09-08 12:37:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:47,798 INFO L225 Difference]: With dead ends: 1455 [2019-09-08 12:37:47,798 INFO L226 Difference]: Without dead ends: 1370 [2019-09-08 12:37:47,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:37:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-09-08 12:37:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 601. [2019-09-08 12:37:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-08 12:37:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 733 transitions. [2019-09-08 12:37:47,984 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 733 transitions. Word has length 103 [2019-09-08 12:37:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:47,984 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 733 transitions. [2019-09-08 12:37:47,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:37:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 733 transitions. [2019-09-08 12:37:47,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:37:47,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:47,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:47,986 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:47,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1559299579, now seen corresponding path program 1 times [2019-09-08 12:37:47,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:47,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:47,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:47,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:47,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:49,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:49,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:37:49,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:37:49,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:37:49,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:37:49,111 INFO L87 Difference]: Start difference. First operand 601 states and 733 transitions. Second operand 21 states. [2019-09-08 12:37:50,190 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:37:50,456 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-08 12:37:50,630 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:37:50,796 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:37:50,998 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-08 12:37:54,418 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-08 12:37:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:55,873 INFO L93 Difference]: Finished difference Result 1057 states and 1301 transitions. [2019-09-08 12:37:55,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:37:55,873 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2019-09-08 12:37:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:55,875 INFO L225 Difference]: With dead ends: 1057 [2019-09-08 12:37:55,875 INFO L226 Difference]: Without dead ends: 979 [2019-09-08 12:37:55,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=263, Invalid=927, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:37:55,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-09-08 12:37:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 601. [2019-09-08 12:37:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-08 12:37:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 733 transitions. [2019-09-08 12:37:56,064 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 733 transitions. Word has length 103 [2019-09-08 12:37:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:56,064 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 733 transitions. [2019-09-08 12:37:56,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:37:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 733 transitions. [2019-09-08 12:37:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:37:56,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:56,066 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:56,066 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:56,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:56,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1049847790, now seen corresponding path program 1 times [2019-09-08 12:37:56,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:56,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:56,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:56,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:56,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:56,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:56,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:37:56,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:37:56,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:37:56,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:37:56,806 INFO L87 Difference]: Start difference. First operand 601 states and 733 transitions. Second operand 17 states. [2019-09-08 12:37:57,384 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:37:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:59,395 INFO L93 Difference]: Finished difference Result 1142 states and 1457 transitions. [2019-09-08 12:37:59,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:37:59,395 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:37:59,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:59,397 INFO L225 Difference]: With dead ends: 1142 [2019-09-08 12:37:59,397 INFO L226 Difference]: Without dead ends: 979 [2019-09-08 12:37:59,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:37:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-09-08 12:37:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 559. [2019-09-08 12:37:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-08 12:37:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 682 transitions. [2019-09-08 12:37:59,573 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 682 transitions. Word has length 103 [2019-09-08 12:37:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:59,574 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 682 transitions. [2019-09-08 12:37:59,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:37:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 682 transitions. [2019-09-08 12:37:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:37:59,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:59,575 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:59,576 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:59,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:59,576 INFO L82 PathProgramCache]: Analyzing trace with hash 407007842, now seen corresponding path program 1 times [2019-09-08 12:37:59,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:59,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:59,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:59,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:59,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:00,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:00,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:38:00,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:38:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:38:00,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:00,677 INFO L87 Difference]: Start difference. First operand 559 states and 682 transitions. Second operand 21 states. [2019-09-08 12:38:01,734 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 12:38:02,292 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-08 12:38:02,464 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 12:38:02,618 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 12:38:02,774 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 12:38:03,537 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 12:38:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:08,081 INFO L93 Difference]: Finished difference Result 1142 states and 1407 transitions. [2019-09-08 12:38:08,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:38:08,081 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2019-09-08 12:38:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:08,083 INFO L225 Difference]: With dead ends: 1142 [2019-09-08 12:38:08,083 INFO L226 Difference]: Without dead ends: 1061 [2019-09-08 12:38:08,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:38:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-09-08 12:38:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 563. [2019-09-08 12:38:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-08 12:38:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 686 transitions. [2019-09-08 12:38:08,267 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 686 transitions. Word has length 103 [2019-09-08 12:38:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:08,268 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 686 transitions. [2019-09-08 12:38:08,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:38:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 686 transitions. [2019-09-08 12:38:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:38:08,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:08,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:08,269 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:08,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:08,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1890101845, now seen corresponding path program 1 times [2019-09-08 12:38:08,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:08,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:08,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:08,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:08,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:08,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:08,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:38:08,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:38:08,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:38:08,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:38:08,805 INFO L87 Difference]: Start difference. First operand 563 states and 686 transitions. Second operand 13 states. [2019-09-08 12:38:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:11,378 INFO L93 Difference]: Finished difference Result 1647 states and 2188 transitions. [2019-09-08 12:38:11,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:38:11,378 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2019-09-08 12:38:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:11,380 INFO L225 Difference]: With dead ends: 1647 [2019-09-08 12:38:11,380 INFO L226 Difference]: Without dead ends: 1549 [2019-09-08 12:38:11,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:38:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2019-09-08 12:38:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 539. [2019-09-08 12:38:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-09-08 12:38:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 655 transitions. [2019-09-08 12:38:11,576 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 655 transitions. Word has length 103 [2019-09-08 12:38:11,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:11,576 INFO L475 AbstractCegarLoop]: Abstraction has 539 states and 655 transitions. [2019-09-08 12:38:11,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:38:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 655 transitions. [2019-09-08 12:38:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:38:11,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:11,577 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:11,578 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:11,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:11,578 INFO L82 PathProgramCache]: Analyzing trace with hash -333776786, now seen corresponding path program 1 times [2019-09-08 12:38:11,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:11,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:11,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:11,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:11,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:12,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:12,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:38:12,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:38:12,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:38:12,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:38:12,268 INFO L87 Difference]: Start difference. First operand 539 states and 655 transitions. Second operand 16 states. [2019-09-08 12:38:12,959 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:38:13,096 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:38:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:15,942 INFO L93 Difference]: Finished difference Result 919 states and 1133 transitions. [2019-09-08 12:38:15,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:38:15,943 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-08 12:38:15,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:15,944 INFO L225 Difference]: With dead ends: 919 [2019-09-08 12:38:15,945 INFO L226 Difference]: Without dead ends: 841 [2019-09-08 12:38:15,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:38:15,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-09-08 12:38:16,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 545. [2019-09-08 12:38:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-08 12:38:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 663 transitions. [2019-09-08 12:38:16,126 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 663 transitions. Word has length 103 [2019-09-08 12:38:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:16,127 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 663 transitions. [2019-09-08 12:38:16,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:38:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 663 transitions. [2019-09-08 12:38:16,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:38:16,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:16,128 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:16,128 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:16,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:16,128 INFO L82 PathProgramCache]: Analyzing trace with hash 791064172, now seen corresponding path program 1 times [2019-09-08 12:38:16,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:16,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:16,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:16,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:16,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:16,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:16,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:38:16,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:38:16,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:38:16,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:38:16,526 INFO L87 Difference]: Start difference. First operand 545 states and 663 transitions. Second operand 12 states. [2019-09-08 12:38:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:18,598 INFO L93 Difference]: Finished difference Result 1184 states and 1547 transitions. [2019-09-08 12:38:18,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:38:18,598 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2019-09-08 12:38:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:18,600 INFO L225 Difference]: With dead ends: 1184 [2019-09-08 12:38:18,600 INFO L226 Difference]: Without dead ends: 1090 [2019-09-08 12:38:18,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:38:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-09-08 12:38:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 502. [2019-09-08 12:38:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 12:38:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 611 transitions. [2019-09-08 12:38:18,775 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 611 transitions. Word has length 103 [2019-09-08 12:38:18,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:18,775 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 611 transitions. [2019-09-08 12:38:18,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:38:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 611 transitions. [2019-09-08 12:38:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:38:18,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:18,776 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:18,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1989632252, now seen corresponding path program 1 times [2019-09-08 12:38:18,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:18,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:18,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:18,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:18,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:19,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:19,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:38:19,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:38:19,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:38:19,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:38:19,383 INFO L87 Difference]: Start difference. First operand 502 states and 611 transitions. Second operand 15 states. [2019-09-08 12:38:19,929 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:38:20,054 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:38:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:22,067 INFO L93 Difference]: Finished difference Result 1155 states and 1497 transitions. [2019-09-08 12:38:22,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:38:22,067 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 103 [2019-09-08 12:38:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:22,069 INFO L225 Difference]: With dead ends: 1155 [2019-09-08 12:38:22,069 INFO L226 Difference]: Without dead ends: 956 [2019-09-08 12:38:22,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:38:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2019-09-08 12:38:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 442. [2019-09-08 12:38:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-08 12:38:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 538 transitions. [2019-09-08 12:38:22,232 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 538 transitions. Word has length 103 [2019-09-08 12:38:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:22,232 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 538 transitions. [2019-09-08 12:38:22,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:38:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 538 transitions. [2019-09-08 12:38:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:38:22,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:22,233 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:22,233 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:22,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:22,233 INFO L82 PathProgramCache]: Analyzing trace with hash -57079179, now seen corresponding path program 1 times [2019-09-08 12:38:22,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:22,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:22,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:22,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:22,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:22,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:22,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:38:22,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:38:22,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:38:22,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:38:22,571 INFO L87 Difference]: Start difference. First operand 442 states and 538 transitions. Second operand 10 states. [2019-09-08 12:38:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:23,744 INFO L93 Difference]: Finished difference Result 869 states and 1111 transitions. [2019-09-08 12:38:23,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:38:23,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-08 12:38:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:23,745 INFO L225 Difference]: With dead ends: 869 [2019-09-08 12:38:23,745 INFO L226 Difference]: Without dead ends: 672 [2019-09-08 12:38:23,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:38:23,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-08 12:38:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 319. [2019-09-08 12:38:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-08 12:38:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2019-09-08 12:38:23,877 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 103 [2019-09-08 12:38:23,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:23,877 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2019-09-08 12:38:23,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:38:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2019-09-08 12:38:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:38:23,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:23,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:23,878 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:23,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:23,878 INFO L82 PathProgramCache]: Analyzing trace with hash -444576202, now seen corresponding path program 1 times [2019-09-08 12:38:23,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:23,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:23,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:23,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:23,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:24,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:24,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:24,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:24,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:24,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:24,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:24,014 INFO L87 Difference]: Start difference. First operand 319 states and 384 transitions. Second operand 9 states. [2019-09-08 12:38:25,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:25,370 INFO L93 Difference]: Finished difference Result 619 states and 800 transitions. [2019-09-08 12:38:25,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:25,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:38:25,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:25,371 INFO L225 Difference]: With dead ends: 619 [2019-09-08 12:38:25,371 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 12:38:25,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:25,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 12:38:25,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 319. [2019-09-08 12:38:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-08 12:38:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 382 transitions. [2019-09-08 12:38:25,495 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 382 transitions. Word has length 104 [2019-09-08 12:38:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:25,495 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 382 transitions. [2019-09-08 12:38:25,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 382 transitions. [2019-09-08 12:38:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:38:25,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:25,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:25,496 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:25,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:25,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1911918420, now seen corresponding path program 1 times [2019-09-08 12:38:25,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:25,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:25,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:25,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:25,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:25,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:25,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:25,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:25,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:25,630 INFO L87 Difference]: Start difference. First operand 319 states and 382 transitions. Second operand 9 states. [2019-09-08 12:38:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:26,669 INFO L93 Difference]: Finished difference Result 469 states and 574 transitions. [2019-09-08 12:38:26,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:38:26,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:38:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:26,670 INFO L225 Difference]: With dead ends: 469 [2019-09-08 12:38:26,670 INFO L226 Difference]: Without dead ends: 462 [2019-09-08 12:38:26,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:38:26,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-08 12:38:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 319. [2019-09-08 12:38:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-08 12:38:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 380 transitions. [2019-09-08 12:38:26,797 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 380 transitions. Word has length 104 [2019-09-08 12:38:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:26,797 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 380 transitions. [2019-09-08 12:38:26,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 380 transitions. [2019-09-08 12:38:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:38:26,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:26,798 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:26,798 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:26,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:26,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1218168555, now seen corresponding path program 1 times [2019-09-08 12:38:26,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:26,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:26,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:26,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:26,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:27,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:27,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:38:27,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:38:27,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:38:27,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:38:27,339 INFO L87 Difference]: Start difference. First operand 319 states and 380 transitions. Second operand 13 states. [2019-09-08 12:38:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:28,665 INFO L93 Difference]: Finished difference Result 784 states and 1008 transitions. [2019-09-08 12:38:28,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:28,665 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2019-09-08 12:38:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:28,666 INFO L225 Difference]: With dead ends: 784 [2019-09-08 12:38:28,666 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 12:38:28,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:38:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 12:38:28,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 247. [2019-09-08 12:38:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-08 12:38:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 298 transitions. [2019-09-08 12:38:28,782 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 298 transitions. Word has length 104 [2019-09-08 12:38:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:28,783 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 298 transitions. [2019-09-08 12:38:28,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:38:28,783 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 298 transitions. [2019-09-08 12:38:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:38:28,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:28,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:28,784 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:28,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:28,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1690908129, now seen corresponding path program 1 times [2019-09-08 12:38:28,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:28,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:28,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:28,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:28,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:29,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:29,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:38:29,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:38:29,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:38:29,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:38:29,100 INFO L87 Difference]: Start difference. First operand 247 states and 298 transitions. Second operand 11 states. [2019-09-08 12:38:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:29,997 INFO L93 Difference]: Finished difference Result 642 states and 851 transitions. [2019-09-08 12:38:29,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:38:29,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-08 12:38:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:29,998 INFO L225 Difference]: With dead ends: 642 [2019-09-08 12:38:29,998 INFO L226 Difference]: Without dead ends: 524 [2019-09-08 12:38:29,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:38:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-09-08 12:38:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 192. [2019-09-08 12:38:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-08 12:38:30,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 235 transitions. [2019-09-08 12:38:30,094 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 235 transitions. Word has length 104 [2019-09-08 12:38:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:30,094 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 235 transitions. [2019-09-08 12:38:30,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:38:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 235 transitions. [2019-09-08 12:38:30,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:38:30,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:30,095 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:30,095 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:30,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:30,096 INFO L82 PathProgramCache]: Analyzing trace with hash -450268320, now seen corresponding path program 1 times [2019-09-08 12:38:30,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:30,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:30,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:30,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:30,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:31,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:31,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:38:31,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:38:31,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:38:31,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:38:31,105 INFO L87 Difference]: Start difference. First operand 192 states and 235 transitions. Second operand 21 states. [2019-09-08 12:38:32,039 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-08 12:38:32,247 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-08 12:38:32,413 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 12:38:32,576 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 12:38:33,456 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-08 12:38:35,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:35,924 INFO L93 Difference]: Finished difference Result 843 states and 1154 transitions. [2019-09-08 12:38:35,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:38:35,925 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-09-08 12:38:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:35,926 INFO L225 Difference]: With dead ends: 843 [2019-09-08 12:38:35,927 INFO L226 Difference]: Without dead ends: 837 [2019-09-08 12:38:35,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:38:35,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-09-08 12:38:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 221. [2019-09-08 12:38:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-08 12:38:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 270 transitions. [2019-09-08 12:38:36,038 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 270 transitions. Word has length 105 [2019-09-08 12:38:36,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:36,039 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 270 transitions. [2019-09-08 12:38:36,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:38:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 270 transitions. [2019-09-08 12:38:36,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:38:36,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:36,039 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:36,039 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:36,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1866671309, now seen corresponding path program 1 times [2019-09-08 12:38:36,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:36,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:36,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:36,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:36,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:38:36,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:38:36,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:38:36,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:38:36,723 INFO L87 Difference]: Start difference. First operand 221 states and 270 transitions. Second operand 16 states. [2019-09-08 12:38:37,410 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:38:37,541 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:38:37,668 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:38:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:39,485 INFO L93 Difference]: Finished difference Result 679 states and 920 transitions. [2019-09-08 12:38:39,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:38:39,485 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2019-09-08 12:38:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:39,486 INFO L225 Difference]: With dead ends: 679 [2019-09-08 12:38:39,486 INFO L226 Difference]: Without dead ends: 673 [2019-09-08 12:38:39,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:38:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-09-08 12:38:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 222. [2019-09-08 12:38:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-09-08 12:38:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 271 transitions. [2019-09-08 12:38:39,599 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 271 transitions. Word has length 106 [2019-09-08 12:38:39,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:39,600 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 271 transitions. [2019-09-08 12:38:39,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:38:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 271 transitions. [2019-09-08 12:38:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:38:39,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:39,600 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:39,600 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:39,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1064534923, now seen corresponding path program 1 times [2019-09-08 12:38:39,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:39,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:39,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:40,785 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-08 12:38:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:42,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:42,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-08 12:38:42,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 12:38:42,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 12:38:42,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:38:42,717 INFO L87 Difference]: Start difference. First operand 222 states and 271 transitions. Second operand 33 states. [2019-09-08 12:38:43,028 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2019-09-08 12:38:43,787 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-09-08 12:38:43,973 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-08 12:38:44,210 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-08 12:38:44,492 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-08 12:38:44,810 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-08 12:38:45,143 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-08 12:38:45,719 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2019-09-08 12:38:46,043 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2019-09-08 12:38:46,392 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2019-09-08 12:38:46,825 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 80 [2019-09-08 12:38:47,293 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 91 [2019-09-08 12:38:47,860 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 107 [2019-09-08 12:38:48,223 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2019-09-08 12:38:48,565 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2019-09-08 12:38:48,902 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 81 [2019-09-08 12:38:49,271 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2019-09-08 12:38:49,543 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-09-08 12:38:49,868 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2019-09-08 12:38:50,217 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-08 12:38:50,474 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-08 12:38:51,742 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-08 12:38:52,603 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-08 12:38:53,165 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 12:38:54,580 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-09-08 12:38:55,273 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 12:38:55,620 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-08 12:38:56,019 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-09-08 12:38:56,376 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-08 12:38:56,804 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2019-09-08 12:38:58,876 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2019-09-08 12:39:01,781 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-09-08 12:39:03,566 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2019-09-08 12:39:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:20,909 INFO L93 Difference]: Finished difference Result 2513 states and 3558 transitions. [2019-09-08 12:39:20,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 12:39:20,909 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 106 [2019-09-08 12:39:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:20,912 INFO L225 Difference]: With dead ends: 2513 [2019-09-08 12:39:20,912 INFO L226 Difference]: Without dead ends: 2507 [2019-09-08 12:39:20,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1017, Invalid=5303, Unknown=0, NotChecked=0, Total=6320 [2019-09-08 12:39:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2019-09-08 12:39:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 237. [2019-09-08 12:39:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-08 12:39:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 289 transitions. [2019-09-08 12:39:21,052 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 289 transitions. Word has length 106 [2019-09-08 12:39:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:21,052 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 289 transitions. [2019-09-08 12:39:21,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 12:39:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 289 transitions. [2019-09-08 12:39:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:39:21,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:21,053 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:21,053 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:21,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:21,054 INFO L82 PathProgramCache]: Analyzing trace with hash 311395281, now seen corresponding path program 1 times [2019-09-08 12:39:21,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:21,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:21,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:21,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:21,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:21,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:21,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:39:21,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:39:21,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:39:21,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:39:21,753 INFO L87 Difference]: Start difference. First operand 237 states and 289 transitions. Second operand 17 states. [2019-09-08 12:39:22,123 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-09-08 12:39:22,254 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-09-08 12:39:22,606 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-09-08 12:39:22,769 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-08 12:39:22,920 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:39:23,165 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:39:23,484 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-08 12:39:23,728 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-09-08 12:39:25,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:25,552 INFO L93 Difference]: Finished difference Result 756 states and 1035 transitions. [2019-09-08 12:39:25,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:39:25,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2019-09-08 12:39:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:25,554 INFO L225 Difference]: With dead ends: 756 [2019-09-08 12:39:25,554 INFO L226 Difference]: Without dead ends: 750 [2019-09-08 12:39:25,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:39:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-09-08 12:39:25,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 231. [2019-09-08 12:39:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-08 12:39:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 282 transitions. [2019-09-08 12:39:25,689 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 282 transitions. Word has length 107 [2019-09-08 12:39:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:25,689 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 282 transitions. [2019-09-08 12:39:25,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:39:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 282 transitions. [2019-09-08 12:39:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:39:25,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:25,690 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:25,690 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:25,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:25,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1144717407, now seen corresponding path program 1 times [2019-09-08 12:39:25,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:25,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:25,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:25,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:25,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:26,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:26,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:39:26,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:39:26,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:39:26,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:39:26,171 INFO L87 Difference]: Start difference. First operand 231 states and 282 transitions. Second operand 13 states. [2019-09-08 12:39:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:28,005 INFO L93 Difference]: Finished difference Result 634 states and 867 transitions. [2019-09-08 12:39:28,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:39:28,005 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 107 [2019-09-08 12:39:28,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:28,006 INFO L225 Difference]: With dead ends: 634 [2019-09-08 12:39:28,006 INFO L226 Difference]: Without dead ends: 628 [2019-09-08 12:39:28,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:39:28,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-09-08 12:39:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 186. [2019-09-08 12:39:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-08 12:39:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 229 transitions. [2019-09-08 12:39:28,125 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 229 transitions. Word has length 107 [2019-09-08 12:39:28,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:28,125 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 229 transitions. [2019-09-08 12:39:28,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:39:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 229 transitions. [2019-09-08 12:39:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:39:28,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:28,126 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:28,126 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:28,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:28,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1232495127, now seen corresponding path program 1 times [2019-09-08 12:39:28,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:28,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:28,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:28,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:28,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:28,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:28,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:39:28,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:39:28,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:39:28,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:39:28,199 INFO L87 Difference]: Start difference. First operand 186 states and 229 transitions. Second operand 3 states. [2019-09-08 12:39:28,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:28,434 INFO L93 Difference]: Finished difference Result 330 states and 441 transitions. [2019-09-08 12:39:28,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:39:28,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 12:39:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:28,435 INFO L225 Difference]: With dead ends: 330 [2019-09-08 12:39:28,435 INFO L226 Difference]: Without dead ends: 256 [2019-09-08 12:39:28,435 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-08 12:39:28,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-08 12:39:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2019-09-08 12:39:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-08 12:39:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 329 transitions. [2019-09-08 12:39:28,631 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 329 transitions. Word has length 136 [2019-09-08 12:39:28,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:28,631 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 329 transitions. [2019-09-08 12:39:28,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:39:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 329 transitions. [2019-09-08 12:39:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:39:28,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:28,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:28,632 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:28,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:28,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1599493294, now seen corresponding path program 1 times [2019-09-08 12:39:28,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:28,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:28,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:28,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:28,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:28,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:28,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:39:28,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:39:28,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:39:28,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:39:28,761 INFO L87 Difference]: Start difference. First operand 254 states and 329 transitions. Second operand 7 states. [2019-09-08 12:39:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:29,988 INFO L93 Difference]: Finished difference Result 834 states and 1181 transitions. [2019-09-08 12:39:29,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:39:29,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-08 12:39:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:29,989 INFO L225 Difference]: With dead ends: 834 [2019-09-08 12:39:29,990 INFO L226 Difference]: Without dead ends: 692 [2019-09-08 12:39:29,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:39:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-09-08 12:39:30,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 414. [2019-09-08 12:39:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-09-08 12:39:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 566 transitions. [2019-09-08 12:39:30,372 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 566 transitions. Word has length 138 [2019-09-08 12:39:30,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:30,372 INFO L475 AbstractCegarLoop]: Abstraction has 414 states and 566 transitions. [2019-09-08 12:39:30,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:39:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 566 transitions. [2019-09-08 12:39:30,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:39:30,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:30,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:30,374 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:30,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:30,374 INFO L82 PathProgramCache]: Analyzing trace with hash 948532047, now seen corresponding path program 1 times [2019-09-08 12:39:30,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:30,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:30,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:30,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:30,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:30,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:30,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:39:30,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:39:30,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:39:30,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:39:30,465 INFO L87 Difference]: Start difference. First operand 414 states and 566 transitions. Second operand 3 states. [2019-09-08 12:39:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:31,077 INFO L93 Difference]: Finished difference Result 872 states and 1244 transitions. [2019-09-08 12:39:31,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:39:31,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 12:39:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:31,078 INFO L225 Difference]: With dead ends: 872 [2019-09-08 12:39:31,079 INFO L226 Difference]: Without dead ends: 570 [2019-09-08 12:39:31,079 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-08 12:39:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-08 12:39:31,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-09-08 12:39:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-08 12:39:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 792 transitions. [2019-09-08 12:39:31,644 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 792 transitions. Word has length 138 [2019-09-08 12:39:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:31,644 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 792 transitions. [2019-09-08 12:39:31,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:39:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 792 transitions. [2019-09-08 12:39:31,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:39:31,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:31,645 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:31,645 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:31,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:31,645 INFO L82 PathProgramCache]: Analyzing trace with hash 882038535, now seen corresponding path program 1 times [2019-09-08 12:39:31,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:31,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:31,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:31,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:31,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:31,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:31,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:39:31,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:39:31,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:39:31,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:39:31,708 INFO L87 Difference]: Start difference. First operand 568 states and 792 transitions. Second operand 3 states. [2019-09-08 12:39:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:32,852 INFO L93 Difference]: Finished difference Result 1446 states and 2080 transitions. [2019-09-08 12:39:32,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:39:32,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 12:39:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:32,854 INFO L225 Difference]: With dead ends: 1446 [2019-09-08 12:39:32,854 INFO L226 Difference]: Without dead ends: 990 [2019-09-08 12:39:32,855 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-08 12:39:32,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-09-08 12:39:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 982. [2019-09-08 12:39:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-09-08 12:39:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1388 transitions. [2019-09-08 12:39:33,986 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1388 transitions. Word has length 138 [2019-09-08 12:39:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:33,986 INFO L475 AbstractCegarLoop]: Abstraction has 982 states and 1388 transitions. [2019-09-08 12:39:33,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:39:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1388 transitions. [2019-09-08 12:39:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:39:33,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:33,987 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:33,987 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:33,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:33,988 INFO L82 PathProgramCache]: Analyzing trace with hash -820324690, now seen corresponding path program 1 times [2019-09-08 12:39:33,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:33,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:33,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:33,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:33,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:34,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:34,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:39:34,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:39:34,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:39:34,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:39:34,084 INFO L87 Difference]: Start difference. First operand 982 states and 1388 transitions. Second operand 7 states. [2019-09-08 12:39:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:38,304 INFO L93 Difference]: Finished difference Result 3930 states and 5676 transitions. [2019-09-08 12:39:38,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:39:38,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-08 12:39:38,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:38,307 INFO L225 Difference]: With dead ends: 3930 [2019-09-08 12:39:38,307 INFO L226 Difference]: Without dead ends: 3060 [2019-09-08 12:39:38,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:39:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2019-09-08 12:39:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 1970. [2019-09-08 12:39:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2019-09-08 12:39:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2824 transitions. [2019-09-08 12:39:40,610 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2824 transitions. Word has length 138 [2019-09-08 12:39:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:40,610 INFO L475 AbstractCegarLoop]: Abstraction has 1970 states and 2824 transitions. [2019-09-08 12:39:40,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:39:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2824 transitions. [2019-09-08 12:39:40,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:39:40,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:40,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:40,612 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:40,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:40,612 INFO L82 PathProgramCache]: Analyzing trace with hash -456238930, now seen corresponding path program 1 times [2019-09-08 12:39:40,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:40,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:40,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:40,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:40,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:40,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:40,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:39:40,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:39:40,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:39:40,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:39:40,707 INFO L87 Difference]: Start difference. First operand 1970 states and 2824 transitions. Second operand 7 states. [2019-09-08 12:39:49,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:49,308 INFO L93 Difference]: Finished difference Result 8578 states and 12428 transitions. [2019-09-08 12:39:49,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:39:49,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-08 12:39:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:49,314 INFO L225 Difference]: With dead ends: 8578 [2019-09-08 12:39:49,314 INFO L226 Difference]: Without dead ends: 6720 [2019-09-08 12:39:49,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:39:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6720 states. [2019-09-08 12:39:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6720 to 4066. [2019-09-08 12:39:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2019-09-08 12:39:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 5864 transitions. [2019-09-08 12:39:54,026 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 5864 transitions. Word has length 138 [2019-09-08 12:39:54,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:54,026 INFO L475 AbstractCegarLoop]: Abstraction has 4066 states and 5864 transitions. [2019-09-08 12:39:54,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:39:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 5864 transitions. [2019-09-08 12:39:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:39:54,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:54,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:54,081 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:54,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:54,082 INFO L82 PathProgramCache]: Analyzing trace with hash 284220078, now seen corresponding path program 1 times [2019-09-08 12:39:54,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:54,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:54,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:54,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:54,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:54,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:54,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:39:54,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:39:54,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:39:54,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:39:54,180 INFO L87 Difference]: Start difference. First operand 4066 states and 5864 transitions. Second operand 7 states. [2019-09-08 12:40:12,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:12,259 INFO L93 Difference]: Finished difference Result 18714 states and 27132 transitions. [2019-09-08 12:40:12,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:40:12,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-08 12:40:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:12,273 INFO L225 Difference]: With dead ends: 18714 [2019-09-08 12:40:12,273 INFO L226 Difference]: Without dead ends: 14760 [2019-09-08 12:40:12,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:40:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14760 states. [2019-09-08 12:40:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14760 to 8498. [2019-09-08 12:40:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8498 states. [2019-09-08 12:40:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8498 states to 8498 states and 12280 transitions. [2019-09-08 12:40:22,282 INFO L78 Accepts]: Start accepts. Automaton has 8498 states and 12280 transitions. Word has length 138 [2019-09-08 12:40:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:22,282 INFO L475 AbstractCegarLoop]: Abstraction has 8498 states and 12280 transitions. [2019-09-08 12:40:22,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:40:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8498 states and 12280 transitions. [2019-09-08 12:40:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:40:22,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:22,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:22,284 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:22,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:22,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2080219986, now seen corresponding path program 1 times [2019-09-08 12:40:22,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:22,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:22,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:22,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:22,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:22,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:22,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:40:22,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:40:22,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:40:22,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:40:22,378 INFO L87 Difference]: Start difference. First operand 8498 states and 12280 transitions. Second operand 7 states. [2019-09-08 12:40:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:51,906 INFO L93 Difference]: Finished difference Result 33008 states and 47833 transitions. [2019-09-08 12:40:51,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:40:51,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-08 12:40:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:51,932 INFO L225 Difference]: With dead ends: 33008 [2019-09-08 12:40:51,933 INFO L226 Difference]: Without dead ends: 24622 [2019-09-08 12:40:51,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:40:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24622 states. [2019-09-08 12:41:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24622 to 13826. [2019-09-08 12:41:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13826 states. [2019-09-08 12:41:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13826 states to 13826 states and 19992 transitions. [2019-09-08 12:41:08,291 INFO L78 Accepts]: Start accepts. Automaton has 13826 states and 19992 transitions. Word has length 138 [2019-09-08 12:41:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:08,291 INFO L475 AbstractCegarLoop]: Abstraction has 13826 states and 19992 transitions. [2019-09-08 12:41:08,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:41:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 13826 states and 19992 transitions. [2019-09-08 12:41:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:41:08,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:08,293 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:08,294 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:08,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1106690548, now seen corresponding path program 1 times [2019-09-08 12:41:08,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:08,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:08,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:08,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:08,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:08,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:08,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:41:08,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:41:08,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:41:08,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:41:08,394 INFO L87 Difference]: Start difference. First operand 13826 states and 19992 transitions. Second operand 6 states. [2019-09-08 12:41:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:39,252 INFO L93 Difference]: Finished difference Result 24799 states and 35470 transitions. [2019-09-08 12:41:39,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:41:39,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-09-08 12:41:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:39,281 INFO L225 Difference]: With dead ends: 24799 [2019-09-08 12:41:39,281 INFO L226 Difference]: Without dead ends: 24797 [2019-09-08 12:41:39,288 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-08 12:41:39,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24797 states. [2019-09-08 12:41:55,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24797 to 14018. [2019-09-08 12:41:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14018 states. [2019-09-08 12:41:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14018 states to 14018 states and 20152 transitions. [2019-09-08 12:41:55,692 INFO L78 Accepts]: Start accepts. Automaton has 14018 states and 20152 transitions. Word has length 139 [2019-09-08 12:41:55,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:55,693 INFO L475 AbstractCegarLoop]: Abstraction has 14018 states and 20152 transitions. [2019-09-08 12:41:55,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:41:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 14018 states and 20152 transitions. [2019-09-08 12:41:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:41:55,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:55,695 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:55,695 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:55,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:55,695 INFO L82 PathProgramCache]: Analyzing trace with hash -475105807, now seen corresponding path program 1 times [2019-09-08 12:41:55,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:55,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:55,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:55,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:55,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:55,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:55,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:41:55,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:41:55,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:41:55,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:41:55,799 INFO L87 Difference]: Start difference. First operand 14018 states and 20152 transitions. Second operand 7 states. [2019-09-08 12:42:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:33,595 INFO L93 Difference]: Finished difference Result 43434 states and 62172 transitions. [2019-09-08 12:42:33,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:42:33,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-08 12:42:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:33,628 INFO L225 Difference]: With dead ends: 43434 [2019-09-08 12:42:33,629 INFO L226 Difference]: Without dead ends: 29528 [2019-09-08 12:42:33,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:42:33,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29528 states. [2019-09-08 12:42:53,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29528 to 16402. [2019-09-08 12:42:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16402 states. [2019-09-08 12:42:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16402 states to 16402 states and 23288 transitions. [2019-09-08 12:42:53,656 INFO L78 Accepts]: Start accepts. Automaton has 16402 states and 23288 transitions. Word has length 139 [2019-09-08 12:42:53,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:53,657 INFO L475 AbstractCegarLoop]: Abstraction has 16402 states and 23288 transitions. [2019-09-08 12:42:53,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:42:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 16402 states and 23288 transitions. [2019-09-08 12:42:53,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 12:42:53,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:53,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:53,659 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:53,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:53,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1327747304, now seen corresponding path program 1 times [2019-09-08 12:42:53,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:53,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:53,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:53,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:53,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:53,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:53,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:42:53,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:42:53,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:42:53,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:42:53,729 INFO L87 Difference]: Start difference. First operand 16402 states and 23288 transitions. Second operand 3 states. [2019-09-08 12:43:13,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:13,662 INFO L93 Difference]: Finished difference Result 31830 states and 45162 transitions. [2019-09-08 12:43:13,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:43:13,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-08 12:43:13,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:13,676 INFO L225 Difference]: With dead ends: 31830 [2019-09-08 12:43:13,677 INFO L226 Difference]: Without dead ends: 15540 [2019-09-08 12:43:13,687 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-08 12:43:13,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15540 states. [2019-09-08 12:43:29,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15540 to 11790. [2019-09-08 12:43:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11790 states. [2019-09-08 12:43:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11790 states to 11790 states and 16560 transitions. [2019-09-08 12:43:29,082 INFO L78 Accepts]: Start accepts. Automaton has 11790 states and 16560 transitions. Word has length 140 [2019-09-08 12:43:29,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:29,082 INFO L475 AbstractCegarLoop]: Abstraction has 11790 states and 16560 transitions. [2019-09-08 12:43:29,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:43:29,082 INFO L276 IsEmpty]: Start isEmpty. Operand 11790 states and 16560 transitions. [2019-09-08 12:43:29,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 12:43:29,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:29,083 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:29,084 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:29,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:29,084 INFO L82 PathProgramCache]: Analyzing trace with hash -896093248, now seen corresponding path program 1 times [2019-09-08 12:43:29,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:29,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:29,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:29,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:29,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:29,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:29,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:43:29,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:43:29,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:43:29,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:43:29,157 INFO L87 Difference]: Start difference. First operand 11790 states and 16560 transitions. Second operand 3 states. [2019-09-08 12:43:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:44,176 INFO L93 Difference]: Finished difference Result 22846 states and 32090 transitions. [2019-09-08 12:43:44,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:43:44,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-08 12:43:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:44,186 INFO L225 Difference]: With dead ends: 22846 [2019-09-08 12:43:44,186 INFO L226 Difference]: Without dead ends: 11168 [2019-09-08 12:43:44,196 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-08 12:43:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11168 states. [2019-09-08 12:43:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11168 to 10578. [2019-09-08 12:43:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10578 states. [2019-09-08 12:43:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10578 states to 10578 states and 14808 transitions. [2019-09-08 12:43:57,740 INFO L78 Accepts]: Start accepts. Automaton has 10578 states and 14808 transitions. Word has length 141 [2019-09-08 12:43:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:57,741 INFO L475 AbstractCegarLoop]: Abstraction has 10578 states and 14808 transitions. [2019-09-08 12:43:57,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:43:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 10578 states and 14808 transitions. [2019-09-08 12:43:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 12:43:57,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:57,744 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:57,744 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:57,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1324236212, now seen corresponding path program 1 times [2019-09-08 12:43:57,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:57,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:57,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:57,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:57,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:43:57,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:43:57,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:43:57,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:43:57,830 INFO L87 Difference]: Start difference. First operand 10578 states and 14808 transitions. Second operand 3 states. [2019-09-08 12:44:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:11,702 INFO L93 Difference]: Finished difference Result 20398 states and 28526 transitions. [2019-09-08 12:44:11,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:44:11,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 12:44:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:11,712 INFO L225 Difference]: With dead ends: 20398 [2019-09-08 12:44:11,712 INFO L226 Difference]: Without dead ends: 9932 [2019-09-08 12:44:11,720 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-08 12:44:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9932 states. [2019-09-08 12:44:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9932 to 7557. [2019-09-08 12:44:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7557 states. [2019-09-08 12:44:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7557 states to 7557 states and 10434 transitions. [2019-09-08 12:44:22,089 INFO L78 Accepts]: Start accepts. Automaton has 7557 states and 10434 transitions. Word has length 173 [2019-09-08 12:44:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:22,089 INFO L475 AbstractCegarLoop]: Abstraction has 7557 states and 10434 transitions. [2019-09-08 12:44:22,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 7557 states and 10434 transitions. [2019-09-08 12:44:22,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 12:44:22,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:22,091 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:22,092 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:22,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:22,092 INFO L82 PathProgramCache]: Analyzing trace with hash -527870386, now seen corresponding path program 1 times [2019-09-08 12:44:22,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:22,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:22,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:22,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:22,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 12:44:22,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:22,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:44:22,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:44:22,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:44:22,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:22,163 INFO L87 Difference]: Start difference. First operand 7557 states and 10434 transitions. Second operand 3 states. [2019-09-08 12:44:35,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:35,221 INFO L93 Difference]: Finished difference Result 16828 states and 23249 transitions. [2019-09-08 12:44:35,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:44:35,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 12:44:35,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:35,230 INFO L225 Difference]: With dead ends: 16828 [2019-09-08 12:44:35,230 INFO L226 Difference]: Without dead ends: 9383 [2019-09-08 12:44:35,236 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-08 12:44:35,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9383 states. [2019-09-08 12:44:47,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9383 to 9093. [2019-09-08 12:44:47,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9093 states. [2019-09-08 12:44:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9093 states to 9093 states and 12504 transitions. [2019-09-08 12:44:47,951 INFO L78 Accepts]: Start accepts. Automaton has 9093 states and 12504 transitions. Word has length 174 [2019-09-08 12:44:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:47,951 INFO L475 AbstractCegarLoop]: Abstraction has 9093 states and 12504 transitions. [2019-09-08 12:44:47,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 9093 states and 12504 transitions. [2019-09-08 12:44:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 12:44:47,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:47,954 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:47,954 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:47,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:47,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1451413664, now seen corresponding path program 1 times [2019-09-08 12:44:47,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:47,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:47,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:47,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:47,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:48,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:48,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:44:48,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:44:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:44:48,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:48,028 INFO L87 Difference]: Start difference. First operand 9093 states and 12504 transitions. Second operand 3 states. [2019-09-08 12:45:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:10,571 INFO L93 Difference]: Finished difference Result 24415 states and 33566 transitions. [2019-09-08 12:45:10,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:45:10,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 12:45:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:10,587 INFO L225 Difference]: With dead ends: 24415 [2019-09-08 12:45:10,587 INFO L226 Difference]: Without dead ends: 15434 [2019-09-08 12:45:10,594 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-08 12:45:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15434 states.