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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:38:12,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:38:12,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:38:12,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:38:12,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:38:12,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:38:12,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:38:12,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:38:12,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:38:12,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:38:12,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:38:12,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:38:12,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:38:12,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:38:12,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:38:12,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:38:12,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:38:12,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:38:12,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:38:12,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:38:12,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:38:12,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:38:12,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:38:12,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:38:12,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:38:12,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:38:12,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:38:12,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:38:12,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:38:12,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:38:12,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:38:12,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:38:12,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:38:12,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:38:12,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:38:12,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:38:12,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:38:12,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:38:12,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:38:12,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:38:12,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:38:12,540 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:38:12,566 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:38:12,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:38:12,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:38:12,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:38:12,568 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:38:12,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:38:12,569 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:38:12,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:38:12,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:38:12,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:38:12,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:38:12,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:38:12,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:38:12,571 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:38:12,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:38:12,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:38:12,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:38:12,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:38:12,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:38:12,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:38:12,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:38:12,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:38:12,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:38:12,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:38:12,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:38:12,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:38:12,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:38:12,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:38:12,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:38:12,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:38:12,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:38:12,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:38:12,630 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:38:12,631 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:38:12,631 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:38:12,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a4f4a34/86ef478fe9f74043961d206e62aa107b/FLAG86887288a [2019-09-08 12:38:13,430 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:38:13,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:38:13,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a4f4a34/86ef478fe9f74043961d206e62aa107b/FLAG86887288a [2019-09-08 12:38:13,519 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a4f4a34/86ef478fe9f74043961d206e62aa107b [2019-09-08 12:38:13,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:38:13,535 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:38:13,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:38:13,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:38:13,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:38:13,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:38:13" (1/1) ... [2019-09-08 12:38:13,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2cf39a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:38:13, skipping insertion in model container [2019-09-08 12:38:13,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:38:13" (1/1) ... [2019-09-08 12:38:13,552 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:38:13,788 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:38:15,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:38:15,824 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:38:16,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:38:16,989 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:38:16,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:38:16 WrapperNode [2019-09-08 12:38:16,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:38:16,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:38:16,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:38:16,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:38:17,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:38:16" (1/1) ... [2019-09-08 12:38:17,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:38:16" (1/1) ... [2019-09-08 12:38:17,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:38:16" (1/1) ... [2019-09-08 12:38:17,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:38:16" (1/1) ... [2019-09-08 12:38:17,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:38:16" (1/1) ... [2019-09-08 12:38:17,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:38:16" (1/1) ... [2019-09-08 12:38:17,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:38:16" (1/1) ... [2019-09-08 12:38:17,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:38:17,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:38:17,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:38:17,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:38:17,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:38:16" (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:38:17,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:38:17,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:38:17,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:38:17,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:38:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:38:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:38:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:38:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:38:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:38:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:38:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:38:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:38:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:38:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:38:17,393 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:38:17,394 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:38:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:38:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:38:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:38:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:38:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:38:17,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:38:17,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:38:23,895 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:38:23,895 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:38:23,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:38:23 BoogieIcfgContainer [2019-09-08 12:38:23,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:38:23,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:38:23,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:38:23,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:38:23,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:38:13" (1/3) ... [2019-09-08 12:38:23,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60163d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:38:23, skipping insertion in model container [2019-09-08 12:38:23,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:38:16" (2/3) ... [2019-09-08 12:38:23,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60163d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:38:23, skipping insertion in model container [2019-09-08 12:38:23,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:38:23" (3/3) ... [2019-09-08 12:38:23,910 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:38:23,920 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:38:23,942 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-09-08 12:38:23,958 INFO L252 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-09-08 12:38:24,002 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:38:24,002 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:38:24,002 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:38:24,002 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:38:24,003 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:38:24,003 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:38:24,003 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:38:24,003 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:38:24,003 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:38:24,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states. [2019-09-08 12:38:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:38:24,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:24,084 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,090 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:24,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1358263755, now seen corresponding path program 1 times [2019-09-08 12:38:24,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:24,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:24,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:24,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:24,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:25,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:38:25,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:25,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:38:25,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:38:25,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:38:25,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:38:25,065 INFO L87 Difference]: Start difference. First operand 2069 states. Second operand 5 states. [2019-09-08 12:38:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:27,855 INFO L93 Difference]: Finished difference Result 3647 states and 6423 transitions. [2019-09-08 12:38:27,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:38:27,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-08 12:38:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:27,888 INFO L225 Difference]: With dead ends: 3647 [2019-09-08 12:38:27,888 INFO L226 Difference]: Without dead ends: 2135 [2019-09-08 12:38:27,904 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:38:27,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2019-09-08 12:38:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 2033. [2019-09-08 12:38:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2019-09-08 12:38:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2753 transitions. [2019-09-08 12:38:28,137 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2753 transitions. Word has length 104 [2019-09-08 12:38:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:28,138 INFO L475 AbstractCegarLoop]: Abstraction has 2033 states and 2753 transitions. [2019-09-08 12:38:28,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:38:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2753 transitions. [2019-09-08 12:38:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:38:28,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:28,152 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,153 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:28,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:28,155 INFO L82 PathProgramCache]: Analyzing trace with hash 650628465, now seen corresponding path program 1 times [2019-09-08 12:38:28,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:28,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:28,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:28,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:28,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:28,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:38:28,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:28,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:38:28,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:38:28,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:38:28,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:38:28,515 INFO L87 Difference]: Start difference. First operand 2033 states and 2753 transitions. Second operand 5 states. [2019-09-08 12:38:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:29,895 INFO L93 Difference]: Finished difference Result 3497 states and 4874 transitions. [2019-09-08 12:38:29,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:38:29,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-08 12:38:29,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:29,908 INFO L225 Difference]: With dead ends: 3497 [2019-09-08 12:38:29,909 INFO L226 Difference]: Without dead ends: 1780 [2019-09-08 12:38:29,913 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:38:29,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2019-09-08 12:38:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1780. [2019-09-08 12:38:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2019-09-08 12:38:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2466 transitions. [2019-09-08 12:38:29,988 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2466 transitions. Word has length 105 [2019-09-08 12:38:29,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:29,990 INFO L475 AbstractCegarLoop]: Abstraction has 1780 states and 2466 transitions. [2019-09-08 12:38:29,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:38:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2466 transitions. [2019-09-08 12:38:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:38:30,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:30,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,008 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:30,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1348402675, now seen corresponding path program 1 times [2019-09-08 12:38:30,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:30,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:30,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:30,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:30,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:30,322 INFO 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:30,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:30,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:38:30,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:38:30,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:38:30,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:38:30,327 INFO L87 Difference]: Start difference. First operand 1780 states and 2466 transitions. Second operand 5 states. [2019-09-08 12:38:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:31,939 INFO L93 Difference]: Finished difference Result 3244 states and 4585 transitions. [2019-09-08 12:38:31,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:38:31,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-08 12:38:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:31,951 INFO L225 Difference]: With dead ends: 3244 [2019-09-08 12:38:31,951 INFO L226 Difference]: Without dead ends: 1700 [2019-09-08 12:38:31,955 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:38:31,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-09-08 12:38:32,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1700. [2019-09-08 12:38:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2019-09-08 12:38:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2368 transitions. [2019-09-08 12:38:32,021 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2368 transitions. Word has length 106 [2019-09-08 12:38:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:32,023 INFO L475 AbstractCegarLoop]: Abstraction has 1700 states and 2368 transitions. [2019-09-08 12:38:32,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:38:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2368 transitions. [2019-09-08 12:38:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:38:32,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:32,031 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,032 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:32,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:32,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1488492267, now seen corresponding path program 1 times [2019-09-08 12:38:32,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:32,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:32,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:32,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:32,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:32,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:32,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:38:32,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:38:32,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:38:32,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:38:32,256 INFO L87 Difference]: Start difference. First operand 1700 states and 2368 transitions. Second operand 5 states. [2019-09-08 12:38:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:33,318 INFO L93 Difference]: Finished difference Result 3164 states and 4485 transitions. [2019-09-08 12:38:33,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:38:33,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-08 12:38:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:33,327 INFO L225 Difference]: With dead ends: 3164 [2019-09-08 12:38:33,327 INFO L226 Difference]: Without dead ends: 1618 [2019-09-08 12:38:33,331 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:38:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2019-09-08 12:38:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2019-09-08 12:38:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-09-08 12:38:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2276 transitions. [2019-09-08 12:38:33,389 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2276 transitions. Word has length 107 [2019-09-08 12:38:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:33,389 INFO L475 AbstractCegarLoop]: Abstraction has 1618 states and 2276 transitions. [2019-09-08 12:38:33,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:38:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2276 transitions. [2019-09-08 12:38:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:38:33,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:33,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,395 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:33,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:33,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1732266651, now seen corresponding path program 1 times [2019-09-08 12:38:33,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:33,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:33,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:33,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:33,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:33,605 INFO 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:33,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:33,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:38:33,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:38:33,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:38:33,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:38:33,607 INFO L87 Difference]: Start difference. First operand 1618 states and 2276 transitions. Second operand 5 states. [2019-09-08 12:38:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:34,935 INFO L93 Difference]: Finished difference Result 3082 states and 4391 transitions. [2019-09-08 12:38:34,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:38:34,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-08 12:38:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:34,949 INFO L225 Difference]: With dead ends: 3082 [2019-09-08 12:38:34,950 INFO L226 Difference]: Without dead ends: 1580 [2019-09-08 12:38:34,955 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:38:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2019-09-08 12:38:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2019-09-08 12:38:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2019-09-08 12:38:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2232 transitions. [2019-09-08 12:38:35,048 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2232 transitions. Word has length 108 [2019-09-08 12:38:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:35,050 INFO L475 AbstractCegarLoop]: Abstraction has 1580 states and 2232 transitions. [2019-09-08 12:38:35,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:38:35,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2232 transitions. [2019-09-08 12:38:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:38:35,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:35,055 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,056 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:35,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:35,056 INFO L82 PathProgramCache]: Analyzing trace with hash -198575823, now seen corresponding path program 1 times [2019-09-08 12:38:35,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:35,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:35,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:35,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:35,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:35,255 INFO 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:35,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:35,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:38:35,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:38:35,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:38:35,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:38:35,256 INFO L87 Difference]: Start difference. First operand 1580 states and 2232 transitions. Second operand 5 states. [2019-09-08 12:38:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:36,334 INFO L93 Difference]: Finished difference Result 3044 states and 4345 transitions. [2019-09-08 12:38:36,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:38:36,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 12:38:36,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:36,342 INFO L225 Difference]: With dead ends: 3044 [2019-09-08 12:38:36,342 INFO L226 Difference]: Without dead ends: 1555 [2019-09-08 12:38:36,346 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:38:36,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-09-08 12:38:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1555. [2019-09-08 12:38:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2019-09-08 12:38:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2203 transitions. [2019-09-08 12:38:36,432 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2203 transitions. Word has length 109 [2019-09-08 12:38:36,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:36,434 INFO L475 AbstractCegarLoop]: Abstraction has 1555 states and 2203 transitions. [2019-09-08 12:38:36,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:38:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2203 transitions. [2019-09-08 12:38:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:38:36,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:36,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,449 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:36,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:36,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1099010427, now seen corresponding path program 1 times [2019-09-08 12:38:36,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:36,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:36,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:36,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:36,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:36,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:36,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:38:36,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:38:36,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:38:36,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:38:36,751 INFO L87 Difference]: Start difference. First operand 1555 states and 2203 transitions. Second operand 5 states. [2019-09-08 12:38:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:37,920 INFO L93 Difference]: Finished difference Result 3019 states and 4314 transitions. [2019-09-08 12:38:37,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:38:37,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-08 12:38:37,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:37,928 INFO L225 Difference]: With dead ends: 3019 [2019-09-08 12:38:37,929 INFO L226 Difference]: Without dead ends: 1547 [2019-09-08 12:38:37,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:38:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2019-09-08 12:38:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1547. [2019-09-08 12:38:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:38:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2192 transitions. [2019-09-08 12:38:37,996 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2192 transitions. Word has length 110 [2019-09-08 12:38:37,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:37,997 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2192 transitions. [2019-09-08 12:38:37,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:38:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2192 transitions. [2019-09-08 12:38:38,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:38:38,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:38,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,002 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:38,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1196639721, now seen corresponding path program 1 times [2019-09-08 12:38:38,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:38,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:38,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:38,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:38,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:38,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:38:38,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:38,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:38:38,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:38:38,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:38:38,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:38:38,306 INFO L87 Difference]: Start difference. First operand 1547 states and 2192 transitions. Second operand 8 states. [2019-09-08 12:38:40,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:40,895 INFO L93 Difference]: Finished difference Result 2666 states and 3652 transitions. [2019-09-08 12:38:40,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:38:40,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2019-09-08 12:38:40,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:40,905 INFO L225 Difference]: With dead ends: 2666 [2019-09-08 12:38:40,905 INFO L226 Difference]: Without dead ends: 2006 [2019-09-08 12:38:40,907 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:38:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-09-08 12:38:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1547. [2019-09-08 12:38:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:38:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2191 transitions. [2019-09-08 12:38:40,984 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2191 transitions. Word has length 111 [2019-09-08 12:38:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:40,985 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2191 transitions. [2019-09-08 12:38:40,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:38:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2191 transitions. [2019-09-08 12:38:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:38:40,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:40,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:40,994 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash -437132848, now seen corresponding path program 1 times [2019-09-08 12:38:40,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:40,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:40,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:40,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:40,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:41,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:41,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:41,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:41,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:41,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:41,338 INFO L87 Difference]: Start difference. First operand 1547 states and 2191 transitions. Second operand 9 states. [2019-09-08 12:38:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:44,362 INFO L93 Difference]: Finished difference Result 2358 states and 3387 transitions. [2019-09-08 12:38:44,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:38:44,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-08 12:38:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:44,372 INFO L225 Difference]: With dead ends: 2358 [2019-09-08 12:38:44,373 INFO L226 Difference]: Without dead ends: 1974 [2019-09-08 12:38:44,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:38:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-09-08 12:38:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1547. [2019-09-08 12:38:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:38:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2190 transitions. [2019-09-08 12:38:44,456 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2190 transitions. Word has length 111 [2019-09-08 12:38:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:44,456 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2190 transitions. [2019-09-08 12:38:44,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2190 transitions. [2019-09-08 12:38:44,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:38:44,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:44,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,461 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:44,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:44,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2043481244, now seen corresponding path program 1 times [2019-09-08 12:38:44,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:44,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:44,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:44,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:44,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:44,727 INFO 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:44,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:44,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:44,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:44,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:44,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:44,729 INFO L87 Difference]: Start difference. First operand 1547 states and 2190 transitions. Second operand 9 states. [2019-09-08 12:38:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:48,277 INFO L93 Difference]: Finished difference Result 2570 states and 3602 transitions. [2019-09-08 12:38:48,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:48,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-08 12:38:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:48,288 INFO L225 Difference]: With dead ends: 2570 [2019-09-08 12:38:48,288 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:38:48,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:38:48,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:38:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:38:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:38:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2189 transitions. [2019-09-08 12:38:48,386 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2189 transitions. Word has length 111 [2019-09-08 12:38:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:48,386 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2189 transitions. [2019-09-08 12:38:48,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2189 transitions. [2019-09-08 12:38:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:38:48,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:48,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:48,391 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash -447248493, now seen corresponding path program 1 times [2019-09-08 12:38:48,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:48,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:48,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:48,642 INFO 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:48,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:48,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:48,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:48,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:48,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:48,644 INFO L87 Difference]: Start difference. First operand 1547 states and 2189 transitions. Second operand 9 states. [2019-09-08 12:38:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:52,187 INFO L93 Difference]: Finished difference Result 2736 states and 3851 transitions. [2019-09-08 12:38:52,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:52,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-08 12:38:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:52,199 INFO L225 Difference]: With dead ends: 2736 [2019-09-08 12:38:52,200 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:38:52,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:38:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:38:52,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:38:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:38:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2188 transitions. [2019-09-08 12:38:52,344 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2188 transitions. Word has length 113 [2019-09-08 12:38:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:52,344 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2188 transitions. [2019-09-08 12:38:52,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2188 transitions. [2019-09-08 12:38:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:38:52,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:52,349 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,349 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:52,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:52,349 INFO L82 PathProgramCache]: Analyzing trace with hash 809613266, now seen corresponding path program 1 times [2019-09-08 12:38:52,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:52,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:52,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:52,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:52,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:52,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:52,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:52,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:52,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:52,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:52,590 INFO L87 Difference]: Start difference. First operand 1547 states and 2188 transitions. Second operand 9 states. [2019-09-08 12:38:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:56,626 INFO L93 Difference]: Finished difference Result 3042 states and 4345 transitions. [2019-09-08 12:38:56,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:38:56,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-08 12:38:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:56,638 INFO L225 Difference]: With dead ends: 3042 [2019-09-08 12:38:56,638 INFO L226 Difference]: Without dead ends: 2758 [2019-09-08 12:38:56,639 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:38:56,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2019-09-08 12:38:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 1547. [2019-09-08 12:38:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:38:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2187 transitions. [2019-09-08 12:38:56,785 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2187 transitions. Word has length 113 [2019-09-08 12:38:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:56,785 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2187 transitions. [2019-09-08 12:38:56,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:38:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2187 transitions. [2019-09-08 12:38:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:38:56,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:56,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:56,790 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:56,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:56,790 INFO L82 PathProgramCache]: Analyzing trace with hash -953510862, now seen corresponding path program 1 times [2019-09-08 12:38:56,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:56,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:56,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:56,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:56,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:57,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:57,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:38:57,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:38:57,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:38:57,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:38:57,056 INFO L87 Difference]: Start difference. First operand 1547 states and 2187 transitions. Second operand 9 states. [2019-09-08 12:39:00,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:00,545 INFO L93 Difference]: Finished difference Result 2733 states and 3845 transitions. [2019-09-08 12:39:00,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:00,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-08 12:39:00,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:00,559 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 12:39:00,559 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:39:00,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:39:00,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:39:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2186 transitions. [2019-09-08 12:39:00,677 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2186 transitions. Word has length 113 [2019-09-08 12:39:00,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:00,677 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2186 transitions. [2019-09-08 12:39:00,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2186 transitions. [2019-09-08 12:39:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:39:00,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:00,681 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,682 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:00,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:00,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1335436329, now seen corresponding path program 1 times [2019-09-08 12:39:00,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:00,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:00,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:00,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:00,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:00,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:00,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:00,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:00,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:00,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:00,968 INFO L87 Difference]: Start difference. First operand 1547 states and 2186 transitions. Second operand 9 states. [2019-09-08 12:39:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:04,434 INFO L93 Difference]: Finished difference Result 2733 states and 3843 transitions. [2019-09-08 12:39:04,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:04,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-08 12:39:04,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:04,443 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 12:39:04,443 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:39:04,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:39:04,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:39:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2185 transitions. [2019-09-08 12:39:04,562 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2185 transitions. Word has length 113 [2019-09-08 12:39:04,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:04,563 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2185 transitions. [2019-09-08 12:39:04,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2185 transitions. [2019-09-08 12:39:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:39:04,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:04,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,567 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:04,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:04,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1339422240, now seen corresponding path program 1 times [2019-09-08 12:39:04,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:04,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:04,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:04,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:04,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:04,822 INFO 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:04,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:04,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:04,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:04,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:04,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:04,824 INFO L87 Difference]: Start difference. First operand 1547 states and 2185 transitions. Second operand 9 states. [2019-09-08 12:39:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:08,918 INFO L93 Difference]: Finished difference Result 3019 states and 4316 transitions. [2019-09-08 12:39:08,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:08,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-08 12:39:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:08,926 INFO L225 Difference]: With dead ends: 3019 [2019-09-08 12:39:08,926 INFO L226 Difference]: Without dead ends: 2758 [2019-09-08 12:39:08,927 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:39:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2019-09-08 12:39:09,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 1547. [2019-09-08 12:39:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:09,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2184 transitions. [2019-09-08 12:39:09,022 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2184 transitions. Word has length 113 [2019-09-08 12:39:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:09,023 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2184 transitions. [2019-09-08 12:39:09,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:09,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2184 transitions. [2019-09-08 12:39:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:39:09,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:09,026 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:09,026 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:09,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:09,027 INFO L82 PathProgramCache]: Analyzing trace with hash 229550188, now seen corresponding path program 1 times [2019-09-08 12:39:09,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:09,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:09,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:09,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:09,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:09,255 INFO 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:09,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:09,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:09,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:09,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:09,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:09,257 INFO L87 Difference]: Start difference. First operand 1547 states and 2184 transitions. Second operand 9 states. [2019-09-08 12:39:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:13,102 INFO L93 Difference]: Finished difference Result 2984 states and 4258 transitions. [2019-09-08 12:39:13,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:13,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-08 12:39:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:13,111 INFO L225 Difference]: With dead ends: 2984 [2019-09-08 12:39:13,111 INFO L226 Difference]: Without dead ends: 2726 [2019-09-08 12:39:13,113 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:39:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-08 12:39:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-08 12:39:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2182 transitions. [2019-09-08 12:39:13,260 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2182 transitions. Word has length 113 [2019-09-08 12:39:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:13,260 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2182 transitions. [2019-09-08 12:39:13,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:13,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2182 transitions. [2019-09-08 12:39:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:39:13,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:13,265 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:13,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:13,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1586710105, now seen corresponding path program 1 times [2019-09-08 12:39:13,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:13,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:13,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:13,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:13,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:13,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:13,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:13,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:13,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:13,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:13,503 INFO L87 Difference]: Start difference. First operand 1547 states and 2182 transitions. Second operand 9 states. [2019-09-08 12:39:17,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:17,034 INFO L93 Difference]: Finished difference Result 2990 states and 4256 transitions. [2019-09-08 12:39:17,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:17,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-08 12:39:17,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:17,040 INFO L225 Difference]: With dead ends: 2990 [2019-09-08 12:39:17,040 INFO L226 Difference]: Without dead ends: 2726 [2019-09-08 12:39:17,041 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:39:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-08 12:39:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-08 12:39:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2180 transitions. [2019-09-08 12:39:17,186 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2180 transitions. Word has length 113 [2019-09-08 12:39:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:17,187 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2180 transitions. [2019-09-08 12:39:17,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2180 transitions. [2019-09-08 12:39:17,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:39:17,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:17,190 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:17,191 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:17,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:17,191 INFO L82 PathProgramCache]: Analyzing trace with hash 321088677, now seen corresponding path program 1 times [2019-09-08 12:39:17,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:17,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:17,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:17,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:17,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:17,454 INFO 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:17,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:17,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:17,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:17,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:17,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:17,456 INFO L87 Difference]: Start difference. First operand 1547 states and 2180 transitions. Second operand 9 states. [2019-09-08 12:39:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:20,910 INFO L93 Difference]: Finished difference Result 2570 states and 3588 transitions. [2019-09-08 12:39:20,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:20,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-08 12:39:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:20,916 INFO L225 Difference]: With dead ends: 2570 [2019-09-08 12:39:20,916 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:39:20,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:39:21,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:39:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2178 transitions. [2019-09-08 12:39:21,056 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2178 transitions. Word has length 113 [2019-09-08 12:39:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:21,057 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2178 transitions. [2019-09-08 12:39:21,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2178 transitions. [2019-09-08 12:39:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:39:21,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:21,060 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,061 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:21,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:21,061 INFO L82 PathProgramCache]: Analyzing trace with hash 420243049, now seen corresponding path program 1 times [2019-09-08 12:39:21,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:21,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:21,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:21,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:21,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:21,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:39:21,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:21,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:21,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:21,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:21,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:21,330 INFO L87 Difference]: Start difference. First operand 1547 states and 2178 transitions. Second operand 9 states. [2019-09-08 12:39:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:24,752 INFO L93 Difference]: Finished difference Result 2624 states and 3739 transitions. [2019-09-08 12:39:24,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:39:24,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-09-08 12:39:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:24,755 INFO L225 Difference]: With dead ends: 2624 [2019-09-08 12:39:24,755 INFO L226 Difference]: Without dead ends: 1974 [2019-09-08 12:39:24,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:39:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-09-08 12:39:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1547. [2019-09-08 12:39:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2176 transitions. [2019-09-08 12:39:24,888 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2176 transitions. Word has length 113 [2019-09-08 12:39:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:24,888 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2176 transitions. [2019-09-08 12:39:24,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2176 transitions. [2019-09-08 12:39:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:39:24,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:24,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,892 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:24,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1012137094, now seen corresponding path program 1 times [2019-09-08 12:39:24,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:24,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:24,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:24,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:24,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:25,119 INFO 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:25,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:25,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:25,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:25,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:25,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:25,120 INFO L87 Difference]: Start difference. First operand 1547 states and 2176 transitions. Second operand 9 states. [2019-09-08 12:39:28,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:28,646 INFO L93 Difference]: Finished difference Result 2733 states and 3830 transitions. [2019-09-08 12:39:28,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:28,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:39:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:28,653 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 12:39:28,653 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:39:28,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:28,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:39:28,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:39:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2175 transitions. [2019-09-08 12:39:28,762 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2175 transitions. Word has length 115 [2019-09-08 12:39:28,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:28,763 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2175 transitions. [2019-09-08 12:39:28,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2175 transitions. [2019-09-08 12:39:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:39:28,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:28,766 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,766 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:28,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:28,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1284556713, now seen corresponding path program 1 times [2019-09-08 12:39:28,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:28,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:28,987 INFO 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,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:28,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:28,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:28,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:28,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:28,988 INFO L87 Difference]: Start difference. First operand 1547 states and 2175 transitions. Second operand 9 states. [2019-09-08 12:39:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:33,094 INFO L93 Difference]: Finished difference Result 2941 states and 4180 transitions. [2019-09-08 12:39:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:33,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:39:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:33,098 INFO L225 Difference]: With dead ends: 2941 [2019-09-08 12:39:33,098 INFO L226 Difference]: Without dead ends: 2726 [2019-09-08 12:39:33,099 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:39:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-08 12:39:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-08 12:39:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2174 transitions. [2019-09-08 12:39:33,274 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2174 transitions. Word has length 115 [2019-09-08 12:39:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:33,275 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2174 transitions. [2019-09-08 12:39:33,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2174 transitions. [2019-09-08 12:39:33,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:39:33,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:33,279 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:33,279 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:33,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:33,279 INFO L82 PathProgramCache]: Analyzing trace with hash -149086171, now seen corresponding path program 1 times [2019-09-08 12:39:33,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:33,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:33,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:33,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:33,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:33,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:33,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:33,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:33,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:33,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:33,480 INFO L87 Difference]: Start difference. First operand 1547 states and 2174 transitions. Second operand 9 states. [2019-09-08 12:39:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:36,955 INFO L93 Difference]: Finished difference Result 2733 states and 3828 transitions. [2019-09-08 12:39:36,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:36,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:39:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:36,960 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 12:39:36,960 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:39:36,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:36,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:39:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:39:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2173 transitions. [2019-09-08 12:39:37,110 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2173 transitions. Word has length 115 [2019-09-08 12:39:37,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:37,111 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2173 transitions. [2019-09-08 12:39:37,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:37,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2173 transitions. [2019-09-08 12:39:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:39:37,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:37,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:37,115 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:37,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:37,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1810790601, now seen corresponding path program 1 times [2019-09-08 12:39:37,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:37,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:37,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:37,355 INFO 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:37,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:37,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:37,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:37,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:37,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:37,357 INFO L87 Difference]: Start difference. First operand 1547 states and 2173 transitions. Second operand 9 states. [2019-09-08 12:39:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:41,431 INFO L93 Difference]: Finished difference Result 2956 states and 4194 transitions. [2019-09-08 12:39:41,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:41,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:39:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:41,435 INFO L225 Difference]: With dead ends: 2956 [2019-09-08 12:39:41,435 INFO L226 Difference]: Without dead ends: 2726 [2019-09-08 12:39:41,436 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:39:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-08 12:39:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-08 12:39:41,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2172 transitions. [2019-09-08 12:39:41,583 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2172 transitions. Word has length 115 [2019-09-08 12:39:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:41,583 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2172 transitions. [2019-09-08 12:39:41,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:41,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2172 transitions. [2019-09-08 12:39:41,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:39:41,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:41,587 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:41,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:41,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2133543625, now seen corresponding path program 1 times [2019-09-08 12:39:41,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:41,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:41,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:41,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:41,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:41,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:41,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:41,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:41,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:41,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:41,797 INFO L87 Difference]: Start difference. First operand 1547 states and 2172 transitions. Second operand 9 states. [2019-09-08 12:39:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:45,325 INFO L93 Difference]: Finished difference Result 2736 states and 3828 transitions. [2019-09-08 12:39:45,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:45,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:39:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:45,329 INFO L225 Difference]: With dead ends: 2736 [2019-09-08 12:39:45,329 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:39:45,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:39:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:39:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2171 transitions. [2019-09-08 12:39:45,433 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2171 transitions. Word has length 115 [2019-09-08 12:39:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:45,433 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2171 transitions. [2019-09-08 12:39:45,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2171 transitions. [2019-09-08 12:39:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:39:45,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:45,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:45,436 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:45,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:45,436 INFO L82 PathProgramCache]: Analyzing trace with hash 874892072, now seen corresponding path program 1 times [2019-09-08 12:39:45,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:45,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:45,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:45,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:45,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:45,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:39:45,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:45,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:45,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:45,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:45,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:45,660 INFO L87 Difference]: Start difference. First operand 1547 states and 2171 transitions. Second operand 9 states. [2019-09-08 12:39:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:49,899 INFO L93 Difference]: Finished difference Result 2941 states and 4174 transitions. [2019-09-08 12:39:49,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:49,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:39:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:49,904 INFO L225 Difference]: With dead ends: 2941 [2019-09-08 12:39:49,904 INFO L226 Difference]: Without dead ends: 2726 [2019-09-08 12:39:49,905 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:39:49,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-08 12:39:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-08 12:39:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2170 transitions. [2019-09-08 12:39:50,012 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2170 transitions. Word has length 115 [2019-09-08 12:39:50,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:50,012 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2170 transitions. [2019-09-08 12:39:50,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2170 transitions. [2019-09-08 12:39:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:39:50,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:50,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:50,014 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:50,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:50,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1600689728, now seen corresponding path program 1 times [2019-09-08 12:39:50,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:50,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:50,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:50,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:50,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:50,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:50,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:50,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:50,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:50,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:50,227 INFO L87 Difference]: Start difference. First operand 1547 states and 2170 transitions. Second operand 9 states. [2019-09-08 12:39:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:53,769 INFO L93 Difference]: Finished difference Result 2731 states and 3820 transitions. [2019-09-08 12:39:53,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:53,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:39:53,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:53,773 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:39:53,773 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:39:53,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:39:53,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:39:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2169 transitions. [2019-09-08 12:39:53,892 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2169 transitions. Word has length 115 [2019-09-08 12:39:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:53,892 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2169 transitions. [2019-09-08 12:39:53,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:53,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2169 transitions. [2019-09-08 12:39:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:39:53,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:53,895 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:53,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:53,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1701183782, now seen corresponding path program 1 times [2019-09-08 12:39:53,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:53,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:53,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:54,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:54,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:54,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:54,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:54,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:54,117 INFO L87 Difference]: Start difference. First operand 1547 states and 2169 transitions. Second operand 9 states. [2019-09-08 12:39:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:57,664 INFO L93 Difference]: Finished difference Result 2731 states and 3818 transitions. [2019-09-08 12:39:57,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:39:57,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:39:57,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:57,667 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:39:57,667 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:39:57,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:39:57,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:39:57,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:39:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:39:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2168 transitions. [2019-09-08 12:39:57,776 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2168 transitions. Word has length 115 [2019-09-08 12:39:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:57,776 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2168 transitions. [2019-09-08 12:39:57,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:39:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2168 transitions. [2019-09-08 12:39:57,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:39:57,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:57,778 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,779 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:57,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:57,779 INFO L82 PathProgramCache]: Analyzing trace with hash 62320473, now seen corresponding path program 1 times [2019-09-08 12:39:57,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:57,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:57,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:57,988 INFO 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:57,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:57,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:39:57,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:39:57,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:39:57,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:39:57,990 INFO L87 Difference]: Start difference. First operand 1547 states and 2168 transitions. Second operand 9 states. [2019-09-08 12:40:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:01,489 INFO L93 Difference]: Finished difference Result 2731 states and 3816 transitions. [2019-09-08 12:40:01,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:01,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:40:01,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:01,493 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:40:01,494 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:40:01,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:40:01,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:40:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:01,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2167 transitions. [2019-09-08 12:40:01,613 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2167 transitions. Word has length 115 [2019-09-08 12:40:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:01,613 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2167 transitions. [2019-09-08 12:40:01,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2167 transitions. [2019-09-08 12:40:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:40:01,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:01,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:01,616 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:01,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:01,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1599031812, now seen corresponding path program 1 times [2019-09-08 12:40:01,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:01,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:01,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:01,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:01,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:01,905 INFO 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:01,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:01,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:01,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:01,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:01,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:01,907 INFO L87 Difference]: Start difference. First operand 1547 states and 2167 transitions. Second operand 9 states. [2019-09-08 12:40:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:06,010 INFO L93 Difference]: Finished difference Result 2933 states and 4160 transitions. [2019-09-08 12:40:06,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:06,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:40:06,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:06,014 INFO L225 Difference]: With dead ends: 2933 [2019-09-08 12:40:06,014 INFO L226 Difference]: Without dead ends: 2726 [2019-09-08 12:40:06,015 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:40:06,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-08 12:40:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-08 12:40:06,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2166 transitions. [2019-09-08 12:40:06,131 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2166 transitions. Word has length 115 [2019-09-08 12:40:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:06,131 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2166 transitions. [2019-09-08 12:40:06,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2166 transitions. [2019-09-08 12:40:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:40:06,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:06,133 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,134 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:06,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:06,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1905590914, now seen corresponding path program 1 times [2019-09-08 12:40:06,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:06,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:06,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:06,406 INFO 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:06,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:06,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:06,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:06,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:06,408 INFO L87 Difference]: Start difference. First operand 1547 states and 2166 transitions. Second operand 9 states. [2019-09-08 12:40:10,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:10,019 INFO L93 Difference]: Finished difference Result 2735 states and 3818 transitions. [2019-09-08 12:40:10,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:10,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:40:10,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:10,023 INFO L225 Difference]: With dead ends: 2735 [2019-09-08 12:40:10,023 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:40:10,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:40:10,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:40:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2164 transitions. [2019-09-08 12:40:10,156 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2164 transitions. Word has length 115 [2019-09-08 12:40:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:10,157 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2164 transitions. [2019-09-08 12:40:10,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2164 transitions. [2019-09-08 12:40:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:40:10,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:10,159 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,159 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:10,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:10,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1215030672, now seen corresponding path program 1 times [2019-09-08 12:40:10,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:10,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:10,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:10,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:10,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:10,422 INFO 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:10,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:10,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:10,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:10,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:10,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:10,424 INFO L87 Difference]: Start difference. First operand 1547 states and 2164 transitions. Second operand 9 states. [2019-09-08 12:40:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:14,116 INFO L93 Difference]: Finished difference Result 2570 states and 3564 transitions. [2019-09-08 12:40:14,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:14,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:40:14,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:14,119 INFO L225 Difference]: With dead ends: 2570 [2019-09-08 12:40:14,119 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:40:14,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:40:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:40:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2162 transitions. [2019-09-08 12:40:14,244 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2162 transitions. Word has length 115 [2019-09-08 12:40:14,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:14,244 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2162 transitions. [2019-09-08 12:40:14,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:14,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2162 transitions. [2019-09-08 12:40:14,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:40:14,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:14,247 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,247 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:14,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:14,247 INFO L82 PathProgramCache]: Analyzing trace with hash -316052418, now seen corresponding path program 1 times [2019-09-08 12:40:14,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:14,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:14,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:14,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:14,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:14,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:14,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:14,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:14,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:14,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:14,516 INFO L87 Difference]: Start difference. First operand 1547 states and 2162 transitions. Second operand 9 states. [2019-09-08 12:40:19,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:19,100 INFO L93 Difference]: Finished difference Result 3124 states and 4429 transitions. [2019-09-08 12:40:19,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:19,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:40:19,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:19,104 INFO L225 Difference]: With dead ends: 3124 [2019-09-08 12:40:19,104 INFO L226 Difference]: Without dead ends: 2758 [2019-09-08 12:40:19,106 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:40:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2019-09-08 12:40:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 1547. [2019-09-08 12:40:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2160 transitions. [2019-09-08 12:40:19,275 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2160 transitions. Word has length 115 [2019-09-08 12:40:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:19,275 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2160 transitions. [2019-09-08 12:40:19,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2160 transitions. [2019-09-08 12:40:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:40:19,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:19,277 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:19,277 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1557600535, now seen corresponding path program 1 times [2019-09-08 12:40:19,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:19,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:19,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:19,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:19,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:19,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:19,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:19,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:19,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:19,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:19,455 INFO L87 Difference]: Start difference. First operand 1547 states and 2160 transitions. Second operand 9 states. [2019-09-08 12:40:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:23,628 INFO L93 Difference]: Finished difference Result 3006 states and 4252 transitions. [2019-09-08 12:40:23,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:23,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:40:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:23,632 INFO L225 Difference]: With dead ends: 3006 [2019-09-08 12:40:23,632 INFO L226 Difference]: Without dead ends: 2726 [2019-09-08 12:40:23,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:40:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-08 12:40:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-08 12:40:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2158 transitions. [2019-09-08 12:40:23,761 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2158 transitions. Word has length 115 [2019-09-08 12:40:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:23,761 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2158 transitions. [2019-09-08 12:40:23,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2158 transitions. [2019-09-08 12:40:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:40:23,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:23,764 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:23,764 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1206967465, now seen corresponding path program 1 times [2019-09-08 12:40:23,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:23,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:23,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:23,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:23,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:23,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:23,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:23,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:23,951 INFO L87 Difference]: Start difference. First operand 1547 states and 2158 transitions. Second operand 9 states. [2019-09-08 12:40:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:27,494 INFO L93 Difference]: Finished difference Result 2739 states and 3811 transitions. [2019-09-08 12:40:27,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:27,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:40:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:27,498 INFO L225 Difference]: With dead ends: 2739 [2019-09-08 12:40:27,498 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:40:27,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:27,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:40:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:40:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2156 transitions. [2019-09-08 12:40:27,642 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2156 transitions. Word has length 115 [2019-09-08 12:40:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:27,643 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2156 transitions. [2019-09-08 12:40:27,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2156 transitions. [2019-09-08 12:40:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:40:27,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:27,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] [2019-09-08 12:40:27,645 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:27,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:27,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1510493384, now seen corresponding path program 1 times [2019-09-08 12:40:27,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:27,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:27,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:27,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:27,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:27,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:27,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:27,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:27,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:27,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:27,841 INFO L87 Difference]: Start difference. First operand 1547 states and 2156 transitions. Second operand 9 states. [2019-09-08 12:40:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:31,466 INFO L93 Difference]: Finished difference Result 2739 states and 3807 transitions. [2019-09-08 12:40:31,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:31,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:40:31,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:31,469 INFO L225 Difference]: With dead ends: 2739 [2019-09-08 12:40:31,469 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:40:31,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:40:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:40:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2154 transitions. [2019-09-08 12:40:31,607 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2154 transitions. Word has length 115 [2019-09-08 12:40:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:31,608 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2154 transitions. [2019-09-08 12:40:31,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2154 transitions. [2019-09-08 12:40:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:40:31,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:31,610 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,610 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:31,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:31,610 INFO L82 PathProgramCache]: Analyzing trace with hash -548113873, now seen corresponding path program 1 times [2019-09-08 12:40:31,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:31,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:31,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:31,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:31,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:31,815 INFO 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:31,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:31,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:31,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:31,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:31,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:31,817 INFO L87 Difference]: Start difference. First operand 1547 states and 2154 transitions. Second operand 9 states. [2019-09-08 12:40:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:35,519 INFO L93 Difference]: Finished difference Result 2739 states and 3803 transitions. [2019-09-08 12:40:35,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:35,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:40:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:35,522 INFO L225 Difference]: With dead ends: 2739 [2019-09-08 12:40:35,522 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:40:35,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:35,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:40:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:40:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2152 transitions. [2019-09-08 12:40:35,686 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2152 transitions. Word has length 115 [2019-09-08 12:40:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:35,687 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2152 transitions. [2019-09-08 12:40:35,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2152 transitions. [2019-09-08 12:40:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 12:40:35,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:35,689 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,689 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:35,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1381042639, now seen corresponding path program 1 times [2019-09-08 12:40:35,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:35,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:35,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:35,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:35,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:35,876 INFO 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:35,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:35,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:35,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:35,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:35,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:35,877 INFO L87 Difference]: Start difference. First operand 1547 states and 2152 transitions. Second operand 9 states. [2019-09-08 12:40:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:39,885 INFO L93 Difference]: Finished difference Result 3178 states and 4475 transitions. [2019-09-08 12:40:39,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:39,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 12:40:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:39,889 INFO L225 Difference]: With dead ends: 3178 [2019-09-08 12:40:39,889 INFO L226 Difference]: Without dead ends: 2758 [2019-09-08 12:40:39,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:40:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2019-09-08 12:40:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 1547. [2019-09-08 12:40:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2150 transitions. [2019-09-08 12:40:40,034 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2150 transitions. Word has length 115 [2019-09-08 12:40:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:40,034 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2150 transitions. [2019-09-08 12:40:40,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2150 transitions. [2019-09-08 12:40:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:40:40,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:40,038 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:40,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash 235051356, now seen corresponding path program 1 times [2019-09-08 12:40:40,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:40,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:40,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:40,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:40,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:40,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:40,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:40,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:40,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:40,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:40,226 INFO L87 Difference]: Start difference. First operand 1547 states and 2150 transitions. Second operand 9 states. [2019-09-08 12:40:44,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:44,630 INFO L93 Difference]: Finished difference Result 2893 states and 4075 transitions. [2019-09-08 12:40:44,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:44,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:40:44,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:44,633 INFO L225 Difference]: With dead ends: 2893 [2019-09-08 12:40:44,633 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:40:44,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:40:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:40:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:40:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2149 transitions. [2019-09-08 12:40:44,782 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2149 transitions. Word has length 117 [2019-09-08 12:40:44,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:44,783 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2149 transitions. [2019-09-08 12:40:44,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:44,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2149 transitions. [2019-09-08 12:40:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:40:44,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:44,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,786 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:44,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:44,786 INFO L82 PathProgramCache]: Analyzing trace with hash 703265472, now seen corresponding path program 1 times [2019-09-08 12:40:44,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:44,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:44,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:44,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:44,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:45,029 INFO 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:45,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:45,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:45,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:45,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:45,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:45,030 INFO L87 Difference]: Start difference. First operand 1547 states and 2149 transitions. Second operand 9 states. [2019-09-08 12:40:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:48,627 INFO L93 Difference]: Finished difference Result 2733 states and 3791 transitions. [2019-09-08 12:40:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:48,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:40:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:48,631 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 12:40:48,631 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:40:48,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:40:48,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:40:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:40:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2148 transitions. [2019-09-08 12:40:48,782 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2148 transitions. Word has length 117 [2019-09-08 12:40:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:48,782 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2148 transitions. [2019-09-08 12:40:48,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2148 transitions. [2019-09-08 12:40:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:40:48,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:48,784 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,784 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:48,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:48,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1011752119, now seen corresponding path program 1 times [2019-09-08 12:40:48,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:48,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:48,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:48,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:48,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:48,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:40:48,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:48,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:48,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:48,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:48,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:48,966 INFO L87 Difference]: Start difference. First operand 1547 states and 2148 transitions. Second operand 9 states. [2019-09-08 12:40:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:53,500 INFO L93 Difference]: Finished difference Result 2887 states and 4066 transitions. [2019-09-08 12:40:53,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:53,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:40:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:53,503 INFO L225 Difference]: With dead ends: 2887 [2019-09-08 12:40:53,503 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:40:53,504 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:40:53,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:40:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:40:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2147 transitions. [2019-09-08 12:40:53,654 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2147 transitions. Word has length 117 [2019-09-08 12:40:53,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:53,654 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2147 transitions. [2019-09-08 12:40:53,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2147 transitions. [2019-09-08 12:40:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:40:53,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:53,656 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,657 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:53,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:53,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1237007145, now seen corresponding path program 1 times [2019-09-08 12:40:53,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:53,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:53,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:53,825 INFO 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:53,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:53,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:53,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:53,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:53,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:53,826 INFO L87 Difference]: Start difference. First operand 1547 states and 2147 transitions. Second operand 9 states. [2019-09-08 12:40:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:58,215 INFO L93 Difference]: Finished difference Result 2902 states and 4080 transitions. [2019-09-08 12:40:58,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:40:58,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:40:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:58,219 INFO L225 Difference]: With dead ends: 2902 [2019-09-08 12:40:58,219 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:40:58,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:40:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:40:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:40:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:40:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2146 transitions. [2019-09-08 12:40:58,374 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2146 transitions. Word has length 117 [2019-09-08 12:40:58,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:58,375 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2146 transitions. [2019-09-08 12:40:58,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:40:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2146 transitions. [2019-09-08 12:40:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:40:58,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:58,377 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:58,377 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:58,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:58,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1107556400, now seen corresponding path program 1 times [2019-09-08 12:40:58,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:58,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:58,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:58,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:58,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:58,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:40:58,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:58,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:40:58,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:40:58,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:40:58,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:40:58,641 INFO L87 Difference]: Start difference. First operand 1547 states and 2146 transitions. Second operand 9 states. [2019-09-08 12:41:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:02,262 INFO L93 Difference]: Finished difference Result 2736 states and 3790 transitions. [2019-09-08 12:41:02,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:02,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:02,266 INFO L225 Difference]: With dead ends: 2736 [2019-09-08 12:41:02,266 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:41:02,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:41:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:41:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2145 transitions. [2019-09-08 12:41:02,423 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2145 transitions. Word has length 117 [2019-09-08 12:41:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:02,423 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2145 transitions. [2019-09-08 12:41:02,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2145 transitions. [2019-09-08 12:41:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:02,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:02,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,426 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1337537591, now seen corresponding path program 1 times [2019-09-08 12:41:02,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:02,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:02,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:02,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:02,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:02,587 INFO 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:02,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:02,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:02,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:02,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:02,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:02,588 INFO L87 Difference]: Start difference. First operand 1547 states and 2145 transitions. Second operand 9 states. [2019-09-08 12:41:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:06,190 INFO L93 Difference]: Finished difference Result 2733 states and 3785 transitions. [2019-09-08 12:41:06,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:06,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:06,193 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 12:41:06,194 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:41:06,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:41:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:41:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2144 transitions. [2019-09-08 12:41:06,355 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2144 transitions. Word has length 117 [2019-09-08 12:41:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:06,355 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2144 transitions. [2019-09-08 12:41:06,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2144 transitions. [2019-09-08 12:41:06,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:06,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:06,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,358 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:06,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:06,359 INFO L82 PathProgramCache]: Analyzing trace with hash 660532333, now seen corresponding path program 1 times [2019-09-08 12:41:06,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:06,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:06,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:06,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:06,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:06,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:06,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:06,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:06,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:06,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:06,542 INFO L87 Difference]: Start difference. First operand 1547 states and 2144 transitions. Second operand 9 states. [2019-09-08 12:41:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:10,872 INFO L93 Difference]: Finished difference Result 2893 states and 4065 transitions. [2019-09-08 12:41:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:10,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:10,875 INFO L225 Difference]: With dead ends: 2893 [2019-09-08 12:41:10,875 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:41:10,876 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:41:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:41:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:41:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2143 transitions. [2019-09-08 12:41:11,040 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2143 transitions. Word has length 117 [2019-09-08 12:41:11,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:11,040 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2143 transitions. [2019-09-08 12:41:11,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2143 transitions. [2019-09-08 12:41:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:11,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:11,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,044 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:11,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:11,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1128950014, now seen corresponding path program 1 times [2019-09-08 12:41:11,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:11,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:11,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:11,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:11,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:11,274 INFO 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:11,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:11,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:11,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:11,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:11,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:11,275 INFO L87 Difference]: Start difference. First operand 1547 states and 2143 transitions. Second operand 9 states. [2019-09-08 12:41:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:14,805 INFO L93 Difference]: Finished difference Result 2733 states and 3783 transitions. [2019-09-08 12:41:14,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:14,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:14,811 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 12:41:14,811 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:41:14,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:14,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:41:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:41:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2142 transitions. [2019-09-08 12:41:14,987 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2142 transitions. Word has length 117 [2019-09-08 12:41:14,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:14,987 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2142 transitions. [2019-09-08 12:41:14,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2142 transitions. [2019-09-08 12:41:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:14,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:14,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:14,990 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:14,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1953219296, now seen corresponding path program 1 times [2019-09-08 12:41:14,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:14,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:14,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:14,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:14,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:15,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:15,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:15,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:15,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:15,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:15,219 INFO L87 Difference]: Start difference. First operand 1547 states and 2142 transitions. Second operand 9 states. [2019-09-08 12:41:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:18,893 INFO L93 Difference]: Finished difference Result 2731 states and 3779 transitions. [2019-09-08 12:41:18,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:18,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:18,896 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:41:18,896 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:41:18,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:41:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:41:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2141 transitions. [2019-09-08 12:41:19,081 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2141 transitions. Word has length 117 [2019-09-08 12:41:19,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:19,081 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2141 transitions. [2019-09-08 12:41:19,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2141 transitions. [2019-09-08 12:41:19,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:19,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:19,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] [2019-09-08 12:41:19,083 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:19,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1953242557, now seen corresponding path program 1 times [2019-09-08 12:41:19,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:19,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:19,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:19,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:19,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:19,241 INFO 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:19,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:19,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:19,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:19,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:19,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:19,243 INFO L87 Difference]: Start difference. First operand 1547 states and 2141 transitions. Second operand 9 states. [2019-09-08 12:41:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:23,654 INFO L93 Difference]: Finished difference Result 2887 states and 4056 transitions. [2019-09-08 12:41:23,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:23,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:23,658 INFO L225 Difference]: With dead ends: 2887 [2019-09-08 12:41:23,658 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:41:23,659 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:41:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:41:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:41:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2140 transitions. [2019-09-08 12:41:23,828 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2140 transitions. Word has length 117 [2019-09-08 12:41:23,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:23,828 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2140 transitions. [2019-09-08 12:41:23,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2140 transitions. [2019-09-08 12:41:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:23,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:23,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:23,830 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:23,830 INFO L82 PathProgramCache]: Analyzing trace with hash -702884691, now seen corresponding path program 1 times [2019-09-08 12:41:23,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:23,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:23,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:23,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:23,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:24,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:24,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:24,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:24,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:24,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:24,025 INFO L87 Difference]: Start difference. First operand 1547 states and 2140 transitions. Second operand 9 states. [2019-09-08 12:41:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:27,663 INFO L93 Difference]: Finished difference Result 2731 states and 3777 transitions. [2019-09-08 12:41:27,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:27,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:27,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:27,666 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:41:27,666 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:41:27,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:27,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:41:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:41:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2139 transitions. [2019-09-08 12:41:27,839 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2139 transitions. Word has length 117 [2019-09-08 12:41:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:27,839 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2139 transitions. [2019-09-08 12:41:27,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2139 transitions. [2019-09-08 12:41:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:27,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:27,841 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,841 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:27,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1258245524, now seen corresponding path program 1 times [2019-09-08 12:41:27,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:27,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:27,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:27,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:27,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:28,067 INFO 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:28,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:28,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:28,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:28,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:28,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:28,069 INFO L87 Difference]: Start difference. First operand 1547 states and 2139 transitions. Second operand 9 states. [2019-09-08 12:41:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:32,479 INFO L93 Difference]: Finished difference Result 2893 states and 4060 transitions. [2019-09-08 12:41:32,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:32,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:32,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:32,483 INFO L225 Difference]: With dead ends: 2893 [2019-09-08 12:41:32,483 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:41:32,485 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:41:32,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:41:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:41:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2138 transitions. [2019-09-08 12:41:32,664 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2138 transitions. Word has length 117 [2019-09-08 12:41:32,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:32,664 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2138 transitions. [2019-09-08 12:41:32,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2138 transitions. [2019-09-08 12:41:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:32,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:32,667 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,667 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:32,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:32,667 INFO L82 PathProgramCache]: Analyzing trace with hash -710363507, now seen corresponding path program 1 times [2019-09-08 12:41:32,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:32,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:32,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:32,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:32,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:32,839 INFO 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:32,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:32,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:32,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:32,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:32,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:32,841 INFO L87 Difference]: Start difference. First operand 1547 states and 2138 transitions. Second operand 9 states. [2019-09-08 12:41:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:36,508 INFO L93 Difference]: Finished difference Result 2733 states and 3776 transitions. [2019-09-08 12:41:36,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:36,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:36,511 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 12:41:36,511 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:41:36,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:41:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:41:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2137 transitions. [2019-09-08 12:41:36,695 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2137 transitions. Word has length 117 [2019-09-08 12:41:36,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:36,695 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2137 transitions. [2019-09-08 12:41:36,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:36,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2137 transitions. [2019-09-08 12:41:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:36,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:36,697 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:36,697 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:36,698 INFO L82 PathProgramCache]: Analyzing trace with hash -890195728, now seen corresponding path program 1 times [2019-09-08 12:41:36,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:36,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:36,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:36,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:36,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:36,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:36,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:36,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:36,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:36,842 INFO L87 Difference]: Start difference. First operand 1547 states and 2137 transitions. Second operand 9 states. [2019-09-08 12:41:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:41,385 INFO L93 Difference]: Finished difference Result 2887 states and 4050 transitions. [2019-09-08 12:41:41,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:41,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:41,389 INFO L225 Difference]: With dead ends: 2887 [2019-09-08 12:41:41,389 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:41:41,390 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:41:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:41:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:41:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2136 transitions. [2019-09-08 12:41:41,587 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2136 transitions. Word has length 117 [2019-09-08 12:41:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:41,587 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2136 transitions. [2019-09-08 12:41:41,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2136 transitions. [2019-09-08 12:41:41,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:41,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:41,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,589 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:41,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:41,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2092278123, now seen corresponding path program 1 times [2019-09-08 12:41:41,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:41,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:41,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:41,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:41,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:41,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:41,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:41,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:41,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:41,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:41,738 INFO L87 Difference]: Start difference. First operand 1547 states and 2136 transitions. Second operand 9 states. [2019-09-08 12:41:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:45,834 INFO L93 Difference]: Finished difference Result 2832 states and 3950 transitions. [2019-09-08 12:41:45,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:45,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:45,838 INFO L225 Difference]: With dead ends: 2832 [2019-09-08 12:41:45,839 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:41:45,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:41:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:41:46,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:41:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2134 transitions. [2019-09-08 12:41:46,067 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2134 transitions. Word has length 117 [2019-09-08 12:41:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:46,067 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2134 transitions. [2019-09-08 12:41:46,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2134 transitions. [2019-09-08 12:41:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:46,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:46,069 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:46,069 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:46,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:46,070 INFO L82 PathProgramCache]: Analyzing trace with hash 563825864, now seen corresponding path program 1 times [2019-09-08 12:41:46,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:46,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:46,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:46,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:46,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:46,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:46,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:46,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:46,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:46,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:46,226 INFO L87 Difference]: Start difference. First operand 1547 states and 2134 transitions. Second operand 9 states. [2019-09-08 12:41:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:49,898 INFO L93 Difference]: Finished difference Result 2731 states and 3769 transitions. [2019-09-08 12:41:49,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:49,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:49,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:49,901 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:41:49,902 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:41:49,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:41:49,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:41:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:41:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2132 transitions. [2019-09-08 12:41:50,094 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2132 transitions. Word has length 117 [2019-09-08 12:41:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:50,094 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2132 transitions. [2019-09-08 12:41:50,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2132 transitions. [2019-09-08 12:41:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:50,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:50,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:50,096 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:50,096 INFO L82 PathProgramCache]: Analyzing trace with hash -926447500, now seen corresponding path program 1 times [2019-09-08 12:41:50,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:50,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:50,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:50,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:50,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:50,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:50,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:50,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:50,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:50,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:50,252 INFO L87 Difference]: Start difference. First operand 1547 states and 2132 transitions. Second operand 9 states. [2019-09-08 12:41:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:54,721 INFO L93 Difference]: Finished difference Result 2906 states and 4070 transitions. [2019-09-08 12:41:54,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:54,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:54,725 INFO L225 Difference]: With dead ends: 2906 [2019-09-08 12:41:54,726 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:41:54,727 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:41:54,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:41:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:41:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2130 transitions. [2019-09-08 12:41:54,930 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2130 transitions. Word has length 117 [2019-09-08 12:41:54,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:54,930 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2130 transitions. [2019-09-08 12:41:54,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2130 transitions. [2019-09-08 12:41:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:54,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:54,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,932 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:54,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:54,932 INFO L82 PathProgramCache]: Analyzing trace with hash -231450467, now seen corresponding path program 1 times [2019-09-08 12:41:54,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:54,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:54,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:54,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:54,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:55,080 INFO 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,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:55,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:55,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:55,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:55,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:55,081 INFO L87 Difference]: Start difference. First operand 1547 states and 2130 transitions. Second operand 9 states. [2019-09-08 12:41:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:59,485 INFO L93 Difference]: Finished difference Result 2912 states and 4075 transitions. [2019-09-08 12:41:59,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:41:59,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:41:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:59,488 INFO L225 Difference]: With dead ends: 2912 [2019-09-08 12:41:59,488 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:41:59,489 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:41:59,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:41:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:41:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:41:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2128 transitions. [2019-09-08 12:41:59,685 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2128 transitions. Word has length 117 [2019-09-08 12:41:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:59,685 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2128 transitions. [2019-09-08 12:41:59,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:41:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2128 transitions. [2019-09-08 12:41:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:41:59,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:59,687 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,687 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:59,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash 316431550, now seen corresponding path program 1 times [2019-09-08 12:41:59,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:59,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:59,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:59,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:59,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:59,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:59,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:41:59,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:41:59,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:41:59,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:41:59,854 INFO L87 Difference]: Start difference. First operand 1547 states and 2128 transitions. Second operand 9 states. [2019-09-08 12:42:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:03,531 INFO L93 Difference]: Finished difference Result 2735 states and 3767 transitions. [2019-09-08 12:42:03,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:03,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:03,534 INFO L225 Difference]: With dead ends: 2735 [2019-09-08 12:42:03,534 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:42:03,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:42:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:42:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:42:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2126 transitions. [2019-09-08 12:42:03,774 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2126 transitions. Word has length 117 [2019-09-08 12:42:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:03,774 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2126 transitions. [2019-09-08 12:42:03,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2126 transitions. [2019-09-08 12:42:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:42:03,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:03,777 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:03,777 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:03,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:03,778 INFO L82 PathProgramCache]: Analyzing trace with hash 932485886, now seen corresponding path program 1 times [2019-09-08 12:42:03,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:03,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:03,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:03,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:03,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:03,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:03,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:03,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:03,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:03,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:03,950 INFO L87 Difference]: Start difference. First operand 1547 states and 2126 transitions. Second operand 9 states. [2019-09-08 12:42:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:07,631 INFO L93 Difference]: Finished difference Result 2912 states and 4067 transitions. [2019-09-08 12:42:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:07,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:07,634 INFO L225 Difference]: With dead ends: 2912 [2019-09-08 12:42:07,635 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:42:07,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:42:07,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:42:07,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:42:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:42:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2124 transitions. [2019-09-08 12:42:07,838 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2124 transitions. Word has length 117 [2019-09-08 12:42:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:07,838 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2124 transitions. [2019-09-08 12:42:07,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2124 transitions. [2019-09-08 12:42:07,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:42:07,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:07,840 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,840 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:07,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:07,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1480367903, now seen corresponding path program 1 times [2019-09-08 12:42:07,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:07,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:07,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:07,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:07,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:08,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:08,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:08,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:08,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:08,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:08,001 INFO L87 Difference]: Start difference. First operand 1547 states and 2124 transitions. Second operand 9 states. [2019-09-08 12:42:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:11,595 INFO L93 Difference]: Finished difference Result 2735 states and 3761 transitions. [2019-09-08 12:42:11,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:11,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:11,598 INFO L225 Difference]: With dead ends: 2735 [2019-09-08 12:42:11,598 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:42:11,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:11,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:42:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:42:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:42:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2122 transitions. [2019-09-08 12:42:11,803 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2122 transitions. Word has length 117 [2019-09-08 12:42:11,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:11,803 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2122 transitions. [2019-09-08 12:42:11,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:11,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2122 transitions. [2019-09-08 12:42:11,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:42:11,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:11,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,805 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:11,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:11,805 INFO L82 PathProgramCache]: Analyzing trace with hash 622719947, now seen corresponding path program 1 times [2019-09-08 12:42:11,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:11,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:11,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:11,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:11,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:11,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:11,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:11,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:11,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:11,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:11,984 INFO L87 Difference]: Start difference. First operand 1547 states and 2122 transitions. Second operand 9 states. [2019-09-08 12:42:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:15,484 INFO L93 Difference]: Finished difference Result 2570 states and 3507 transitions. [2019-09-08 12:42:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:15,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:15,486 INFO L225 Difference]: With dead ends: 2570 [2019-09-08 12:42:15,486 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:42:15,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:42:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:42:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:42:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2120 transitions. [2019-09-08 12:42:15,691 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2120 transitions. Word has length 117 [2019-09-08 12:42:15,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:15,691 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2120 transitions. [2019-09-08 12:42:15,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2120 transitions. [2019-09-08 12:42:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:42:15,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:15,692 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,693 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:15,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:15,693 INFO L82 PathProgramCache]: Analyzing trace with hash -727299018, now seen corresponding path program 1 times [2019-09-08 12:42:15,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:15,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:15,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:15,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:15,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:15,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:15,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:15,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:15,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:15,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:15,854 INFO L87 Difference]: Start difference. First operand 1547 states and 2120 transitions. Second operand 9 states. [2019-09-08 12:42:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:19,449 INFO L93 Difference]: Finished difference Result 2570 states and 3503 transitions. [2019-09-08 12:42:19,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:19,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:19,452 INFO L225 Difference]: With dead ends: 2570 [2019-09-08 12:42:19,452 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:42:19,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:42:19,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:42:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:42:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2118 transitions. [2019-09-08 12:42:19,668 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2118 transitions. Word has length 117 [2019-09-08 12:42:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:19,668 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2118 transitions. [2019-09-08 12:42:19,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2118 transitions. [2019-09-08 12:42:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:42:19,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:19,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,670 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:19,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:19,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1112347179, now seen corresponding path program 1 times [2019-09-08 12:42:19,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:19,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:19,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:19,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:19,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:19,820 INFO 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:19,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:19,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:19,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:19,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:19,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:19,821 INFO L87 Difference]: Start difference. First operand 1547 states and 2118 transitions. Second operand 9 states. [2019-09-08 12:42:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:23,932 INFO L93 Difference]: Finished difference Result 2912 states and 4050 transitions. [2019-09-08 12:42:23,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:23,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:23,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:23,936 INFO L225 Difference]: With dead ends: 2912 [2019-09-08 12:42:23,936 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:42:23,937 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:42:23,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:42:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:42:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:42:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2116 transitions. [2019-09-08 12:42:24,153 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2116 transitions. Word has length 117 [2019-09-08 12:42:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:24,154 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2116 transitions. [2019-09-08 12:42:24,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2116 transitions. [2019-09-08 12:42:24,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:42:24,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:24,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,155 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:24,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1676459703, now seen corresponding path program 1 times [2019-09-08 12:42:24,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:24,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:24,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:24,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:24,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:24,329 INFO 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:24,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:24,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:24,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:24,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:24,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:24,331 INFO L87 Difference]: Start difference. First operand 1547 states and 2116 transitions. Second operand 9 states. [2019-09-08 12:42:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:28,800 INFO L93 Difference]: Finished difference Result 2924 states and 4067 transitions. [2019-09-08 12:42:28,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:28,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:28,803 INFO L225 Difference]: With dead ends: 2924 [2019-09-08 12:42:28,803 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:42:28,804 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:42:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:42:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:42:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:42:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2114 transitions. [2019-09-08 12:42:29,019 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2114 transitions. Word has length 117 [2019-09-08 12:42:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:29,019 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2114 transitions. [2019-09-08 12:42:29,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2114 transitions. [2019-09-08 12:42:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:42:29,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:29,020 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,020 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:29,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:29,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1805910448, now seen corresponding path program 1 times [2019-09-08 12:42:29,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:29,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:29,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:29,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:29,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:29,167 INFO 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:29,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:29,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:29,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:29,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:29,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:29,168 INFO L87 Difference]: Start difference. First operand 1547 states and 2114 transitions. Second operand 9 states. [2019-09-08 12:42:32,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:32,864 INFO L93 Difference]: Finished difference Result 2739 states and 3752 transitions. [2019-09-08 12:42:32,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:32,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:32,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:32,867 INFO L225 Difference]: With dead ends: 2739 [2019-09-08 12:42:32,867 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:42:32,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:42:33,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:42:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:42:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2112 transitions. [2019-09-08 12:42:33,103 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2112 transitions. Word has length 117 [2019-09-08 12:42:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:33,104 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2112 transitions. [2019-09-08 12:42:33,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2112 transitions. [2019-09-08 12:42:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:42:33,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:33,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,105 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:33,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:33,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1577200297, now seen corresponding path program 1 times [2019-09-08 12:42:33,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:33,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:33,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:33,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:33,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:33,299 INFO 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:33,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:33,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:33,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:33,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:33,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:33,301 INFO L87 Difference]: Start difference. First operand 1547 states and 2112 transitions. Second operand 9 states. [2019-09-08 12:42:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:37,034 INFO L93 Difference]: Finished difference Result 2735 states and 3743 transitions. [2019-09-08 12:42:37,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:37,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:37,038 INFO L225 Difference]: With dead ends: 2735 [2019-09-08 12:42:37,038 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:42:37,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:42:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:42:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:42:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2110 transitions. [2019-09-08 12:42:37,277 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2110 transitions. Word has length 117 [2019-09-08 12:42:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:37,277 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2110 transitions. [2019-09-08 12:42:37,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2110 transitions. [2019-09-08 12:42:37,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:42:37,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:37,279 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:37,280 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:37,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:37,280 INFO L82 PathProgramCache]: Analyzing trace with hash -720968115, now seen corresponding path program 1 times [2019-09-08 12:42:37,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:37,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:37,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:37,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:37,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:37,440 INFO 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:37,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:37,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:37,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:37,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:37,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:37,441 INFO L87 Difference]: Start difference. First operand 1547 states and 2110 transitions. Second operand 9 states. [2019-09-08 12:42:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:41,314 INFO L93 Difference]: Finished difference Result 2916 states and 4045 transitions. [2019-09-08 12:42:41,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:41,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:41,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:41,317 INFO L225 Difference]: With dead ends: 2916 [2019-09-08 12:42:41,317 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:42:41,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:42:41,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:42:41,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:42:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:42:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2108 transitions. [2019-09-08 12:42:41,568 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2108 transitions. Word has length 117 [2019-09-08 12:42:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:41,569 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2108 transitions. [2019-09-08 12:42:41,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2108 transitions. [2019-09-08 12:42:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:42:41,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:41,570 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:41,570 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:41,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash -251279394, now seen corresponding path program 1 times [2019-09-08 12:42:41,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:41,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:41,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:41,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:41,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:41,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:41,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:41,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:41,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:41,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:41,749 INFO L87 Difference]: Start difference. First operand 1547 states and 2108 transitions. Second operand 9 states. [2019-09-08 12:42:46,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:46,017 INFO L93 Difference]: Finished difference Result 2836 states and 3920 transitions. [2019-09-08 12:42:46,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:46,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:46,020 INFO L225 Difference]: With dead ends: 2836 [2019-09-08 12:42:46,021 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:42:46,022 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:42:46,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:42:46,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:42:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:42:46,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2106 transitions. [2019-09-08 12:42:46,301 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2106 transitions. Word has length 117 [2019-09-08 12:42:46,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:46,301 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2106 transitions. [2019-09-08 12:42:46,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:46,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2106 transitions. [2019-09-08 12:42:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:42:46,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:46,304 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:46,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:46,304 INFO L82 PathProgramCache]: Analyzing trace with hash 684760065, now seen corresponding path program 1 times [2019-09-08 12:42:46,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:46,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:46,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:46,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:46,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:46,474 INFO 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:46,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:46,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:46,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:46,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:46,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:46,475 INFO L87 Difference]: Start difference. First operand 1547 states and 2106 transitions. Second operand 9 states. [2019-09-08 12:42:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:50,824 INFO L93 Difference]: Finished difference Result 2924 states and 4051 transitions. [2019-09-08 12:42:50,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:50,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:50,828 INFO L225 Difference]: With dead ends: 2924 [2019-09-08 12:42:50,828 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:42:50,829 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:42:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:42:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:42:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:42:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2104 transitions. [2019-09-08 12:42:51,065 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2104 transitions. Word has length 117 [2019-09-08 12:42:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:51,066 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2104 transitions. [2019-09-08 12:42:51,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2104 transitions. [2019-09-08 12:42:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:42:51,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:51,067 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:51,067 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:51,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1075645348, now seen corresponding path program 1 times [2019-09-08 12:42:51,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:51,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:51,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:51,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:51,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:51,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:51,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:51,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:51,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:51,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:51,226 INFO L87 Difference]: Start difference. First operand 1547 states and 2104 transitions. Second operand 9 states. [2019-09-08 12:42:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:54,833 INFO L93 Difference]: Finished difference Result 2739 states and 3740 transitions. [2019-09-08 12:42:54,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:54,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:54,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:54,836 INFO L225 Difference]: With dead ends: 2739 [2019-09-08 12:42:54,836 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:42:54,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:42:54,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:42:55,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:42:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:42:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2102 transitions. [2019-09-08 12:42:55,076 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2102 transitions. Word has length 117 [2019-09-08 12:42:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:55,077 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2102 transitions. [2019-09-08 12:42:55,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2102 transitions. [2019-09-08 12:42:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:42:55,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:55,078 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,078 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:55,079 INFO L82 PathProgramCache]: Analyzing trace with hash 853511164, now seen corresponding path program 1 times [2019-09-08 12:42:55,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:55,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:55,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:55,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:55,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:55,222 INFO 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:55,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:55,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:55,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:55,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:55,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:55,224 INFO L87 Difference]: Start difference. First operand 1547 states and 2102 transitions. Second operand 9 states. [2019-09-08 12:42:59,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:59,878 INFO L93 Difference]: Finished difference Result 3022 states and 4178 transitions. [2019-09-08 12:42:59,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:59,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-08 12:42:59,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:59,880 INFO L225 Difference]: With dead ends: 3022 [2019-09-08 12:42:59,880 INFO L226 Difference]: Without dead ends: 2726 [2019-09-08 12:42:59,881 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:42:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-09-08 12:43:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1547. [2019-09-08 12:43:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:43:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2100 transitions. [2019-09-08 12:43:00,120 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2100 transitions. Word has length 117 [2019-09-08 12:43:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:00,120 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2100 transitions. [2019-09-08 12:43:00,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2100 transitions. [2019-09-08 12:43:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:43:00,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:00,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:00,122 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:00,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2069747753, now seen corresponding path program 1 times [2019-09-08 12:43:00,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:00,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:00,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:00,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:00,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:00,279 INFO 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:00,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:00,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:00,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:00,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:00,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:00,281 INFO L87 Difference]: Start difference. First operand 1547 states and 2100 transitions. Second operand 9 states. [2019-09-08 12:43:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:03,865 INFO L93 Difference]: Finished difference Result 2731 states and 3727 transitions. [2019-09-08 12:43:03,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:03,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:43:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:03,868 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:43:03,868 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:43:03,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:43:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:43:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:43:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:43:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2099 transitions. [2019-09-08 12:43:04,109 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2099 transitions. Word has length 118 [2019-09-08 12:43:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:04,110 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2099 transitions. [2019-09-08 12:43:04,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2099 transitions. [2019-09-08 12:43:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:43:04,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:04,111 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,111 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:04,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:04,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1826974247, now seen corresponding path program 1 times [2019-09-08 12:43:04,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:04,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:04,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:04,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:04,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:04,279 INFO 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:04,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:04,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:04,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:04,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:04,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:04,280 INFO L87 Difference]: Start difference. First operand 1547 states and 2099 transitions. Second operand 9 states. [2019-09-08 12:43:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:07,902 INFO L93 Difference]: Finished difference Result 2732 states and 3726 transitions. [2019-09-08 12:43:07,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:07,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:43:07,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:07,905 INFO L225 Difference]: With dead ends: 2732 [2019-09-08 12:43:07,905 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:43:07,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:43:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:43:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:43:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:43:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2098 transitions. [2019-09-08 12:43:08,164 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2098 transitions. Word has length 118 [2019-09-08 12:43:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:08,164 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2098 transitions. [2019-09-08 12:43:08,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2098 transitions. [2019-09-08 12:43:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:43:08,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:08,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:08,166 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:08,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:08,166 INFO L82 PathProgramCache]: Analyzing trace with hash -9829887, now seen corresponding path program 1 times [2019-09-08 12:43:08,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:08,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:08,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:08,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:08,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:08,348 INFO 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:08,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:08,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:08,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:08,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:08,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:08,349 INFO L87 Difference]: Start difference. First operand 1547 states and 2098 transitions. Second operand 9 states. [2019-09-08 12:43:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:12,895 INFO L93 Difference]: Finished difference Result 2885 states and 3992 transitions. [2019-09-08 12:43:12,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:12,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:43:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:12,898 INFO L225 Difference]: With dead ends: 2885 [2019-09-08 12:43:12,898 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:43:12,899 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:43:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:43:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:43:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:43:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2097 transitions. [2019-09-08 12:43:13,146 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2097 transitions. Word has length 118 [2019-09-08 12:43:13,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:13,146 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2097 transitions. [2019-09-08 12:43:13,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2097 transitions. [2019-09-08 12:43:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:43:13,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:13,147 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:13,148 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:13,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:13,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2266734, now seen corresponding path program 1 times [2019-09-08 12:43:13,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:13,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:13,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:13,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:13,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:13,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:13,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:13,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:13,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:13,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:13,302 INFO L87 Difference]: Start difference. First operand 1547 states and 2097 transitions. Second operand 9 states. [2019-09-08 12:43:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:17,726 INFO L93 Difference]: Finished difference Result 2826 states and 3895 transitions. [2019-09-08 12:43:17,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:17,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:43:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:17,730 INFO L225 Difference]: With dead ends: 2826 [2019-09-08 12:43:17,730 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:43:17,730 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:43:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:43:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:43:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:43:17,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2096 transitions. [2019-09-08 12:43:17,981 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2096 transitions. Word has length 118 [2019-09-08 12:43:17,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:17,981 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2096 transitions. [2019-09-08 12:43:17,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2096 transitions. [2019-09-08 12:43:17,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:43:17,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:17,983 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:17,983 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:17,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:17,983 INFO L82 PathProgramCache]: Analyzing trace with hash -307637134, now seen corresponding path program 1 times [2019-09-08 12:43:17,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:17,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:17,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:17,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:17,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:18,194 INFO 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:18,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:18,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:18,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:18,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:18,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:18,195 INFO L87 Difference]: Start difference. First operand 1547 states and 2096 transitions. Second operand 9 states. [2019-09-08 12:43:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:22,740 INFO L93 Difference]: Finished difference Result 2828 states and 3895 transitions. [2019-09-08 12:43:22,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:22,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:43:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:22,744 INFO L225 Difference]: With dead ends: 2828 [2019-09-08 12:43:22,744 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:43:22,745 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:43:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:43:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:43:22,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:43:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2095 transitions. [2019-09-08 12:43:22,999 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2095 transitions. Word has length 119 [2019-09-08 12:43:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:22,999 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2095 transitions. [2019-09-08 12:43:22,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:22,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2095 transitions. [2019-09-08 12:43:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:43:23,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:23,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,002 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:23,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:23,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1739299215, now seen corresponding path program 1 times [2019-09-08 12:43:23,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:23,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:23,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:23,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:23,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:23,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:23,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:23,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:23,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:23,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:23,157 INFO L87 Difference]: Start difference. First operand 1547 states and 2095 transitions. Second operand 9 states. [2019-09-08 12:43:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:27,841 INFO L93 Difference]: Finished difference Result 2832 states and 3898 transitions. [2019-09-08 12:43:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:27,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:43:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:27,844 INFO L225 Difference]: With dead ends: 2832 [2019-09-08 12:43:27,845 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:43:27,846 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:43:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:43:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:43:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:43:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2094 transitions. [2019-09-08 12:43:28,099 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2094 transitions. Word has length 119 [2019-09-08 12:43:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:28,100 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2094 transitions. [2019-09-08 12:43:28,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2094 transitions. [2019-09-08 12:43:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:43:28,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:28,101 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,101 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:28,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:28,102 INFO L82 PathProgramCache]: Analyzing trace with hash -479612977, now seen corresponding path program 1 times [2019-09-08 12:43:28,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:28,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:28,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:28,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:28,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:28,259 INFO 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:28,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:28,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:28,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:28,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:28,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:28,260 INFO L87 Difference]: Start difference. First operand 1547 states and 2094 transitions. Second operand 9 states. [2019-09-08 12:43:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:32,765 INFO L93 Difference]: Finished difference Result 2828 states and 3892 transitions. [2019-09-08 12:43:32,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:32,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:43:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:32,769 INFO L225 Difference]: With dead ends: 2828 [2019-09-08 12:43:32,769 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:43:32,770 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:43:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:43:33,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:43:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:43:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2093 transitions. [2019-09-08 12:43:33,066 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2093 transitions. Word has length 119 [2019-09-08 12:43:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:33,066 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2093 transitions. [2019-09-08 12:43:33,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2093 transitions. [2019-09-08 12:43:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:43:33,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:33,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,068 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:33,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:33,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2111700990, now seen corresponding path program 1 times [2019-09-08 12:43:33,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:33,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:33,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:33,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:33,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:33,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:33,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:33,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:33,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:33,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:33,239 INFO L87 Difference]: Start difference. First operand 1547 states and 2093 transitions. Second operand 9 states. [2019-09-08 12:43:37,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:37,024 INFO L93 Difference]: Finished difference Result 2733 states and 3721 transitions. [2019-09-08 12:43:37,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:37,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:43:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:37,027 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 12:43:37,027 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:43:37,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:43:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:43:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:43:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:43:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2092 transitions. [2019-09-08 12:43:37,289 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2092 transitions. Word has length 119 [2019-09-08 12:43:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:37,289 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2092 transitions. [2019-09-08 12:43:37,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2092 transitions. [2019-09-08 12:43:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:43:37,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:37,290 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,290 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash -185305612, now seen corresponding path program 1 times [2019-09-08 12:43:37,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:37,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:37,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:37,437 INFO 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:37,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:37,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:37,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:37,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:37,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:37,438 INFO L87 Difference]: Start difference. First operand 1547 states and 2092 transitions. Second operand 9 states. [2019-09-08 12:43:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:41,938 INFO L93 Difference]: Finished difference Result 2832 states and 3893 transitions. [2019-09-08 12:43:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:41,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:43:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:41,941 INFO L225 Difference]: With dead ends: 2832 [2019-09-08 12:43:41,941 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:43:41,942 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:43:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:43:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:43:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:43:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2091 transitions. [2019-09-08 12:43:42,203 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2091 transitions. Word has length 119 [2019-09-08 12:43:42,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:42,203 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2091 transitions. [2019-09-08 12:43:42,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2091 transitions. [2019-09-08 12:43:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:43:42,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:42,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:42,205 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:42,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1216698774, now seen corresponding path program 1 times [2019-09-08 12:43:42,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:42,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:42,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:42,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:42,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:42,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:43:42,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:42,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:42,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:42,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:42,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:42,365 INFO L87 Difference]: Start difference. First operand 1547 states and 2091 transitions. Second operand 9 states. [2019-09-08 12:43:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:46,879 INFO L93 Difference]: Finished difference Result 2837 states and 3897 transitions. [2019-09-08 12:43:46,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:46,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:43:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:46,882 INFO L225 Difference]: With dead ends: 2837 [2019-09-08 12:43:46,882 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:43:46,882 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:43:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:43:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:43:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:43:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2090 transitions. [2019-09-08 12:43:47,144 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2090 transitions. Word has length 119 [2019-09-08 12:43:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:47,144 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2090 transitions. [2019-09-08 12:43:47,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2090 transitions. [2019-09-08 12:43:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:43:47,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:47,146 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,146 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:47,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:47,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1149112010, now seen corresponding path program 1 times [2019-09-08 12:43:47,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:47,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:47,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:47,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:47,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:47,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:43:47,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:47,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:47,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:47,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:47,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:47,298 INFO L87 Difference]: Start difference. First operand 1547 states and 2090 transitions. Second operand 9 states. [2019-09-08 12:43:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:51,101 INFO L93 Difference]: Finished difference Result 2736 states and 3721 transitions. [2019-09-08 12:43:51,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:51,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:43:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:51,105 INFO L225 Difference]: With dead ends: 2736 [2019-09-08 12:43:51,105 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:43:51,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:43:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:43:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:43:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:43:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2089 transitions. [2019-09-08 12:43:51,376 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2089 transitions. Word has length 119 [2019-09-08 12:43:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:51,376 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2089 transitions. [2019-09-08 12:43:51,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2089 transitions. [2019-09-08 12:43:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:43:51,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:51,379 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,379 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:51,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:51,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1690348864, now seen corresponding path program 1 times [2019-09-08 12:43:51,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:51,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:51,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:51,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:51,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:51,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:51,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:51,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:51,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:51,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:51,550 INFO L87 Difference]: Start difference. First operand 1547 states and 2089 transitions. Second operand 9 states. [2019-09-08 12:43:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:56,175 INFO L93 Difference]: Finished difference Result 2832 states and 3888 transitions. [2019-09-08 12:43:56,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:56,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:43:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:56,179 INFO L225 Difference]: With dead ends: 2832 [2019-09-08 12:43:56,179 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:43:56,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:43:56,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:43:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:43:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:43:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2088 transitions. [2019-09-08 12:43:56,454 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2088 transitions. Word has length 119 [2019-09-08 12:43:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:56,454 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2088 transitions. [2019-09-08 12:43:56,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2088 transitions. [2019-09-08 12:43:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:43:56,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:56,456 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,456 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:56,456 INFO L82 PathProgramCache]: Analyzing trace with hash 557885648, now seen corresponding path program 1 times [2019-09-08 12:43:56,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:56,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:56,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:56,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:56,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:56,625 INFO 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:56,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:56,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:56,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:56,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:56,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:56,626 INFO L87 Difference]: Start difference. First operand 1547 states and 2088 transitions. Second operand 9 states. [2019-09-08 12:44:01,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:01,154 INFO L93 Difference]: Finished difference Result 2828 states and 3882 transitions. [2019-09-08 12:44:01,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:01,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:44:01,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:01,157 INFO L225 Difference]: With dead ends: 2828 [2019-09-08 12:44:01,157 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:44:01,158 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:44:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:44:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:44:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:44:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2087 transitions. [2019-09-08 12:44:01,436 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2087 transitions. Word has length 119 [2019-09-08 12:44:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:01,436 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2087 transitions. [2019-09-08 12:44:01,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2087 transitions. [2019-09-08 12:44:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:01,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:01,437 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:01,437 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:01,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1906294309, now seen corresponding path program 1 times [2019-09-08 12:44:01,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:01,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:01,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:01,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:01,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:01,593 INFO 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:44:01,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:01,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:01,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:01,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:01,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:01,594 INFO L87 Difference]: Start difference. First operand 1547 states and 2087 transitions. Second operand 9 states. [2019-09-08 12:44:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:06,121 INFO L93 Difference]: Finished difference Result 2828 states and 3881 transitions. [2019-09-08 12:44:06,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:06,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:44:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:06,124 INFO L225 Difference]: With dead ends: 2828 [2019-09-08 12:44:06,124 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:44:06,125 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:44:06,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:44:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:44:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:44:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2086 transitions. [2019-09-08 12:44:06,441 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2086 transitions. Word has length 119 [2019-09-08 12:44:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:06,442 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2086 transitions. [2019-09-08 12:44:06,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2086 transitions. [2019-09-08 12:44:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:06,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:06,443 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,443 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:06,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:06,443 INFO L82 PathProgramCache]: Analyzing trace with hash -350631552, now seen corresponding path program 1 times [2019-09-08 12:44:06,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:06,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:06,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:06,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:06,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:06,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:06,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:06,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:06,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:06,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:06,600 INFO L87 Difference]: Start difference. First operand 1547 states and 2086 transitions. Second operand 9 states. [2019-09-08 12:44:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:10,964 INFO L93 Difference]: Finished difference Result 2832 states and 3882 transitions. [2019-09-08 12:44:10,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:10,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:44:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:10,967 INFO L225 Difference]: With dead ends: 2832 [2019-09-08 12:44:10,967 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:44:10,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:44:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:44:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:44:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:44:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2085 transitions. [2019-09-08 12:44:11,247 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2085 transitions. Word has length 119 [2019-09-08 12:44:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:11,247 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2085 transitions. [2019-09-08 12:44:11,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2085 transitions. [2019-09-08 12:44:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:11,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:11,249 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,249 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:11,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:11,250 INFO L82 PathProgramCache]: Analyzing trace with hash 454751018, now seen corresponding path program 1 times [2019-09-08 12:44:11,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:11,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:11,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:11,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:11,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:11,409 INFO 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:44:11,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:11,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:11,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:11,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:11,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:11,410 INFO L87 Difference]: Start difference. First operand 1547 states and 2085 transitions. Second operand 9 states. [2019-09-08 12:44:15,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:15,144 INFO L93 Difference]: Finished difference Result 2733 states and 3713 transitions. [2019-09-08 12:44:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:15,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:44:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:15,147 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 12:44:15,147 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:44:15,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:44:15,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:44:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:44:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:44:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2084 transitions. [2019-09-08 12:44:15,431 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2084 transitions. Word has length 119 [2019-09-08 12:44:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:15,431 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2084 transitions. [2019-09-08 12:44:15,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:15,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2084 transitions. [2019-09-08 12:44:15,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:15,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:15,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,433 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:15,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:15,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1196293181, now seen corresponding path program 1 times [2019-09-08 12:44:15,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:15,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:15,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:15,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:15,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:15,624 INFO 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:44:15,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:15,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:15,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:15,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:15,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:15,625 INFO L87 Difference]: Start difference. First operand 1547 states and 2084 transitions. Second operand 9 states. [2019-09-08 12:44:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:19,486 INFO L93 Difference]: Finished difference Result 2731 states and 3710 transitions. [2019-09-08 12:44:19,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:19,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:44:19,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:19,489 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:44:19,489 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:44:19,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:44:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:44:19,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:44:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:44:19,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2083 transitions. [2019-09-08 12:44:19,816 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2083 transitions. Word has length 119 [2019-09-08 12:44:19,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:19,816 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2083 transitions. [2019-09-08 12:44:19,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:19,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2083 transitions. [2019-09-08 12:44:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:19,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:19,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,818 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:19,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:19,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1225535361, now seen corresponding path program 1 times [2019-09-08 12:44:19,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:19,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:19,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:19,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:19,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:19,969 INFO 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:44:19,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:19,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:19,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:19,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:19,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:19,970 INFO L87 Difference]: Start difference. First operand 1547 states and 2083 transitions. Second operand 9 states. [2019-09-08 12:44:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:24,393 INFO L93 Difference]: Finished difference Result 2828 states and 3874 transitions. [2019-09-08 12:44:24,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:24,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:44:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:24,396 INFO L225 Difference]: With dead ends: 2828 [2019-09-08 12:44:24,397 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:44:24,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:44:24,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:44:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:44:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:44:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2082 transitions. [2019-09-08 12:44:24,687 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2082 transitions. Word has length 119 [2019-09-08 12:44:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:24,688 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2082 transitions. [2019-09-08 12:44:24,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2082 transitions. [2019-09-08 12:44:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:24,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:24,689 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,689 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:24,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:24,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1949868616, now seen corresponding path program 1 times [2019-09-08 12:44:24,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:24,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:24,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:24,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:24,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:24,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:44:24,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:24,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:24,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:24,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:24,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:24,839 INFO L87 Difference]: Start difference. First operand 1547 states and 2082 transitions. Second operand 9 states. [2019-09-08 12:44:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:29,212 INFO L93 Difference]: Finished difference Result 2828 states and 3873 transitions. [2019-09-08 12:44:29,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:29,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:44:29,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:29,216 INFO L225 Difference]: With dead ends: 2828 [2019-09-08 12:44:29,216 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:44:29,217 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:44:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:44:29,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:44:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:44:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2081 transitions. [2019-09-08 12:44:29,508 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2081 transitions. Word has length 119 [2019-09-08 12:44:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:29,508 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2081 transitions. [2019-09-08 12:44:29,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2081 transitions. [2019-09-08 12:44:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:29,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:29,510 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,510 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:29,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:29,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1895555022, now seen corresponding path program 1 times [2019-09-08 12:44:29,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:29,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:29,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:29,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:29,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:29,663 INFO 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:44:29,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:29,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:29,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:29,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:29,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:29,664 INFO L87 Difference]: Start difference. First operand 1547 states and 2081 transitions. Second operand 9 states. [2019-09-08 12:44:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:34,004 INFO L93 Difference]: Finished difference Result 2731 states and 3707 transitions. [2019-09-08 12:44:34,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:34,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:44:34,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:34,007 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:44:34,007 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:44:34,007 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:44:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:44:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:44:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:44:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2079 transitions. [2019-09-08 12:44:34,303 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2079 transitions. Word has length 119 [2019-09-08 12:44:34,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:34,303 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2079 transitions. [2019-09-08 12:44:34,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2079 transitions. [2019-09-08 12:44:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:34,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:34,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:34,305 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:34,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:34,306 INFO L82 PathProgramCache]: Analyzing trace with hash 128437484, now seen corresponding path program 1 times [2019-09-08 12:44:34,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:34,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:34,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:34,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:34,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:34,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:44:34,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:34,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:34,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:34,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:34,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:34,469 INFO L87 Difference]: Start difference. First operand 1547 states and 2079 transitions. Second operand 9 states. [2019-09-08 12:44:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:39,062 INFO L93 Difference]: Finished difference Result 2836 states and 3879 transitions. [2019-09-08 12:44:39,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:39,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:44:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:39,065 INFO L225 Difference]: With dead ends: 2836 [2019-09-08 12:44:39,065 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:44:39,066 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:44:39,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:44:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:44:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:44:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2077 transitions. [2019-09-08 12:44:39,363 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2077 transitions. Word has length 119 [2019-09-08 12:44:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:39,364 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2077 transitions. [2019-09-08 12:44:39,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2077 transitions. [2019-09-08 12:44:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:39,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:39,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,365 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash 814836485, now seen corresponding path program 1 times [2019-09-08 12:44:39,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:39,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:39,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:39,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:39,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:39,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:39,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:39,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:39,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:39,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:39,525 INFO L87 Difference]: Start difference. First operand 1547 states and 2077 transitions. Second operand 9 states. [2019-09-08 12:44:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:43,448 INFO L93 Difference]: Finished difference Result 2731 states and 3701 transitions. [2019-09-08 12:44:43,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:43,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:44:43,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:43,451 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:44:43,451 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:44:43,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:44:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:44:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:44:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:44:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2075 transitions. [2019-09-08 12:44:43,753 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2075 transitions. Word has length 119 [2019-09-08 12:44:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:43,753 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2075 transitions. [2019-09-08 12:44:43,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2075 transitions. [2019-09-08 12:44:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:43,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:43,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:43,755 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:43,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:43,755 INFO L82 PathProgramCache]: Analyzing trace with hash 809196432, now seen corresponding path program 1 times [2019-09-08 12:44:43,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:43,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:43,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:43,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:43,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:43,903 INFO 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:44:43,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:43,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:43,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:43,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:43,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:43,904 INFO L87 Difference]: Start difference. First operand 1547 states and 2075 transitions. Second operand 9 states. [2019-09-08 12:44:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:48,563 INFO L93 Difference]: Finished difference Result 2836 states and 3873 transitions. [2019-09-08 12:44:48,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:48,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:44:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:48,566 INFO L225 Difference]: With dead ends: 2836 [2019-09-08 12:44:48,566 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:44:48,567 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:44:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:44:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:44:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:44:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2073 transitions. [2019-09-08 12:44:48,871 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2073 transitions. Word has length 119 [2019-09-08 12:44:48,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:48,871 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2073 transitions. [2019-09-08 12:44:48,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:48,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2073 transitions. [2019-09-08 12:44:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:48,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:48,873 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,873 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:48,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:48,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1684100241, now seen corresponding path program 1 times [2019-09-08 12:44:48,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:48,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:48,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:48,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:48,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:49,030 INFO 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:44:49,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:49,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:49,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:49,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:49,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:49,031 INFO L87 Difference]: Start difference. First operand 1547 states and 2073 transitions. Second operand 9 states. [2019-09-08 12:44:53,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:53,230 INFO L93 Difference]: Finished difference Result 2838 states and 3872 transitions. [2019-09-08 12:44:53,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:53,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:44:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:53,233 INFO L225 Difference]: With dead ends: 2838 [2019-09-08 12:44:53,233 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:44:53,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:44:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:44:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:44:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:44:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2071 transitions. [2019-09-08 12:44:53,545 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2071 transitions. Word has length 119 [2019-09-08 12:44:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:53,545 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2071 transitions. [2019-09-08 12:44:53,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2071 transitions. [2019-09-08 12:44:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:53,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:53,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:53,547 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:53,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:53,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1805484485, now seen corresponding path program 1 times [2019-09-08 12:44:53,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:53,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:53,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:53,745 INFO 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:44:53,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:53,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:53,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:53,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:53,746 INFO L87 Difference]: Start difference. First operand 1547 states and 2071 transitions. Second operand 9 states. [2019-09-08 12:44:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:57,725 INFO L93 Difference]: Finished difference Result 2735 states and 3699 transitions. [2019-09-08 12:44:57,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:57,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:44:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:57,728 INFO L225 Difference]: With dead ends: 2735 [2019-09-08 12:44:57,728 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:44:57,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:44:57,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:44:58,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:44:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:44:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2069 transitions. [2019-09-08 12:44:58,051 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2069 transitions. Word has length 119 [2019-09-08 12:44:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:58,051 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2069 transitions. [2019-09-08 12:44:58,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2069 transitions. [2019-09-08 12:44:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:44:58,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:58,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:58,053 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash -83413030, now seen corresponding path program 1 times [2019-09-08 12:44:58,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:58,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:58,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:58,208 INFO 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:44:58,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:58,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:58,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:58,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:58,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:58,209 INFO L87 Difference]: Start difference. First operand 1547 states and 2069 transitions. Second operand 9 states. [2019-09-08 12:45:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:02,193 INFO L93 Difference]: Finished difference Result 2731 states and 3693 transitions. [2019-09-08 12:45:02,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:02,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:02,196 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:45:02,196 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:45:02,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:45:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:45:02,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:45:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:45:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2067 transitions. [2019-09-08 12:45:02,511 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2067 transitions. Word has length 119 [2019-09-08 12:45:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:02,511 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2067 transitions. [2019-09-08 12:45:02,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2067 transitions. [2019-09-08 12:45:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:45:02,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:02,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:02,513 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:02,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:02,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1828908239, now seen corresponding path program 1 times [2019-09-08 12:45:02,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:02,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:02,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:02,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:02,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:02,690 INFO 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:45:02,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:02,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:02,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:02,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:02,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:02,691 INFO L87 Difference]: Start difference. First operand 1547 states and 2067 transitions. Second operand 9 states. [2019-09-08 12:45:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:07,218 INFO L93 Difference]: Finished difference Result 2836 states and 3861 transitions. [2019-09-08 12:45:07,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:07,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:07,222 INFO L225 Difference]: With dead ends: 2836 [2019-09-08 12:45:07,222 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:45:07,224 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:45:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:45:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:45:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:45:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2065 transitions. [2019-09-08 12:45:07,585 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2065 transitions. Word has length 119 [2019-09-08 12:45:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:07,585 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2065 transitions. [2019-09-08 12:45:07,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2065 transitions. [2019-09-08 12:45:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:45:07,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:07,587 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:07,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:07,587 INFO L82 PathProgramCache]: Analyzing trace with hash -954004430, now seen corresponding path program 1 times [2019-09-08 12:45:07,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:07,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:07,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:07,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:07,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:07,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:07,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:07,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:07,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:07,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:07,743 INFO L87 Difference]: Start difference. First operand 1547 states and 2065 transitions. Second operand 9 states. [2019-09-08 12:45:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:12,115 INFO L93 Difference]: Finished difference Result 2838 states and 3860 transitions. [2019-09-08 12:45:12,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:12,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:12,119 INFO L225 Difference]: With dead ends: 2838 [2019-09-08 12:45:12,119 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:45:12,120 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:45:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:45:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:45:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:45:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2063 transitions. [2019-09-08 12:45:12,440 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2063 transitions. Word has length 119 [2019-09-08 12:45:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:12,440 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2063 transitions. [2019-09-08 12:45:12,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2063 transitions. [2019-09-08 12:45:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:45:12,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:12,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:12,442 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:12,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:12,442 INFO L82 PathProgramCache]: Analyzing trace with hash -148621860, now seen corresponding path program 1 times [2019-09-08 12:45:12,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:12,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:12,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:12,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:12,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:12,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:12,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:12,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:12,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:12,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:12,611 INFO L87 Difference]: Start difference. First operand 1547 states and 2063 transitions. Second operand 9 states. [2019-09-08 12:45:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:16,516 INFO L93 Difference]: Finished difference Result 2735 states and 3691 transitions. [2019-09-08 12:45:16,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:16,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:16,520 INFO L225 Difference]: With dead ends: 2735 [2019-09-08 12:45:16,520 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:45:16,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:45:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:45:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:45:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:45:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2061 transitions. [2019-09-08 12:45:16,845 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2061 transitions. Word has length 119 [2019-09-08 12:45:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:16,846 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2061 transitions. [2019-09-08 12:45:16,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2061 transitions. [2019-09-08 12:45:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:45:16,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:16,847 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:16,847 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:16,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1788893969, now seen corresponding path program 1 times [2019-09-08 12:45:16,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:16,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:16,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:16,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:16,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:17,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:17,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:17,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:17,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:17,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:17,008 INFO L87 Difference]: Start difference. First operand 1547 states and 2061 transitions. Second operand 9 states. [2019-09-08 12:45:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:20,861 INFO L93 Difference]: Finished difference Result 2838 states and 3852 transitions. [2019-09-08 12:45:20,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:20,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:20,864 INFO L225 Difference]: With dead ends: 2838 [2019-09-08 12:45:20,864 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:45:20,865 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:45:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:45:21,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:45:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:45:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2059 transitions. [2019-09-08 12:45:21,188 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2059 transitions. Word has length 119 [2019-09-08 12:45:21,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:21,188 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2059 transitions. [2019-09-08 12:45:21,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:21,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2059 transitions. [2019-09-08 12:45:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:45:21,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:21,190 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:21,190 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:21,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:21,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1700690757, now seen corresponding path program 1 times [2019-09-08 12:45:21,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:21,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:21,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:21,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:21,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:21,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:21,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:21,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:21,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:21,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:21,355 INFO L87 Difference]: Start difference. First operand 1547 states and 2059 transitions. Second operand 9 states. [2019-09-08 12:45:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:25,409 INFO L93 Difference]: Finished difference Result 2735 states and 3687 transitions. [2019-09-08 12:45:25,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:25,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:25,413 INFO L225 Difference]: With dead ends: 2735 [2019-09-08 12:45:25,413 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:45:25,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:45:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:45:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:45:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:45:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2057 transitions. [2019-09-08 12:45:25,794 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2057 transitions. Word has length 119 [2019-09-08 12:45:25,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:25,795 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2057 transitions. [2019-09-08 12:45:25,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2057 transitions. [2019-09-08 12:45:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:45:25,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:25,796 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:25,796 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:25,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1121715269, now seen corresponding path program 1 times [2019-09-08 12:45:25,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:25,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:25,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:25,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:25,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:25,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:45:25,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:25,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:25,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:25,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:25,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:25,951 INFO L87 Difference]: Start difference. First operand 1547 states and 2057 transitions. Second operand 9 states. [2019-09-08 12:45:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:30,533 INFO L93 Difference]: Finished difference Result 2671 states and 3595 transitions. [2019-09-08 12:45:30,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:30,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:30,536 INFO L225 Difference]: With dead ends: 2671 [2019-09-08 12:45:30,536 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:45:30,537 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:45:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:45:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:45:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:45:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2055 transitions. [2019-09-08 12:45:30,869 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2055 transitions. Word has length 119 [2019-09-08 12:45:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:30,870 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2055 transitions. [2019-09-08 12:45:30,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2055 transitions. [2019-09-08 12:45:30,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:45:30,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:30,872 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:30,872 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:30,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:30,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1635895006, now seen corresponding path program 1 times [2019-09-08 12:45:30,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:30,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:30,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:30,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:30,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:31,034 INFO 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:45:31,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:31,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:31,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:31,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:31,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:31,036 INFO L87 Difference]: Start difference. First operand 1547 states and 2055 transitions. Second operand 9 states. [2019-09-08 12:45:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:35,081 INFO L93 Difference]: Finished difference Result 2735 states and 3683 transitions. [2019-09-08 12:45:35,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:35,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:35,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:35,084 INFO L225 Difference]: With dead ends: 2735 [2019-09-08 12:45:35,084 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:45:35,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:45:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:45:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:45:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:45:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2053 transitions. [2019-09-08 12:45:35,445 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2053 transitions. Word has length 119 [2019-09-08 12:45:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:35,445 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2053 transitions. [2019-09-08 12:45:35,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2053 transitions. [2019-09-08 12:45:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:45:35,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:35,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:35,447 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:35,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:35,447 INFO L82 PathProgramCache]: Analyzing trace with hash -662382636, now seen corresponding path program 1 times [2019-09-08 12:45:35,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:35,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:35,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:35,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:35,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:35,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:35,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:35,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:35,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:35,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:35,603 INFO L87 Difference]: Start difference. First operand 1547 states and 2053 transitions. Second operand 9 states. [2019-09-08 12:45:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:40,249 INFO L93 Difference]: Finished difference Result 2842 states and 3848 transitions. [2019-09-08 12:45:40,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:40,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:40,252 INFO L225 Difference]: With dead ends: 2842 [2019-09-08 12:45:40,252 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:45:40,253 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:45:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:45:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:45:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:45:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2051 transitions. [2019-09-08 12:45:40,601 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2051 transitions. Word has length 119 [2019-09-08 12:45:40,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:40,601 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2051 transitions. [2019-09-08 12:45:40,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2051 transitions. [2019-09-08 12:45:40,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:45:40,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:40,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:40,603 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:40,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:40,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1693775798, now seen corresponding path program 1 times [2019-09-08 12:45:40,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:40,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:40,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:40,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:40,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:40,764 INFO 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:45:40,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:40,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:40,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:40,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:40,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:40,765 INFO L87 Difference]: Start difference. First operand 1547 states and 2051 transitions. Second operand 9 states. [2019-09-08 12:45:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:45,308 INFO L93 Difference]: Finished difference Result 2844 states and 3849 transitions. [2019-09-08 12:45:45,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:45,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:45,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:45,311 INFO L225 Difference]: With dead ends: 2844 [2019-09-08 12:45:45,311 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:45:45,312 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:45:45,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:45:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:45:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:45:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2049 transitions. [2019-09-08 12:45:45,735 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2049 transitions. Word has length 119 [2019-09-08 12:45:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:45,735 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2049 transitions. [2019-09-08 12:45:45,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2049 transitions. [2019-09-08 12:45:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:45:45,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:45,737 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:45,737 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:45,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:45,738 INFO L82 PathProgramCache]: Analyzing trace with hash 672034986, now seen corresponding path program 1 times [2019-09-08 12:45:45,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:45,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:45,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:45,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:45,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:45,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:45,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:45,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:45,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:45,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:45,897 INFO L87 Difference]: Start difference. First operand 1547 states and 2049 transitions. Second operand 9 states. [2019-09-08 12:45:49,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:49,817 INFO L93 Difference]: Finished difference Result 2739 states and 3682 transitions. [2019-09-08 12:45:49,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:49,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:49,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:49,820 INFO L225 Difference]: With dead ends: 2739 [2019-09-08 12:45:49,820 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:45:49,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:45:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:45:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:45:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:45:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2047 transitions. [2019-09-08 12:45:50,164 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2047 transitions. Word has length 119 [2019-09-08 12:45:50,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:50,165 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2047 transitions. [2019-09-08 12:45:50,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2047 transitions. [2019-09-08 12:45:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:45:50,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:50,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:50,166 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:50,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:50,167 INFO L82 PathProgramCache]: Analyzing trace with hash 2127541408, now seen corresponding path program 1 times [2019-09-08 12:45:50,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:50,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:50,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:50,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:50,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:50,328 INFO 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:45:50,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:50,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:50,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:50,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:50,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:50,329 INFO L87 Difference]: Start difference. First operand 1547 states and 2047 transitions. Second operand 9 states. [2019-09-08 12:45:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:54,945 INFO L93 Difference]: Finished difference Result 2842 states and 3838 transitions. [2019-09-08 12:45:54,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:54,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:54,948 INFO L225 Difference]: With dead ends: 2842 [2019-09-08 12:45:54,948 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:45:54,949 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:45:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:45:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:45:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:45:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2045 transitions. [2019-09-08 12:45:55,302 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2045 transitions. Word has length 119 [2019-09-08 12:45:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:55,303 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2045 transitions. [2019-09-08 12:45:55,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2045 transitions. [2019-09-08 12:45:55,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:45:55,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:55,304 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:55,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:55,305 INFO L82 PathProgramCache]: Analyzing trace with hash -314352193, now seen corresponding path program 1 times [2019-09-08 12:45:55,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:55,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:55,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:55,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:55,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:55,463 INFO 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:45:55,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:55,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:55,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:55,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:55,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:55,464 INFO L87 Difference]: Start difference. First operand 1547 states and 2045 transitions. Second operand 9 states. [2019-09-08 12:45:59,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:59,697 INFO L93 Difference]: Finished difference Result 2735 states and 3673 transitions. [2019-09-08 12:45:59,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:59,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:59,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:59,699 INFO L225 Difference]: With dead ends: 2735 [2019-09-08 12:45:59,699 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:45:59,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:45:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:46:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:46:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:46:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2043 transitions. [2019-09-08 12:46:00,050 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2043 transitions. Word has length 119 [2019-09-08 12:46:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:00,050 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2043 transitions. [2019-09-08 12:46:00,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2043 transitions. [2019-09-08 12:46:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:46:00,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:00,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:00,052 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:00,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:00,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2095516123, now seen corresponding path program 1 times [2019-09-08 12:46:00,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:00,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:00,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:00,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:00,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:00,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:00,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:00,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:00,219 INFO L87 Difference]: Start difference. First operand 1547 states and 2043 transitions. Second operand 9 states. [2019-09-08 12:46:04,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:04,245 INFO L93 Difference]: Finished difference Result 2735 states and 3669 transitions. [2019-09-08 12:46:04,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:04,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:46:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:04,248 INFO L225 Difference]: With dead ends: 2735 [2019-09-08 12:46:04,248 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:46:04,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:46:04,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:46:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:46:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:46:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2041 transitions. [2019-09-08 12:46:04,603 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2041 transitions. Word has length 119 [2019-09-08 12:46:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:04,603 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2041 transitions. [2019-09-08 12:46:04,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2041 transitions. [2019-09-08 12:46:04,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:46:04,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:04,605 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:04,605 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:04,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:04,605 INFO L82 PathProgramCache]: Analyzing trace with hash -203002818, now seen corresponding path program 1 times [2019-09-08 12:46:04,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:04,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:04,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:04,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:04,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:04,811 INFO 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:46:04,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:04,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:04,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:04,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:04,812 INFO L87 Difference]: Start difference. First operand 1547 states and 2041 transitions. Second operand 9 states. [2019-09-08 12:46:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:09,366 INFO L93 Difference]: Finished difference Result 2842 states and 3830 transitions. [2019-09-08 12:46:09,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:09,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:46:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:09,370 INFO L225 Difference]: With dead ends: 2842 [2019-09-08 12:46:09,370 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:46:09,370 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:46:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:46:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:46:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:46:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2039 transitions. [2019-09-08 12:46:09,730 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2039 transitions. Word has length 119 [2019-09-08 12:46:09,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:09,730 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2039 transitions. [2019-09-08 12:46:09,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:09,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2039 transitions. [2019-09-08 12:46:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:46:09,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:09,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:09,732 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:09,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1234395980, now seen corresponding path program 1 times [2019-09-08 12:46:09,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:09,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:09,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:09,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:09,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:09,878 INFO 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:46:09,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:09,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:09,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:09,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:09,879 INFO L87 Difference]: Start difference. First operand 1547 states and 2039 transitions. Second operand 9 states. [2019-09-08 12:46:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:14,596 INFO L93 Difference]: Finished difference Result 2844 states and 3831 transitions. [2019-09-08 12:46:14,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:14,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:46:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:14,599 INFO L225 Difference]: With dead ends: 2844 [2019-09-08 12:46:14,599 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:46:14,600 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:46:14,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:46:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:46:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:46:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2037 transitions. [2019-09-08 12:46:14,968 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2037 transitions. Word has length 119 [2019-09-08 12:46:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:14,968 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2037 transitions. [2019-09-08 12:46:14,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2037 transitions. [2019-09-08 12:46:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:46:14,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:14,970 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:14,970 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:14,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:14,970 INFO L82 PathProgramCache]: Analyzing trace with hash 606562346, now seen corresponding path program 1 times [2019-09-08 12:46:14,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:14,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:14,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:14,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:14,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:15,123 INFO 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:46:15,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:15,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:15,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:15,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:15,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:15,124 INFO L87 Difference]: Start difference. First operand 1547 states and 2037 transitions. Second operand 9 states. [2019-09-08 12:46:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:19,556 INFO L93 Difference]: Finished difference Result 2844 states and 3827 transitions. [2019-09-08 12:46:19,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:19,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:46:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:19,559 INFO L225 Difference]: With dead ends: 2844 [2019-09-08 12:46:19,559 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:46:19,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:46:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:46:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:46:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:46:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2035 transitions. [2019-09-08 12:46:19,934 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2035 transitions. Word has length 119 [2019-09-08 12:46:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:19,935 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2035 transitions. [2019-09-08 12:46:19,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2035 transitions. [2019-09-08 12:46:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:46:19,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:19,936 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:19,936 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:19,937 INFO L82 PathProgramCache]: Analyzing trace with hash 324859452, now seen corresponding path program 1 times [2019-09-08 12:46:19,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:19,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:19,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:19,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:20,074 INFO 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:46:20,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:20,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:20,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:20,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:20,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:20,075 INFO L87 Difference]: Start difference. First operand 1547 states and 2035 transitions. Second operand 9 states. [2019-09-08 12:46:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:24,836 INFO L93 Difference]: Finished difference Result 2932 states and 3951 transitions. [2019-09-08 12:46:24,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:24,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:46:24,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:24,839 INFO L225 Difference]: With dead ends: 2932 [2019-09-08 12:46:24,839 INFO L226 Difference]: Without dead ends: 2702 [2019-09-08 12:46:24,840 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:46:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-08 12:46:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1547. [2019-09-08 12:46:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:46:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2033 transitions. [2019-09-08 12:46:25,209 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2033 transitions. Word has length 119 [2019-09-08 12:46:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:25,209 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2033 transitions. [2019-09-08 12:46:25,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2033 transitions. [2019-09-08 12:46:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:25,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:25,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:25,210 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:25,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:25,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1934710952, now seen corresponding path program 1 times [2019-09-08 12:46:25,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:25,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:25,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:25,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:25,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:25,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:25,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:25,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:25,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:25,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:25,367 INFO L87 Difference]: Start difference. First operand 1547 states and 2033 transitions. Second operand 9 states. [2019-09-08 12:46:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:29,473 INFO L93 Difference]: Finished difference Result 2731 states and 3655 transitions. [2019-09-08 12:46:29,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:29,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:29,476 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:46:29,476 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:46:29,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:46:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:46:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:46:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:46:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2032 transitions. [2019-09-08 12:46:29,843 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2032 transitions. Word has length 120 [2019-09-08 12:46:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:29,843 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2032 transitions. [2019-09-08 12:46:29,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2032 transitions. [2019-09-08 12:46:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:29,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:29,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:29,844 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:29,844 INFO L82 PathProgramCache]: Analyzing trace with hash 273114660, now seen corresponding path program 1 times [2019-09-08 12:46:29,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:29,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:29,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:29,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:29,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:30,001 INFO 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:46:30,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:30,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:30,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:30,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:30,002 INFO L87 Difference]: Start difference. First operand 1547 states and 2032 transitions. Second operand 9 states. [2019-09-08 12:46:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:34,460 INFO L93 Difference]: Finished difference Result 2826 states and 3800 transitions. [2019-09-08 12:46:34,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:34,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:34,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:34,462 INFO L225 Difference]: With dead ends: 2826 [2019-09-08 12:46:34,462 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:46:34,463 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:46:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:46:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:46:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:46:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2031 transitions. [2019-09-08 12:46:34,835 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2031 transitions. Word has length 120 [2019-09-08 12:46:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:34,836 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2031 transitions. [2019-09-08 12:46:34,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2031 transitions. [2019-09-08 12:46:34,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:34,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:34,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:34,837 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:34,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:34,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1544029700, now seen corresponding path program 1 times [2019-09-08 12:46:34,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:34,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:34,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:34,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:34,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:34,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:34,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:34,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:34,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:34,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:34,985 INFO L87 Difference]: Start difference. First operand 1547 states and 2031 transitions. Second operand 9 states. [2019-09-08 12:46:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:39,451 INFO L93 Difference]: Finished difference Result 2732 states and 3654 transitions. [2019-09-08 12:46:39,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:39,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:39,454 INFO L225 Difference]: With dead ends: 2732 [2019-09-08 12:46:39,454 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:46:39,455 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:46:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:46:39,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:46:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:46:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2030 transitions. [2019-09-08 12:46:39,832 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2030 transitions. Word has length 120 [2019-09-08 12:46:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:39,832 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2030 transitions. [2019-09-08 12:46:39,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2030 transitions. [2019-09-08 12:46:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:39,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:39,833 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:39,834 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:39,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:39,834 INFO L82 PathProgramCache]: Analyzing trace with hash -322580500, now seen corresponding path program 1 times [2019-09-08 12:46:39,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:39,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:39,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:39,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:39,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:39,988 INFO 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:46:39,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:39,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:39,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:39,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:39,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:39,989 INFO L87 Difference]: Start difference. First operand 1547 states and 2030 transitions. Second operand 9 states. [2019-09-08 12:46:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:44,125 INFO L93 Difference]: Finished difference Result 2731 states and 3652 transitions. [2019-09-08 12:46:44,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:44,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:44,128 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:46:44,128 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:46:44,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:46:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:46:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:46:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:46:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2029 transitions. [2019-09-08 12:46:44,513 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2029 transitions. Word has length 120 [2019-09-08 12:46:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:44,513 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2029 transitions. [2019-09-08 12:46:44,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2029 transitions. [2019-09-08 12:46:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:44,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:44,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:44,514 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:44,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:44,515 INFO L82 PathProgramCache]: Analyzing trace with hash 2014104759, now seen corresponding path program 1 times [2019-09-08 12:46:44,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:44,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:44,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:44,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:44,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:44,676 INFO 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:46:44,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:44,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:44,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:44,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:44,677 INFO L87 Difference]: Start difference. First operand 1547 states and 2029 transitions. Second operand 9 states. [2019-09-08 12:46:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:48,877 INFO L93 Difference]: Finished difference Result 2731 states and 3651 transitions. [2019-09-08 12:46:48,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:48,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:48,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:48,879 INFO L225 Difference]: With dead ends: 2731 [2019-09-08 12:46:48,879 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:46:48,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:46:48,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:46:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:46:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:46:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2028 transitions. [2019-09-08 12:46:49,262 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2028 transitions. Word has length 120 [2019-09-08 12:46:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:49,262 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2028 transitions. [2019-09-08 12:46:49,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2028 transitions. [2019-09-08 12:46:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:49,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:49,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, 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:46:49,265 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:49,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2137909868, now seen corresponding path program 1 times [2019-09-08 12:46:49,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:49,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:49,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:49,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:49,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:49,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:49,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:49,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:49,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:49,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:49,405 INFO L87 Difference]: Start difference. First operand 1547 states and 2028 transitions. Second operand 9 states. [2019-09-08 12:46:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:53,848 INFO L93 Difference]: Finished difference Result 2732 states and 3651 transitions. [2019-09-08 12:46:53,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:53,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:53,851 INFO L225 Difference]: With dead ends: 2732 [2019-09-08 12:46:53,851 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:46:53,852 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:46:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:46:54,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:46:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:46:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2027 transitions. [2019-09-08 12:46:54,240 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2027 transitions. Word has length 120 [2019-09-08 12:46:54,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:54,240 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2027 transitions. [2019-09-08 12:46:54,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2027 transitions. [2019-09-08 12:46:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:54,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:54,242 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:54,242 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:54,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash -339913068, now seen corresponding path program 1 times [2019-09-08 12:46:54,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:54,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:54,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:54,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:54,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:54,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:46:54,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:54,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:54,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:54,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:54,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:54,433 INFO L87 Difference]: Start difference. First operand 1547 states and 2027 transitions. Second operand 9 states. [2019-09-08 12:46:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:59,036 INFO L93 Difference]: Finished difference Result 2826 states and 3794 transitions. [2019-09-08 12:46:59,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:59,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:59,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:59,039 INFO L225 Difference]: With dead ends: 2826 [2019-09-08 12:46:59,039 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:46:59,039 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:46:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:46:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:46:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:46:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2026 transitions. [2019-09-08 12:46:59,438 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2026 transitions. Word has length 120 [2019-09-08 12:46:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:59,438 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2026 transitions. [2019-09-08 12:46:59,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2026 transitions. [2019-09-08 12:46:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:59,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:59,440 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:59,440 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:59,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:59,440 INFO L82 PathProgramCache]: Analyzing trace with hash -873001394, now seen corresponding path program 1 times [2019-09-08 12:46:59,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:59,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:59,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:59,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:59,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:59,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:46:59,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:59,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:59,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:59,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:59,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:59,587 INFO L87 Difference]: Start difference. First operand 1547 states and 2026 transitions. Second operand 9 states. [2019-09-08 12:47:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:04,061 INFO L93 Difference]: Finished difference Result 2826 states and 3793 transitions. [2019-09-08 12:47:04,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:04,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:04,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:04,063 INFO L225 Difference]: With dead ends: 2826 [2019-09-08 12:47:04,063 INFO L226 Difference]: Without dead ends: 2654 [2019-09-08 12:47:04,064 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:47:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-08 12:47:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1547. [2019-09-08 12:47:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:47:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2025 transitions. [2019-09-08 12:47:04,454 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2025 transitions. Word has length 120 [2019-09-08 12:47:04,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:04,454 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2025 transitions. [2019-09-08 12:47:04,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2025 transitions. [2019-09-08 12:47:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:04,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:04,456 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:04,456 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash 185231847, now seen corresponding path program 1 times [2019-09-08 12:47:04,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:04,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:04,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:04,624 INFO 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:47:04,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:04,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:04,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:04,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:04,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:04,625 INFO L87 Difference]: Start difference. First operand 1547 states and 2025 transitions. Second operand 9 states. [2019-09-08 12:47:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:08,960 INFO L93 Difference]: Finished difference Result 2732 states and 3648 transitions. [2019-09-08 12:47:08,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:08,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:08,962 INFO L225 Difference]: With dead ends: 2732 [2019-09-08 12:47:08,963 INFO L226 Difference]: Without dead ends: 2565 [2019-09-08 12:47:08,963 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:47:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-09-08 12:47:09,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1547. [2019-09-08 12:47:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-09-08 12:47:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2024 transitions. [2019-09-08 12:47:09,359 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2024 transitions. Word has length 120 [2019-09-08 12:47:09,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:09,359 INFO L475 AbstractCegarLoop]: Abstraction has 1547 states and 2024 transitions. [2019-09-08 12:47:09,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2024 transitions. [2019-09-08 12:47:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:09,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:09,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:09,361 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:09,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:09,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1490661287, now seen corresponding path program 1 times [2019-09-08 12:47:09,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:09,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:09,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:09,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:09,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:09,574 INFO 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:47:09,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:09,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:09,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:09,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:09,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:09,575 INFO L87 Difference]: Start difference. First operand 1547 states and 2024 transitions. Second operand 9 states. [2019-09-08 12:47:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:14,101 INFO L93 Difference]: Finished difference Result 2700 states and 3596 transitions. [2019-09-08 12:47:14,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:14,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:14,103 INFO L225 Difference]: With dead ends: 2700 [2019-09-08 12:47:14,104 INFO L226 Difference]: Without dead ends: 2534 [2019-09-08 12:47:14,104 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:47:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2019-09-08 12:47:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 1550. [2019-09-08 12:47:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-08 12:47:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2028 transitions. [2019-09-08 12:47:14,504 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2028 transitions. Word has length 120 [2019-09-08 12:47:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:14,504 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2028 transitions. [2019-09-08 12:47:14,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2028 transitions. [2019-09-08 12:47:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:14,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:14,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:14,506 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:14,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:14,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1905087375, now seen corresponding path program 1 times [2019-09-08 12:47:14,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:14,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:14,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:14,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:14,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:14,662 INFO 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:47:14,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:14,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:14,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:14,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:14,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:14,663 INFO L87 Difference]: Start difference. First operand 1550 states and 2028 transitions. Second operand 9 states. [2019-09-08 12:47:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:18,959 INFO L93 Difference]: Finished difference Result 2733 states and 3648 transitions. [2019-09-08 12:47:18,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:18,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:18,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:18,961 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 12:47:18,961 INFO L226 Difference]: Without dead ends: 2566 [2019-09-08 12:47:18,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:47:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-09-08 12:47:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1550. [2019-09-08 12:47:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-08 12:47:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2027 transitions. [2019-09-08 12:47:19,373 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2027 transitions. Word has length 120 [2019-09-08 12:47:19,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:19,373 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2027 transitions. [2019-09-08 12:47:19,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:19,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2027 transitions. [2019-09-08 12:47:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:19,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:19,374 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:19,374 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:19,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:19,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2119924989, now seen corresponding path program 1 times [2019-09-08 12:47:19,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:19,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:19,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:19,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:19,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:19,538 INFO 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:47:19,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:19,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:19,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:19,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:19,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:19,539 INFO L87 Difference]: Start difference. First operand 1550 states and 2027 transitions. Second operand 9 states. [2019-09-08 12:47:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:24,211 INFO L93 Difference]: Finished difference Result 2829 states and 3794 transitions. [2019-09-08 12:47:24,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:24,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:24,214 INFO L225 Difference]: With dead ends: 2829 [2019-09-08 12:47:24,214 INFO L226 Difference]: Without dead ends: 2657 [2019-09-08 12:47:24,215 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:47:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2019-09-08 12:47:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 1550. [2019-09-08 12:47:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-08 12:47:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2026 transitions. [2019-09-08 12:47:24,630 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2026 transitions. Word has length 120 [2019-09-08 12:47:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:24,630 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2026 transitions. [2019-09-08 12:47:24,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2026 transitions. [2019-09-08 12:47:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:24,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:24,631 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:24,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:24,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1097313116, now seen corresponding path program 1 times [2019-09-08 12:47:24,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:24,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:24,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:24,828 INFO 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:47:24,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:24,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:24,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:24,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:24,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:24,829 INFO L87 Difference]: Start difference. First operand 1550 states and 2026 transitions. Second operand 9 states. [2019-09-08 12:47:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:28,925 INFO L93 Difference]: Finished difference Result 2734 states and 3646 transitions. [2019-09-08 12:47:28,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:28,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:28,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:28,929 INFO L225 Difference]: With dead ends: 2734 [2019-09-08 12:47:28,929 INFO L226 Difference]: Without dead ends: 2566 [2019-09-08 12:47:28,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:47:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-09-08 12:47:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1550. [2019-09-08 12:47:29,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-08 12:47:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2024 transitions. [2019-09-08 12:47:29,336 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2024 transitions. Word has length 120 [2019-09-08 12:47:29,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:29,336 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2024 transitions. [2019-09-08 12:47:29,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2024 transitions. [2019-09-08 12:47:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:29,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:29,338 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:29,338 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:29,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:29,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1455081175, now seen corresponding path program 1 times [2019-09-08 12:47:29,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:29,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:29,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:29,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:29,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:29,491 INFO 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:47:29,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:29,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:29,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:29,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:29,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:29,493 INFO L87 Difference]: Start difference. First operand 1550 states and 2024 transitions. Second operand 9 states. [2019-09-08 12:47:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:34,118 INFO L93 Difference]: Finished difference Result 2732 states and 3642 transitions. [2019-09-08 12:47:34,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:34,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:34,121 INFO L225 Difference]: With dead ends: 2732 [2019-09-08 12:47:34,121 INFO L226 Difference]: Without dead ends: 2566 [2019-09-08 12:47:34,122 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:47:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-09-08 12:47:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1550. [2019-09-08 12:47:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2019-09-08 12:47:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2022 transitions. [2019-09-08 12:47:34,537 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2022 transitions. Word has length 120 [2019-09-08 12:47:34,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:34,537 INFO L475 AbstractCegarLoop]: Abstraction has 1550 states and 2022 transitions. [2019-09-08 12:47:34,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2022 transitions. [2019-09-08 12:47:34,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:47:34,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:34,539 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:34,539 INFO L418 AbstractCegarLoop]: === Iteration 127 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:34,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:34,539 INFO L82 PathProgramCache]: Analyzing trace with hash 158642163, now seen corresponding path program 1 times [2019-09-08 12:47:34,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:34,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:34,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:34,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:34,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:35,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:35,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:47:35,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:47:35,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:47:35,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:47:35,403 INFO L87 Difference]: Start difference. First operand 1550 states and 2022 transitions. Second operand 15 states. [2019-09-08 12:47:36,100 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 12:47:36,237 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-08 12:47:39,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:39,171 INFO L93 Difference]: Finished difference Result 2240 states and 2982 transitions. [2019-09-08 12:47:39,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:47:39,171 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 121 [2019-09-08 12:47:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:39,173 INFO L225 Difference]: With dead ends: 2240 [2019-09-08 12:47:39,173 INFO L226 Difference]: Without dead ends: 1673 [2019-09-08 12:47:39,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:47:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-09-08 12:47:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1368. [2019-09-08 12:47:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-08 12:47:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1778 transitions. [2019-09-08 12:47:39,553 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1778 transitions. Word has length 121 [2019-09-08 12:47:39,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:39,553 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 1778 transitions. [2019-09-08 12:47:39,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:47:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1778 transitions. [2019-09-08 12:47:39,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:47:39,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:39,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, 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:47:39,555 INFO L418 AbstractCegarLoop]: === Iteration 128 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:39,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:39,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1097831607, now seen corresponding path program 1 times [2019-09-08 12:47:39,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:39,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:39,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:39,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:39,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:40,893 INFO 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:47:40,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:40,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:47:40,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:47:40,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:47:40,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:40,895 INFO L87 Difference]: Start difference. First operand 1368 states and 1778 transitions. Second operand 21 states. [2019-09-08 12:47:41,028 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 12:47:41,731 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-08 12:47:42,280 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-08 12:47:42,609 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-08 12:47:42,797 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 12:47:42,981 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 12:47:43,165 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 12:47:43,587 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:47:44,207 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-08 12:47:44,609 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:47:45,141 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:47:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:53,994 INFO L93 Difference]: Finished difference Result 3346 states and 4425 transitions. [2019-09-08 12:47:53,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:47:53,994 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 121 [2019-09-08 12:47:53,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:53,998 INFO L225 Difference]: With dead ends: 3346 [2019-09-08 12:47:53,998 INFO L226 Difference]: Without dead ends: 3179 [2019-09-08 12:47:54,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=382, Invalid=1178, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 12:47:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-09-08 12:47:54,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 1368. [2019-09-08 12:47:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-08 12:47:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1777 transitions. [2019-09-08 12:47:54,420 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1777 transitions. Word has length 121 [2019-09-08 12:47:54,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:54,420 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 1777 transitions. [2019-09-08 12:47:54,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:47:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1777 transitions. [2019-09-08 12:47:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:47:54,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:54,422 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:54,422 INFO L418 AbstractCegarLoop]: === Iteration 129 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:54,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:54,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1907164845, now seen corresponding path program 1 times [2019-09-08 12:47:54,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:54,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:54,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:54,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:54,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:55,679 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 12:47:55,851 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 12:47:56,013 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-08 12:47:56,182 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-08 12:47:56,641 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2019-09-08 12:47:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:57,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:57,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:47:57,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:47:57,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:47:57,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:47:57,555 INFO L87 Difference]: Start difference. First operand 1368 states and 1777 transitions. Second operand 31 states. [2019-09-08 12:47:57,749 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-08 12:47:58,941 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-08 12:47:59,107 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-08 12:47:59,529 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-09-08 12:48:00,046 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-08 12:48:00,463 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-08 12:48:00,951 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 94 [2019-09-08 12:48:01,575 WARN L188 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 112 [2019-09-08 12:48:01,898 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-08 12:48:02,187 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-08 12:48:02,545 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-09-08 12:48:03,188 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-09-08 12:48:03,640 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-09-08 12:48:04,023 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-08 12:48:04,537 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-08 12:48:05,466 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-08 12:48:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:28,238 INFO L93 Difference]: Finished difference Result 3858 states and 5029 transitions. [2019-09-08 12:48:28,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 12:48:28,239 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 121 [2019-09-08 12:48:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:28,243 INFO L225 Difference]: With dead ends: 3858 [2019-09-08 12:48:28,243 INFO L226 Difference]: Without dead ends: 3689 [2019-09-08 12:48:28,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=641, Invalid=2439, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 12:48:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2019-09-08 12:48:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 1379. [2019-09-08 12:48:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1379 states. [2019-09-08 12:48:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1789 transitions. [2019-09-08 12:48:28,758 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1789 transitions. Word has length 121 [2019-09-08 12:48:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:28,759 INFO L475 AbstractCegarLoop]: Abstraction has 1379 states and 1789 transitions. [2019-09-08 12:48:28,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:48:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1789 transitions. [2019-09-08 12:48:28,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:48:28,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:28,761 INFO L418 AbstractCegarLoop]: === Iteration 130 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:28,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:28,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1104047055, now seen corresponding path program 1 times [2019-09-08 12:48:28,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:28,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:28,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:28,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:28,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:29,595 INFO 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:48:29,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:29,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:48:29,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:48:29,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:48:29,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:48:29,596 INFO L87 Difference]: Start difference. First operand 1379 states and 1789 transitions. Second operand 17 states. [2019-09-08 12:48:30,317 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:48:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:33,888 INFO L93 Difference]: Finished difference Result 2944 states and 3942 transitions. [2019-09-08 12:48:33,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:48:33,889 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2019-09-08 12:48:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:33,892 INFO L225 Difference]: With dead ends: 2944 [2019-09-08 12:48:33,892 INFO L226 Difference]: Without dead ends: 2593 [2019-09-08 12:48:33,893 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:48:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2019-09-08 12:48:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 1288. [2019-09-08 12:48:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-09-08 12:48:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1666 transitions. [2019-09-08 12:48:34,339 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1666 transitions. Word has length 121 [2019-09-08 12:48:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:34,339 INFO L475 AbstractCegarLoop]: Abstraction has 1288 states and 1666 transitions. [2019-09-08 12:48:34,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:48:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1666 transitions. [2019-09-08 12:48:34,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:48:34,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:34,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:34,341 INFO L418 AbstractCegarLoop]: === Iteration 131 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:34,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:34,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1808560402, now seen corresponding path program 1 times [2019-09-08 12:48:34,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:34,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:34,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:34,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:34,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:35,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:48:35,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:35,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:48:35,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:48:35,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:48:35,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:48:35,200 INFO L87 Difference]: Start difference. First operand 1288 states and 1666 transitions. Second operand 17 states. [2019-09-08 12:48:35,884 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:48:36,046 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:48:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:37,817 INFO L93 Difference]: Finished difference Result 1912 states and 2553 transitions. [2019-09-08 12:48:37,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:48:37,818 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2019-09-08 12:48:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:37,819 INFO L225 Difference]: With dead ends: 1912 [2019-09-08 12:48:37,819 INFO L226 Difference]: Without dead ends: 1442 [2019-09-08 12:48:37,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:48:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-09-08 12:48:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1186. [2019-09-08 12:48:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-09-08 12:48:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1533 transitions. [2019-09-08 12:48:38,266 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1533 transitions. Word has length 121 [2019-09-08 12:48:38,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:38,267 INFO L475 AbstractCegarLoop]: Abstraction has 1186 states and 1533 transitions. [2019-09-08 12:48:38,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:48:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1533 transitions. [2019-09-08 12:48:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:48:38,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:38,268 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,268 INFO L418 AbstractCegarLoop]: === Iteration 132 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:38,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:38,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1027949232, now seen corresponding path program 1 times [2019-09-08 12:48:38,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:38,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:38,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:38,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:38,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:39,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:39,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:48:39,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:48:39,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:48:39,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:48:39,094 INFO L87 Difference]: Start difference. First operand 1186 states and 1533 transitions. Second operand 17 states. [2019-09-08 12:48:39,784 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:48:39,927 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-08 12:48:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:42,877 INFO L93 Difference]: Finished difference Result 2483 states and 3340 transitions. [2019-09-08 12:48:42,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:48:42,878 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2019-09-08 12:48:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:42,880 INFO L225 Difference]: With dead ends: 2483 [2019-09-08 12:48:42,880 INFO L226 Difference]: Without dead ends: 2107 [2019-09-08 12:48:42,881 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:48:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2019-09-08 12:48:43,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 1092. [2019-09-08 12:48:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1092 states. [2019-09-08 12:48:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1406 transitions. [2019-09-08 12:48:43,320 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1406 transitions. Word has length 121 [2019-09-08 12:48:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:43,320 INFO L475 AbstractCegarLoop]: Abstraction has 1092 states and 1406 transitions. [2019-09-08 12:48:43,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:48:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1406 transitions. [2019-09-08 12:48:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:48:43,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:43,321 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:43,321 INFO L418 AbstractCegarLoop]: === Iteration 133 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:43,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:43,321 INFO L82 PathProgramCache]: Analyzing trace with hash 110556365, now seen corresponding path program 1 times [2019-09-08 12:48:43,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:43,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:43,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:43,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:43,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:45,153 WARN L188 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-08 12:48:46,374 INFO 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:48:46,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:46,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:48:46,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:48:46,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:48:46,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:48:46,375 INFO L87 Difference]: Start difference. First operand 1092 states and 1406 transitions. Second operand 31 states. [2019-09-08 12:48:46,594 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-08 12:48:47,697 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-09-08 12:48:47,885 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-09-08 12:48:48,491 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-08 12:48:48,938 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-09-08 12:48:49,460 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 106 [2019-09-08 12:48:50,095 WARN L188 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 124 [2019-09-08 12:48:53,112 WARN L188 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 162 DAG size of output: 143 [2019-09-08 12:48:53,451 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-09-08 12:48:53,739 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-09-08 12:48:53,946 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:49:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:13,056 INFO L93 Difference]: Finished difference Result 2693 states and 3606 transitions. [2019-09-08 12:49:13,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 12:49:13,056 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 121 [2019-09-08 12:49:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:13,059 INFO L225 Difference]: With dead ends: 2693 [2019-09-08 12:49:13,059 INFO L226 Difference]: Without dead ends: 2524 [2019-09-08 12:49:13,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=481, Invalid=2941, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 12:49:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2019-09-08 12:49:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 1115. [2019-09-08 12:49:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-09-08 12:49:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1436 transitions. [2019-09-08 12:49:13,513 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1436 transitions. Word has length 121 [2019-09-08 12:49:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:13,513 INFO L475 AbstractCegarLoop]: Abstraction has 1115 states and 1436 transitions. [2019-09-08 12:49:13,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:49:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1436 transitions. [2019-09-08 12:49:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:49:13,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:13,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:13,514 INFO L418 AbstractCegarLoop]: === Iteration 134 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:13,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:13,514 INFO L82 PathProgramCache]: Analyzing trace with hash 451619916, now seen corresponding path program 1 times [2019-09-08 12:49:13,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:13,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:13,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:13,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:13,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:14,344 INFO 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:49:14,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:14,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:49:14,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:49:14,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:49:14,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:49:14,345 INFO L87 Difference]: Start difference. First operand 1115 states and 1436 transitions. Second operand 17 states. [2019-09-08 12:49:15,089 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:49:15,233 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 12:49:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:19,694 INFO L93 Difference]: Finished difference Result 2358 states and 3160 transitions. [2019-09-08 12:49:19,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:49:19,695 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2019-09-08 12:49:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:19,697 INFO L225 Difference]: With dead ends: 2358 [2019-09-08 12:49:19,698 INFO L226 Difference]: Without dead ends: 2150 [2019-09-08 12:49:19,698 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:49:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2019-09-08 12:49:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1078. [2019-09-08 12:49:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2019-09-08 12:49:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1384 transitions. [2019-09-08 12:49:20,121 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1384 transitions. Word has length 121 [2019-09-08 12:49:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:20,121 INFO L475 AbstractCegarLoop]: Abstraction has 1078 states and 1384 transitions. [2019-09-08 12:49:20,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:49:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1384 transitions. [2019-09-08 12:49:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:49:20,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:20,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:20,122 INFO L418 AbstractCegarLoop]: === Iteration 135 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:20,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:20,122 INFO L82 PathProgramCache]: Analyzing trace with hash -312644520, now seen corresponding path program 1 times [2019-09-08 12:49:20,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:20,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:20,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:20,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:20,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:20,987 INFO 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:49:20,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:20,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:49:20,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:49:20,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:49:20,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:49:20,988 INFO L87 Difference]: Start difference. First operand 1078 states and 1384 transitions. Second operand 17 states. [2019-09-08 12:49:21,687 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:49:21,860 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:49:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:25,461 INFO L93 Difference]: Finished difference Result 2285 states and 3068 transitions. [2019-09-08 12:49:25,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:49:25,461 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2019-09-08 12:49:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:25,463 INFO L225 Difference]: With dead ends: 2285 [2019-09-08 12:49:25,463 INFO L226 Difference]: Without dead ends: 2029 [2019-09-08 12:49:25,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:49:25,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2019-09-08 12:49:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1046. [2019-09-08 12:49:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-09-08 12:49:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1343 transitions. [2019-09-08 12:49:25,910 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1343 transitions. Word has length 121 [2019-09-08 12:49:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:25,910 INFO L475 AbstractCegarLoop]: Abstraction has 1046 states and 1343 transitions. [2019-09-08 12:49:25,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:49:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1343 transitions. [2019-09-08 12:49:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:49:25,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:25,911 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:25,912 INFO L418 AbstractCegarLoop]: === Iteration 136 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1094768673, now seen corresponding path program 1 times [2019-09-08 12:49:25,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:25,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:25,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:25,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:25,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:27,003 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-08 12:49:27,158 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-08 12:49:27,320 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-08 12:49:27,499 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:49:27,680 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 12:49:27,885 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-08 12:49:28,066 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 12:49:28,245 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 12:49:28,431 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 12:49:30,350 INFO 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:49:30,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:30,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:49:30,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:49:30,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:49:30,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1162, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:49:30,352 INFO L87 Difference]: Start difference. First operand 1046 states and 1343 transitions. Second operand 36 states. [2019-09-08 12:49:31,004 WARN L188 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 153 [2019-09-08 12:49:32,047 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 12:49:32,233 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:49:32,438 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-08 12:49:32,687 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 12:49:32,966 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-08 12:49:33,241 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 12:49:33,583 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-08 12:49:34,441 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-08 12:49:34,961 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 95 [2019-09-08 12:49:35,540 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 104 [2019-09-08 12:49:36,206 WARN L188 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 113 [2019-09-08 12:49:36,949 WARN L188 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 122 [2019-09-08 12:49:37,860 WARN L188 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 143 [2019-09-08 12:49:38,356 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2019-09-08 12:49:38,880 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2019-09-08 12:49:39,195 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-08 12:49:39,654 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 12:49:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:57,696 INFO L93 Difference]: Finished difference Result 1725 states and 2263 transitions. [2019-09-08 12:49:57,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 12:49:57,696 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 121 [2019-09-08 12:49:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:57,699 INFO L225 Difference]: With dead ends: 1725 [2019-09-08 12:49:57,699 INFO L226 Difference]: Without dead ends: 1555 [2019-09-08 12:49:57,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=601, Invalid=2821, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 12:49:57,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-09-08 12:49:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1071. [2019-09-08 12:49:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-09-08 12:49:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1376 transitions. [2019-09-08 12:49:58,149 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1376 transitions. Word has length 121 [2019-09-08 12:49:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:58,149 INFO L475 AbstractCegarLoop]: Abstraction has 1071 states and 1376 transitions. [2019-09-08 12:49:58,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:49:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1376 transitions. [2019-09-08 12:49:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:49:58,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:58,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:58,151 INFO L418 AbstractCegarLoop]: === Iteration 137 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:58,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2049990917, now seen corresponding path program 1 times [2019-09-08 12:49:58,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:58,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:58,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:58,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:58,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:59,109 INFO 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:49:59,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:59,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:49:59,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:49:59,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:49:59,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:49:59,110 INFO L87 Difference]: Start difference. First operand 1071 states and 1376 transitions. Second operand 17 states. [2019-09-08 12:49:59,793 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 12:49:59,955 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 12:50:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:04,432 INFO L93 Difference]: Finished difference Result 2244 states and 3011 transitions. [2019-09-08 12:50:04,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:50:04,433 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2019-09-08 12:50:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:04,435 INFO L225 Difference]: With dead ends: 2244 [2019-09-08 12:50:04,435 INFO L226 Difference]: Without dead ends: 2032 [2019-09-08 12:50:04,435 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:50:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-09-08 12:50:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1051. [2019-09-08 12:50:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-09-08 12:50:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1347 transitions. [2019-09-08 12:50:04,906 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1347 transitions. Word has length 121 [2019-09-08 12:50:04,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:04,907 INFO L475 AbstractCegarLoop]: Abstraction has 1051 states and 1347 transitions. [2019-09-08 12:50:04,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:50:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1347 transitions. [2019-09-08 12:50:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:04,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:04,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:04,908 INFO L418 AbstractCegarLoop]: === Iteration 138 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:04,908 INFO L82 PathProgramCache]: Analyzing trace with hash -451129357, now seen corresponding path program 1 times [2019-09-08 12:50:04,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:04,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:04,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:04,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:04,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:05,488 INFO 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:50:05,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:05,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:50:05,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:50:05,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:50:05,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:50:05,489 INFO L87 Difference]: Start difference. First operand 1051 states and 1347 transitions. Second operand 12 states. [2019-09-08 12:50:09,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:09,159 INFO L93 Difference]: Finished difference Result 2412 states and 3291 transitions. [2019-09-08 12:50:09,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:50:09,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-09-08 12:50:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:09,161 INFO L225 Difference]: With dead ends: 2412 [2019-09-08 12:50:09,161 INFO L226 Difference]: Without dead ends: 2220 [2019-09-08 12:50:09,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:50:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2019-09-08 12:50:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1004. [2019-09-08 12:50:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-09-08 12:50:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1284 transitions. [2019-09-08 12:50:09,620 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1284 transitions. Word has length 122 [2019-09-08 12:50:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:09,620 INFO L475 AbstractCegarLoop]: Abstraction has 1004 states and 1284 transitions. [2019-09-08 12:50:09,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:50:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1284 transitions. [2019-09-08 12:50:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:09,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:09,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:09,621 INFO L418 AbstractCegarLoop]: === Iteration 139 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:09,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:09,621 INFO L82 PathProgramCache]: Analyzing trace with hash -915142073, now seen corresponding path program 1 times [2019-09-08 12:50:09,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:09,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:09,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:09,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:09,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:10,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:10,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:50:10,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:50:10,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:50:10,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:50:10,014 INFO L87 Difference]: Start difference. First operand 1004 states and 1284 transitions. Second operand 11 states. [2019-09-08 12:50:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:12,506 INFO L93 Difference]: Finished difference Result 2423 states and 3311 transitions. [2019-09-08 12:50:12,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:50:12,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 122 [2019-09-08 12:50:12,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:12,509 INFO L225 Difference]: With dead ends: 2423 [2019-09-08 12:50:12,509 INFO L226 Difference]: Without dead ends: 2163 [2019-09-08 12:50:12,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:50:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2019-09-08 12:50:12,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 910. [2019-09-08 12:50:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-08 12:50:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1159 transitions. [2019-09-08 12:50:12,922 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1159 transitions. Word has length 122 [2019-09-08 12:50:12,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:12,922 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1159 transitions. [2019-09-08 12:50:12,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:50:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1159 transitions. [2019-09-08 12:50:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:12,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:12,923 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:12,923 INFO L418 AbstractCegarLoop]: === Iteration 140 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:12,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1137545692, now seen corresponding path program 1 times [2019-09-08 12:50:12,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:12,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:12,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:12,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:12,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:13,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:13,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:50:13,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:50:13,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:50:13,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:50:13,780 INFO L87 Difference]: Start difference. First operand 910 states and 1159 transitions. Second operand 17 states. [2019-09-08 12:50:14,561 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 12:50:14,707 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:50:19,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:19,492 INFO L93 Difference]: Finished difference Result 1942 states and 2604 transitions. [2019-09-08 12:50:19,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:50:19,493 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:50:19,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:19,495 INFO L225 Difference]: With dead ends: 1942 [2019-09-08 12:50:19,495 INFO L226 Difference]: Without dead ends: 1773 [2019-09-08 12:50:19,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:50:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-08 12:50:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 910. [2019-09-08 12:50:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-08 12:50:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1157 transitions. [2019-09-08 12:50:19,927 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1157 transitions. Word has length 122 [2019-09-08 12:50:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:19,927 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1157 transitions. [2019-09-08 12:50:19,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:50:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1157 transitions. [2019-09-08 12:50:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:19,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:19,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:19,928 INFO L418 AbstractCegarLoop]: === Iteration 141 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:19,928 INFO L82 PathProgramCache]: Analyzing trace with hash -794969802, now seen corresponding path program 1 times [2019-09-08 12:50:19,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:19,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:19,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:19,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:19,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:20,781 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-08 12:50:20,948 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-08 12:50:21,113 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-08 12:50:21,702 INFO 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:50:21,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:21,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:50:21,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:50:21,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:50:21,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:50:21,703 INFO L87 Difference]: Start difference. First operand 910 states and 1157 transitions. Second operand 22 states. [2019-09-08 12:50:22,820 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-09-08 12:50:23,101 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-08 12:50:23,423 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-09-08 12:50:23,626 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-08 12:50:24,124 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-08 12:50:24,552 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-08 12:50:24,865 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-08 12:50:25,128 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-08 12:50:26,195 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2019-09-08 12:50:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:32,000 INFO L93 Difference]: Finished difference Result 2383 states and 3179 transitions. [2019-09-08 12:50:32,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:50:32,001 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-08 12:50:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:32,003 INFO L225 Difference]: With dead ends: 2383 [2019-09-08 12:50:32,003 INFO L226 Difference]: Without dead ends: 2210 [2019-09-08 12:50:32,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 12:50:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2019-09-08 12:50:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 916. [2019-09-08 12:50:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-08 12:50:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1163 transitions. [2019-09-08 12:50:32,450 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1163 transitions. Word has length 122 [2019-09-08 12:50:32,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:32,450 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1163 transitions. [2019-09-08 12:50:32,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:50:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1163 transitions. [2019-09-08 12:50:32,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:32,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:32,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:32,451 INFO L418 AbstractCegarLoop]: === Iteration 142 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:32,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:32,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1559234238, now seen corresponding path program 1 times [2019-09-08 12:50:32,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:32,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:32,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:32,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:33,346 INFO 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:50:33,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:33,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:50:33,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:50:33,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:50:33,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:50:33,347 INFO L87 Difference]: Start difference. First operand 916 states and 1163 transitions. Second operand 17 states. [2019-09-08 12:50:34,104 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-08 12:50:34,263 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-08 12:50:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:39,071 INFO L93 Difference]: Finished difference Result 1946 states and 2604 transitions. [2019-09-08 12:50:39,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:50:39,071 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:50:39,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:39,073 INFO L225 Difference]: With dead ends: 1946 [2019-09-08 12:50:39,073 INFO L226 Difference]: Without dead ends: 1773 [2019-09-08 12:50:39,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:50:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-08 12:50:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 915. [2019-09-08 12:50:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-09-08 12:50:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1160 transitions. [2019-09-08 12:50:39,511 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1160 transitions. Word has length 122 [2019-09-08 12:50:39,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:39,511 INFO L475 AbstractCegarLoop]: Abstraction has 915 states and 1160 transitions. [2019-09-08 12:50:39,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:50:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1160 transitions. [2019-09-08 12:50:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:39,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:39,512 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:39,512 INFO L418 AbstractCegarLoop]: === Iteration 143 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1168980121, now seen corresponding path program 1 times [2019-09-08 12:50:39,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:39,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:39,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:39,961 INFO 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:50:39,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:39,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:50:39,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:50:39,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:50:39,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:50:39,962 INFO L87 Difference]: Start difference. First operand 915 states and 1160 transitions. Second operand 10 states. [2019-09-08 12:50:42,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:42,841 INFO L93 Difference]: Finished difference Result 1917 states and 2514 transitions. [2019-09-08 12:50:42,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:50:42,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2019-09-08 12:50:42,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:42,844 INFO L225 Difference]: With dead ends: 1917 [2019-09-08 12:50:42,844 INFO L226 Difference]: Without dead ends: 1617 [2019-09-08 12:50:42,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:50:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-08 12:50:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 781. [2019-09-08 12:50:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-09-08 12:50:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 998 transitions. [2019-09-08 12:50:43,247 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 998 transitions. Word has length 122 [2019-09-08 12:50:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:43,248 INFO L475 AbstractCegarLoop]: Abstraction has 781 states and 998 transitions. [2019-09-08 12:50:43,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:50:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 998 transitions. [2019-09-08 12:50:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:43,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:43,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:43,249 INFO L418 AbstractCegarLoop]: === Iteration 144 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:43,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:43,249 INFO L82 PathProgramCache]: Analyzing trace with hash 648992993, now seen corresponding path program 1 times [2019-09-08 12:50:43,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:43,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:43,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:43,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:43,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:44,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:44,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:50:44,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:50:44,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:50:44,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:50:44,045 INFO L87 Difference]: Start difference. First operand 781 states and 998 transitions. Second operand 16 states. [2019-09-08 12:50:44,742 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-08 12:50:44,908 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-08 12:50:45,050 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-08 12:50:45,230 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-08 12:50:45,419 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-08 12:50:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:48,248 INFO L93 Difference]: Finished difference Result 2181 states and 2999 transitions. [2019-09-08 12:50:48,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:50:48,249 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 122 [2019-09-08 12:50:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:48,250 INFO L225 Difference]: With dead ends: 2181 [2019-09-08 12:50:48,250 INFO L226 Difference]: Without dead ends: 1925 [2019-09-08 12:50:48,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:50:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-09-08 12:50:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 691. [2019-09-08 12:50:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-08 12:50:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 879 transitions. [2019-09-08 12:50:48,639 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 879 transitions. Word has length 122 [2019-09-08 12:50:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:48,639 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 879 transitions. [2019-09-08 12:50:48,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:50:48,639 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 879 transitions. [2019-09-08 12:50:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:48,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:48,640 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:48,640 INFO L418 AbstractCegarLoop]: === Iteration 145 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:48,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2120709764, now seen corresponding path program 1 times [2019-09-08 12:50:48,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:48,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:48,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:48,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:48,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:49,864 INFO 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:50:49,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:49,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:50:49,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:50:49,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:50:49,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:50:49,865 INFO L87 Difference]: Start difference. First operand 691 states and 879 transitions. Second operand 21 states. [2019-09-08 12:50:51,087 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 12:50:51,412 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-08 12:50:51,603 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-08 12:50:51,789 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-08 12:50:52,022 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-08 12:50:52,517 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:50:52,820 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-08 12:50:53,110 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-08 12:50:53,421 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-08 12:50:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:57,883 INFO L93 Difference]: Finished difference Result 2005 states and 2740 transitions. [2019-09-08 12:50:57,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:50:57,884 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 122 [2019-09-08 12:50:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:57,885 INFO L225 Difference]: With dead ends: 2005 [2019-09-08 12:50:57,885 INFO L226 Difference]: Without dead ends: 1836 [2019-09-08 12:50:57,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 12:50:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2019-09-08 12:50:58,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 691. [2019-09-08 12:50:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-08 12:50:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 877 transitions. [2019-09-08 12:50:58,267 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 877 transitions. Word has length 122 [2019-09-08 12:50:58,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:58,267 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 877 transitions. [2019-09-08 12:50:58,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:50:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 877 transitions. [2019-09-08 12:50:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:58,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:58,268 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:58,268 INFO L418 AbstractCegarLoop]: === Iteration 146 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:58,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1818479085, now seen corresponding path program 1 times [2019-09-08 12:50:58,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:58,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:58,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:58,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:59,084 INFO 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:50:59,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:59,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:50:59,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:50:59,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:50:59,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:50:59,085 INFO L87 Difference]: Start difference. First operand 691 states and 877 transitions. Second operand 17 states. [2019-09-08 12:50:59,803 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:50:59,944 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 12:51:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:02,934 INFO L93 Difference]: Finished difference Result 1615 states and 2193 transitions. [2019-09-08 12:51:02,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:51:02,935 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:51:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:02,936 INFO L225 Difference]: With dead ends: 1615 [2019-09-08 12:51:02,936 INFO L226 Difference]: Without dead ends: 1415 [2019-09-08 12:51:02,937 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:51:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2019-09-08 12:51:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 677. [2019-09-08 12:51:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-09-08 12:51:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 857 transitions. [2019-09-08 12:51:03,315 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 857 transitions. Word has length 122 [2019-09-08 12:51:03,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:03,315 INFO L475 AbstractCegarLoop]: Abstraction has 677 states and 857 transitions. [2019-09-08 12:51:03,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:51:03,315 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 857 transitions. [2019-09-08 12:51:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:51:03,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:03,316 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:03,316 INFO L418 AbstractCegarLoop]: === Iteration 147 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:03,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:03,316 INFO L82 PathProgramCache]: Analyzing trace with hash -208354186, now seen corresponding path program 1 times [2019-09-08 12:51:03,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:03,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:03,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:03,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:03,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:04,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:04,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:51:04,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:51:04,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:51:04,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:51:04,152 INFO L87 Difference]: Start difference. First operand 677 states and 857 transitions. Second operand 16 states. [2019-09-08 12:51:04,976 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-08 12:51:05,154 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 12:51:05,330 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 12:51:05,541 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:51:08,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:08,628 INFO L93 Difference]: Finished difference Result 1407 states and 1858 transitions. [2019-09-08 12:51:08,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:51:08,628 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 122 [2019-09-08 12:51:08,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:08,629 INFO L225 Difference]: With dead ends: 1407 [2019-09-08 12:51:08,629 INFO L226 Difference]: Without dead ends: 1240 [2019-09-08 12:51:08,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:51:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2019-09-08 12:51:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 676. [2019-09-08 12:51:09,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-09-08 12:51:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 855 transitions. [2019-09-08 12:51:09,032 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 855 transitions. Word has length 122 [2019-09-08 12:51:09,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:09,032 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 855 transitions. [2019-09-08 12:51:09,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:51:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 855 transitions. [2019-09-08 12:51:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:51:09,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:09,033 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:09,033 INFO L418 AbstractCegarLoop]: === Iteration 148 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:09,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash -651909446, now seen corresponding path program 1 times [2019-09-08 12:51:09,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:09,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:09,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:09,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:09,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:10,274 INFO 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:51:10,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:10,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:51:10,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:51:10,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:51:10,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:10,275 INFO L87 Difference]: Start difference. First operand 676 states and 855 transitions. Second operand 21 states. [2019-09-08 12:51:10,399 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 12:51:11,341 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 12:51:11,615 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-08 12:51:12,466 WARN L188 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-08 12:51:12,661 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 12:51:12,845 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 12:51:13,035 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-08 12:51:13,598 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:51:14,052 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-08 12:51:14,379 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42