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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:41:40,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:41:40,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:41:40,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:41:40,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:41:40,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:41:40,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:41:40,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:41:40,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:41:40,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:41:40,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:41:40,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:41:40,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:41:40,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:41:40,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:41:40,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:41:40,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:41:40,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:41:40,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:41:40,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:41:40,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:41:40,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:41:40,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:41:40,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:41:40,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:41:40,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:41:40,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:41:40,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:41:40,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:41:40,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:41:40,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:41:40,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:41:40,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:41:40,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:41:40,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:41:40,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:41:40,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:41:40,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:41:40,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:41:40,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:41:40,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:41:40,517 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:41:40,532 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:41:40,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:41:40,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:41:40,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:41:40,534 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:41:40,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:41:40,534 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:41:40,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:41:40,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:41:40,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:41:40,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:41:40,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:41:40,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:41:40,536 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:41:40,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:41:40,536 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:41:40,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:41:40,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:41:40,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:41:40,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:41:40,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:41:40,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:41:40,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:41:40,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:41:40,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:41:40,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:41:40,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:41:40,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:41:40,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:41:40,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:41:40,580 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:41:40,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:41:40,584 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:41:40,585 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:41:40,586 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2019-09-08 12:41:40,647 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec9b8640/593b7e0363ec4a748739de61b123b904/FLAG6f9c85ed3 [2019-09-08 12:41:41,382 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:41:41,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2019-09-08 12:41:41,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec9b8640/593b7e0363ec4a748739de61b123b904/FLAG6f9c85ed3 [2019-09-08 12:41:41,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec9b8640/593b7e0363ec4a748739de61b123b904 [2019-09-08 12:41:41,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:41:41,944 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:41:41,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:41:41,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:41:41,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:41:41,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:41:41" (1/1) ... [2019-09-08 12:41:41,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@750a9784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:41, skipping insertion in model container [2019-09-08 12:41:41,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:41:41" (1/1) ... [2019-09-08 12:41:41,962 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:41:42,221 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:41:44,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:41:44,367 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:41:45,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:41:45,878 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:41:45,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45 WrapperNode [2019-09-08 12:41:45,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:41:45,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:41:45,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:41:45,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:41:45,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:45,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:45,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:45,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:46,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:46,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:46,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (1/1) ... [2019-09-08 12:41:46,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:41:46,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:41:46,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:41:46,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:41:46,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (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:41:46,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:41:46,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:41:46,323 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:41:46,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:41:46,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:41:46,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:41:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:41:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:41:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:41:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:41:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:41:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:41:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:41:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:41:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:41:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:41:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:41:52,480 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:41:52,481 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:41:52,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:41:52 BoogieIcfgContainer [2019-09-08 12:41:52,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:41:52,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:41:52,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:41:52,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:41:52,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:41:41" (1/3) ... [2019-09-08 12:41:52,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25843032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:41:52, skipping insertion in model container [2019-09-08 12:41:52,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:41:45" (2/3) ... [2019-09-08 12:41:52,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25843032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:41:52, skipping insertion in model container [2019-09-08 12:41:52,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:41:52" (3/3) ... [2019-09-08 12:41:52,495 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2019-09-08 12:41:52,506 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:41:52,537 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-09-08 12:41:52,555 INFO L252 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-09-08 12:41:52,612 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:41:52,613 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:41:52,613 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:41:52,613 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:41:52,614 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:41:52,614 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:41:52,614 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:41:52,614 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:41:52,614 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:41:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states. [2019-09-08 12:41:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:41:52,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:52,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:52,705 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:52,711 INFO L82 PathProgramCache]: Analyzing trace with hash 215023617, now seen corresponding path program 1 times [2019-09-08 12:41:52,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:52,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:52,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:52,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:52,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:53,547 INFO L134 CoverageAnalysis]: 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:53,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:53,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:53,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:53,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:53,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:53,573 INFO L87 Difference]: Start difference. First operand 2087 states. Second operand 5 states. [2019-09-08 12:41:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:55,237 INFO L93 Difference]: Finished difference Result 3103 states and 5500 transitions. [2019-09-08 12:41:55,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:55,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-08 12:41:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:55,266 INFO L225 Difference]: With dead ends: 3103 [2019-09-08 12:41:55,266 INFO L226 Difference]: Without dead ends: 1574 [2019-09-08 12:41:55,275 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:41:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2019-09-08 12:41:55,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2019-09-08 12:41:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2019-09-08 12:41:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2048 transitions. [2019-09-08 12:41:55,454 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2048 transitions. Word has length 105 [2019-09-08 12:41:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:55,456 INFO L475 AbstractCegarLoop]: Abstraction has 1574 states and 2048 transitions. [2019-09-08 12:41:55,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2048 transitions. [2019-09-08 12:41:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:41:55,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:55,470 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:55,471 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:55,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:55,473 INFO L82 PathProgramCache]: Analyzing trace with hash -650934382, now seen corresponding path program 1 times [2019-09-08 12:41:55,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:55,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:55,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:55,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:41:55,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:55,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:55,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:55,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:55,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:55,991 INFO L87 Difference]: Start difference. First operand 1574 states and 2048 transitions. Second operand 5 states. [2019-09-08 12:41:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:57,263 INFO L93 Difference]: Finished difference Result 2578 states and 3463 transitions. [2019-09-08 12:41:57,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:57,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-08 12:41:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:57,274 INFO L225 Difference]: With dead ends: 2578 [2019-09-08 12:41:57,274 INFO L226 Difference]: Without dead ends: 1321 [2019-09-08 12:41:57,278 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:41:57,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-09-08 12:41:57,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2019-09-08 12:41:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-09-08 12:41:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1762 transitions. [2019-09-08 12:41:57,335 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1762 transitions. Word has length 106 [2019-09-08 12:41:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:57,336 INFO L475 AbstractCegarLoop]: Abstraction has 1321 states and 1762 transitions. [2019-09-08 12:41:57,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1762 transitions. [2019-09-08 12:41:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:41:57,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:57,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] [2019-09-08 12:41:57,342 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:57,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:57,343 INFO L82 PathProgramCache]: Analyzing trace with hash 813965667, now seen corresponding path program 1 times [2019-09-08 12:41:57,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:57,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:57,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:57,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:57,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:57,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:57,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:57,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:57,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:57,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:57,629 INFO L87 Difference]: Start difference. First operand 1321 states and 1762 transitions. Second operand 5 states. [2019-09-08 12:41:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:59,681 INFO L93 Difference]: Finished difference Result 2325 states and 3176 transitions. [2019-09-08 12:41:59,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:41:59,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-08 12:41:59,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:59,689 INFO L225 Difference]: With dead ends: 2325 [2019-09-08 12:41:59,690 INFO L226 Difference]: Without dead ends: 1241 [2019-09-08 12:41:59,693 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:41:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-09-08 12:41:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1241. [2019-09-08 12:41:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-09-08 12:41:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1665 transitions. [2019-09-08 12:41:59,741 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1665 transitions. Word has length 107 [2019-09-08 12:41:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:59,742 INFO L475 AbstractCegarLoop]: Abstraction has 1241 states and 1665 transitions. [2019-09-08 12:41:59,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:41:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1665 transitions. [2019-09-08 12:41:59,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:41:59,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:59,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:59,748 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:59,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1237924957, now seen corresponding path program 1 times [2019-09-08 12:41:59,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:59,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:59,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:59,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:59,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:59,957 INFO L134 CoverageAnalysis]: 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,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:41:59,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:41:59,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:41:59,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:41:59,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:41:59,959 INFO L87 Difference]: Start difference. First operand 1241 states and 1665 transitions. Second operand 5 states. [2019-09-08 12:42:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:01,101 INFO L93 Difference]: Finished difference Result 2245 states and 3078 transitions. [2019-09-08 12:42:01,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:42:01,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-08 12:42:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:01,108 INFO L225 Difference]: With dead ends: 2245 [2019-09-08 12:42:01,108 INFO L226 Difference]: Without dead ends: 1159 [2019-09-08 12:42:01,110 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:42:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-09-08 12:42:01,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2019-09-08 12:42:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2019-09-08 12:42:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1574 transitions. [2019-09-08 12:42:01,160 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1574 transitions. Word has length 108 [2019-09-08 12:42:01,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:01,161 INFO L475 AbstractCegarLoop]: Abstraction has 1159 states and 1574 transitions. [2019-09-08 12:42:01,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:42:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1574 transitions. [2019-09-08 12:42:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:42:01,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:01,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:01,165 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:01,166 INFO L82 PathProgramCache]: Analyzing trace with hash 525572155, now seen corresponding path program 1 times [2019-09-08 12:42:01,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:01,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:01,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:01,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:01,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:01,371 INFO L134 CoverageAnalysis]: 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:01,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:01,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:42:01,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:42:01,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:42:01,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:42:01,376 INFO L87 Difference]: Start difference. First operand 1159 states and 1574 transitions. Second operand 5 states. [2019-09-08 12:42:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:02,473 INFO L93 Difference]: Finished difference Result 2163 states and 2986 transitions. [2019-09-08 12:42:02,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:42:02,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 12:42:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:02,480 INFO L225 Difference]: With dead ends: 2163 [2019-09-08 12:42:02,480 INFO L226 Difference]: Without dead ends: 1121 [2019-09-08 12:42:02,485 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:42:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-09-08 12:42:02,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2019-09-08 12:42:02,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-09-08 12:42:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1531 transitions. [2019-09-08 12:42:02,537 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1531 transitions. Word has length 109 [2019-09-08 12:42:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:02,538 INFO L475 AbstractCegarLoop]: Abstraction has 1121 states and 1531 transitions. [2019-09-08 12:42:02,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:42:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1531 transitions. [2019-09-08 12:42:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:42:02,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:02,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,546 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:02,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:02,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1784526045, now seen corresponding path program 1 times [2019-09-08 12:42:02,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:02,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:02,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:02,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:02,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:02,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:02,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:42:02,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:42:02,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:42:02,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:42:02,762 INFO L87 Difference]: Start difference. First operand 1121 states and 1531 transitions. Second operand 5 states. [2019-09-08 12:42:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:03,757 INFO L93 Difference]: Finished difference Result 2125 states and 2942 transitions. [2019-09-08 12:42:03,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:42:03,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-08 12:42:03,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:03,765 INFO L225 Difference]: With dead ends: 2125 [2019-09-08 12:42:03,765 INFO L226 Difference]: Without dead ends: 1096 [2019-09-08 12:42:03,768 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:42:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2019-09-08 12:42:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1096. [2019-09-08 12:42:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2019-09-08 12:42:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1503 transitions. [2019-09-08 12:42:03,836 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1503 transitions. Word has length 110 [2019-09-08 12:42:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:03,837 INFO L475 AbstractCegarLoop]: Abstraction has 1096 states and 1503 transitions. [2019-09-08 12:42:03,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:42:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1503 transitions. [2019-09-08 12:42:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:42:03,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:03,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,843 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:03,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:03,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1947358668, now seen corresponding path program 1 times [2019-09-08 12:42:03,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:03,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:03,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:03,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:03,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:04,087 INFO L134 CoverageAnalysis]: 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:04,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:04,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:42:04,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:42:04,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:42:04,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:42:04,089 INFO L87 Difference]: Start difference. First operand 1096 states and 1503 transitions. Second operand 5 states. [2019-09-08 12:42:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:05,257 INFO L93 Difference]: Finished difference Result 2100 states and 2913 transitions. [2019-09-08 12:42:05,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:42:05,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-08 12:42:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:05,270 INFO L225 Difference]: With dead ends: 2100 [2019-09-08 12:42:05,270 INFO L226 Difference]: Without dead ends: 1088 [2019-09-08 12:42:05,273 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:42:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-08 12:42:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2019-09-08 12:42:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1493 transitions. [2019-09-08 12:42:05,325 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1493 transitions. Word has length 111 [2019-09-08 12:42:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:05,326 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1493 transitions. [2019-09-08 12:42:05,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:42:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1493 transitions. [2019-09-08 12:42:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:42:05,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:05,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,330 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:05,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:05,330 INFO L82 PathProgramCache]: Analyzing trace with hash 386796312, now seen corresponding path program 1 times [2019-09-08 12:42:05,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:05,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:05,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:05,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:05,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:05,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:05,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:42:05,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:42:05,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:42:05,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:42:05,708 INFO L87 Difference]: Start difference. First operand 1088 states and 1493 transitions. Second operand 8 states. [2019-09-08 12:42:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:07,961 INFO L93 Difference]: Finished difference Result 2000 states and 2652 transitions. [2019-09-08 12:42:07,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:42:07,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-09-08 12:42:07,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:07,968 INFO L225 Difference]: With dead ends: 2000 [2019-09-08 12:42:07,968 INFO L226 Difference]: Without dead ends: 1415 [2019-09-08 12:42:07,972 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:42:07,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2019-09-08 12:42:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1088. [2019-09-08 12:42:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1492 transitions. [2019-09-08 12:42:08,045 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1492 transitions. Word has length 112 [2019-09-08 12:42:08,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:08,046 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1492 transitions. [2019-09-08 12:42:08,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:42:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1492 transitions. [2019-09-08 12:42:08,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:42:08,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:08,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,050 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:08,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:08,051 INFO L82 PathProgramCache]: Analyzing trace with hash -47028881, now seen corresponding path program 1 times [2019-09-08 12:42:08,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:08,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:08,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:08,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:08,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:08,400 INFO L134 CoverageAnalysis]: 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,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:08,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:08,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:08,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:08,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:08,401 INFO L87 Difference]: Start difference. First operand 1088 states and 1492 transitions. Second operand 9 states. [2019-09-08 12:42:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:12,038 INFO L93 Difference]: Finished difference Result 2158 states and 2992 transitions. [2019-09-08 12:42:12,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:12,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-08 12:42:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:12,049 INFO L225 Difference]: With dead ends: 2158 [2019-09-08 12:42:12,049 INFO L226 Difference]: Without dead ends: 1850 [2019-09-08 12:42:12,050 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:42:12,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2019-09-08 12:42:12,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1088. [2019-09-08 12:42:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1491 transitions. [2019-09-08 12:42:12,128 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1491 transitions. Word has length 112 [2019-09-08 12:42:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:12,129 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1491 transitions. [2019-09-08 12:42:12,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1491 transitions. [2019-09-08 12:42:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:42:12,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:12,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] [2019-09-08 12:42:12,134 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:12,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:12,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1133415737, now seen corresponding path program 1 times [2019-09-08 12:42:12,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:12,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:12,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:12,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:12,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:12,429 INFO L134 CoverageAnalysis]: 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:12,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:12,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:12,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:12,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:12,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:12,431 INFO L87 Difference]: Start difference. First operand 1088 states and 1491 transitions. Second operand 9 states. [2019-09-08 12:42:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:15,516 INFO L93 Difference]: Finished difference Result 1974 states and 2726 transitions. [2019-09-08 12:42:15,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:15,517 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-09-08 12:42:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:15,526 INFO L225 Difference]: With dead ends: 1974 [2019-09-08 12:42:15,526 INFO L226 Difference]: Without dead ends: 1838 [2019-09-08 12:42:15,527 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:42:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-08 12:42:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-08 12:42:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1490 transitions. [2019-09-08 12:42:15,599 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1490 transitions. Word has length 112 [2019-09-08 12:42:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:15,600 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1490 transitions. [2019-09-08 12:42:15,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1490 transitions. [2019-09-08 12:42:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:15,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:15,603 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,604 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:15,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1339963100, now seen corresponding path program 1 times [2019-09-08 12:42:15,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:15,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:15,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:15,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:15,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:15,922 INFO L134 CoverageAnalysis]: 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,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:15,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:15,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:15,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:15,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:15,924 INFO L87 Difference]: Start difference. First operand 1088 states and 1490 transitions. Second operand 9 states. [2019-09-08 12:42:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:19,551 INFO L93 Difference]: Finished difference Result 2208 states and 3036 transitions. [2019-09-08 12:42:19,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:19,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:19,562 INFO L225 Difference]: With dead ends: 2208 [2019-09-08 12:42:19,562 INFO L226 Difference]: Without dead ends: 1850 [2019-09-08 12:42:19,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:42:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2019-09-08 12:42:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1088. [2019-09-08 12:42:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1489 transitions. [2019-09-08 12:42:19,640 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1489 transitions. Word has length 114 [2019-09-08 12:42:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:19,640 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1489 transitions. [2019-09-08 12:42:19,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1489 transitions. [2019-09-08 12:42:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:19,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:19,643 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,644 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:19,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1679335211, now seen corresponding path program 1 times [2019-09-08 12:42:19,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:19,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:19,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:19,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:19,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:19,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:42:19,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:19,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:19,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:19,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:19,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:19,906 INFO L87 Difference]: Start difference. First operand 1088 states and 1489 transitions. Second operand 9 states. [2019-09-08 12:42:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:23,021 INFO L93 Difference]: Finished difference Result 1974 states and 2723 transitions. [2019-09-08 12:42:23,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:23,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:23,030 INFO L225 Difference]: With dead ends: 1974 [2019-09-08 12:42:23,030 INFO L226 Difference]: Without dead ends: 1838 [2019-09-08 12:42:23,031 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:42:23,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-08 12:42:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-08 12:42:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1488 transitions. [2019-09-08 12:42:23,108 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1488 transitions. Word has length 114 [2019-09-08 12:42:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:23,108 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1488 transitions. [2019-09-08 12:42:23,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1488 transitions. [2019-09-08 12:42:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:23,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:23,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] [2019-09-08 12:42:23,112 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:23,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:23,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1092834862, now seen corresponding path program 1 times [2019-09-08 12:42:23,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:23,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:23,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:23,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:23,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:23,340 INFO L134 CoverageAnalysis]: 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:23,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:23,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:23,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:23,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:23,342 INFO L87 Difference]: Start difference. First operand 1088 states and 1488 transitions. Second operand 9 states. [2019-09-08 12:42:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:27,682 INFO L93 Difference]: Finished difference Result 2051 states and 2831 transitions. [2019-09-08 12:42:27,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:27,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:27,690 INFO L225 Difference]: With dead ends: 2051 [2019-09-08 12:42:27,690 INFO L226 Difference]: Without dead ends: 1846 [2019-09-08 12:42:27,691 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:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2019-09-08 12:42:27,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1088. [2019-09-08 12:42:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:27,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1487 transitions. [2019-09-08 12:42:27,771 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1487 transitions. Word has length 114 [2019-09-08 12:42:27,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:27,772 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1487 transitions. [2019-09-08 12:42:27,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:27,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1487 transitions. [2019-09-08 12:42:27,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:27,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:27,774 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,775 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:27,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:27,776 INFO L82 PathProgramCache]: Analyzing trace with hash -739954808, now seen corresponding path program 1 times [2019-09-08 12:42:27,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:27,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:27,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:27,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:27,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:28,011 INFO L134 CoverageAnalysis]: 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:28,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:28,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:28,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:28,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:28,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:28,013 INFO L87 Difference]: Start difference. First operand 1088 states and 1487 transitions. Second operand 9 states. [2019-09-08 12:42:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:32,117 INFO L93 Difference]: Finished difference Result 2051 states and 2834 transitions. [2019-09-08 12:42:32,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:32,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:32,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:32,124 INFO L225 Difference]: With dead ends: 2051 [2019-09-08 12:42:32,124 INFO L226 Difference]: Without dead ends: 1846 [2019-09-08 12:42:32,125 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:32,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2019-09-08 12:42:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1088. [2019-09-08 12:42:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1486 transitions. [2019-09-08 12:42:32,207 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1486 transitions. Word has length 114 [2019-09-08 12:42:32,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:32,208 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1486 transitions. [2019-09-08 12:42:32,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1486 transitions. [2019-09-08 12:42:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:32,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:32,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] [2019-09-08 12:42:32,211 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:32,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:32,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1364856601, now seen corresponding path program 1 times [2019-09-08 12:42:32,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:32,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:32,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:32,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:32,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:32,476 INFO L134 CoverageAnalysis]: 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:32,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:32,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:32,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:32,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:32,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:32,478 INFO L87 Difference]: Start difference. First operand 1088 states and 1486 transitions. Second operand 9 states. [2019-09-08 12:42:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:36,413 INFO L93 Difference]: Finished difference Result 1974 states and 2721 transitions. [2019-09-08 12:42:36,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:36,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:36,420 INFO L225 Difference]: With dead ends: 1974 [2019-09-08 12:42:36,420 INFO L226 Difference]: Without dead ends: 1838 [2019-09-08 12:42:36,422 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:42:36,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-08 12:42:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-08 12:42:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1485 transitions. [2019-09-08 12:42:36,530 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1485 transitions. Word has length 114 [2019-09-08 12:42:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:36,530 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1485 transitions. [2019-09-08 12:42:36,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1485 transitions. [2019-09-08 12:42:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:36,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:36,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:36,534 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:36,534 INFO L82 PathProgramCache]: Analyzing trace with hash -327442449, now seen corresponding path program 1 times [2019-09-08 12:42:36,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:36,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:36,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:36,800 INFO L134 CoverageAnalysis]: 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:36,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:36,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:36,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:36,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:36,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:36,802 INFO L87 Difference]: Start difference. First operand 1088 states and 1485 transitions. Second operand 9 states. [2019-09-08 12:42:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:40,732 INFO L93 Difference]: Finished difference Result 1967 states and 2713 transitions. [2019-09-08 12:42:40,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:40,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:40,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:40,741 INFO L225 Difference]: With dead ends: 1967 [2019-09-08 12:42:40,741 INFO L226 Difference]: Without dead ends: 1838 [2019-09-08 12:42:40,742 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:42:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-08 12:42:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-08 12:42:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1484 transitions. [2019-09-08 12:42:40,829 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1484 transitions. Word has length 114 [2019-09-08 12:42:40,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:40,830 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1484 transitions. [2019-09-08 12:42:40,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1484 transitions. [2019-09-08 12:42:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:42:40,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:40,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] [2019-09-08 12:42:40,833 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:40,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:40,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1397895822, now seen corresponding path program 1 times [2019-09-08 12:42:40,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:40,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:40,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:40,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:40,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:41,078 INFO L134 CoverageAnalysis]: 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,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:41,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:41,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:41,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:41,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:41,080 INFO L87 Difference]: Start difference. First operand 1088 states and 1484 transitions. Second operand 9 states. [2019-09-08 12:42:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:45,455 INFO L93 Difference]: Finished difference Result 2030 states and 2807 transitions. [2019-09-08 12:42:45,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:45,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-09-08 12:42:45,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:45,465 INFO L225 Difference]: With dead ends: 2030 [2019-09-08 12:42:45,465 INFO L226 Difference]: Without dead ends: 1846 [2019-09-08 12:42:45,467 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:45,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2019-09-08 12:42:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1088. [2019-09-08 12:42:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1483 transitions. [2019-09-08 12:42:45,539 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1483 transitions. Word has length 114 [2019-09-08 12:42:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:45,540 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1483 transitions. [2019-09-08 12:42:45,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:45,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1483 transitions. [2019-09-08 12:42:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:42:45,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:45,543 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,543 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:45,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:45,544 INFO L82 PathProgramCache]: Analyzing trace with hash -577271375, now seen corresponding path program 1 times [2019-09-08 12:42:45,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:45,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:45,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:45,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:45,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:45,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:45,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:45,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:45,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:45,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:45,775 INFO L87 Difference]: Start difference. First operand 1088 states and 1483 transitions. Second operand 9 states. [2019-09-08 12:42:49,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:49,107 INFO L93 Difference]: Finished difference Result 1933 states and 2654 transitions. [2019-09-08 12:42:49,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:49,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:42:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:49,114 INFO L225 Difference]: With dead ends: 1933 [2019-09-08 12:42:49,114 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:42:49,115 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:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:42:49,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:42:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1482 transitions. [2019-09-08 12:42:49,192 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1482 transitions. Word has length 116 [2019-09-08 12:42:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:49,192 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1482 transitions. [2019-09-08 12:42:49,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1482 transitions. [2019-09-08 12:42:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:42:49,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:49,195 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:42:49,195 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:49,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:49,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1087651688, now seen corresponding path program 1 times [2019-09-08 12:42:49,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:49,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:49,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:49,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:49,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:49,426 INFO L134 CoverageAnalysis]: 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:49,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:49,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:49,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:49,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:49,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:49,430 INFO L87 Difference]: Start difference. First operand 1088 states and 1482 transitions. Second operand 9 states. [2019-09-08 12:42:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:52,878 INFO L93 Difference]: Finished difference Result 1988 states and 2730 transitions. [2019-09-08 12:42:52,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:52,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:42:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:52,884 INFO L225 Difference]: With dead ends: 1988 [2019-09-08 12:42:52,884 INFO L226 Difference]: Without dead ends: 1838 [2019-09-08 12:42:52,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:42:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-08 12:42:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-08 12:42:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1481 transitions. [2019-09-08 12:42:52,957 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1481 transitions. Word has length 116 [2019-09-08 12:42:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:52,957 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1481 transitions. [2019-09-08 12:42:52,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1481 transitions. [2019-09-08 12:42:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:42:52,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:52,960 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,960 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:52,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:52,961 INFO L82 PathProgramCache]: Analyzing trace with hash -831066789, now seen corresponding path program 1 times [2019-09-08 12:42:52,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:52,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:52,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:52,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:52,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:42:53,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:53,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:53,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:53,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:53,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:53,205 INFO L87 Difference]: Start difference. First operand 1088 states and 1481 transitions. Second operand 9 states. [2019-09-08 12:42:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:57,413 INFO L93 Difference]: Finished difference Result 2080 states and 2850 transitions. [2019-09-08 12:42:57,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:42:57,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:42:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:57,419 INFO L225 Difference]: With dead ends: 2080 [2019-09-08 12:42:57,419 INFO L226 Difference]: Without dead ends: 1846 [2019-09-08 12:42:57,420 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:57,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2019-09-08 12:42:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1088. [2019-09-08 12:42:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:42:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1480 transitions. [2019-09-08 12:42:57,510 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1480 transitions. Word has length 116 [2019-09-08 12:42:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:42:57,510 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1480 transitions. [2019-09-08 12:42:57,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:42:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1480 transitions. [2019-09-08 12:42:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:42:57,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:42:57,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] [2019-09-08 12:42:57,513 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:42:57,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:42:57,513 INFO L82 PathProgramCache]: Analyzing trace with hash 755251996, now seen corresponding path program 1 times [2019-09-08 12:42:57,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:42:57,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:42:57,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:57,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:42:57,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:42:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:42:57,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:42:57,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:42:57,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:42:57,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:42:57,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:42:57,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:42:57,739 INFO L87 Difference]: Start difference. First operand 1088 states and 1480 transitions. Second operand 9 states. [2019-09-08 12:43:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:01,066 INFO L93 Difference]: Finished difference Result 1739 states and 2337 transitions. [2019-09-08 12:43:01,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:01,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:01,072 INFO L225 Difference]: With dead ends: 1739 [2019-09-08 12:43:01,072 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:43:01,073 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:01,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:43:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:43:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1479 transitions. [2019-09-08 12:43:01,184 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1479 transitions. Word has length 116 [2019-09-08 12:43:01,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:01,184 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1479 transitions. [2019-09-08 12:43:01,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1479 transitions. [2019-09-08 12:43:01,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:01,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:01,187 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,187 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:01,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:01,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1390122634, now seen corresponding path program 1 times [2019-09-08 12:43:01,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:01,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:01,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:01,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:01,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:01,410 INFO L134 CoverageAnalysis]: 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:01,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:01,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:01,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:01,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:01,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:01,412 INFO L87 Difference]: Start difference. First operand 1088 states and 1479 transitions. Second operand 9 states. [2019-09-08 12:43:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:04,711 INFO L93 Difference]: Finished difference Result 1822 states and 2459 transitions. [2019-09-08 12:43:04,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:04,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:04,720 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:43:04,720 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:43:04,721 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:04,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:43:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:43:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1478 transitions. [2019-09-08 12:43:04,803 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1478 transitions. Word has length 116 [2019-09-08 12:43:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:04,803 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1478 transitions. [2019-09-08 12:43:04,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1478 transitions. [2019-09-08 12:43:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:04,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:04,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:04,806 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:04,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:04,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2105565842, now seen corresponding path program 1 times [2019-09-08 12:43:04,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:04,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:04,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:04,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:04,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:05,072 INFO L134 CoverageAnalysis]: 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:05,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:05,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:05,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:05,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:05,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:05,074 INFO L87 Difference]: Start difference. First operand 1088 states and 1478 transitions. Second operand 9 states. [2019-09-08 12:43:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:09,194 INFO L93 Difference]: Finished difference Result 1988 states and 2723 transitions. [2019-09-08 12:43:09,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:09,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:09,200 INFO L225 Difference]: With dead ends: 1988 [2019-09-08 12:43:09,200 INFO L226 Difference]: Without dead ends: 1838 [2019-09-08 12:43:09,201 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:43:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-08 12:43:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-08 12:43:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:09,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1477 transitions. [2019-09-08 12:43:09,319 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1477 transitions. Word has length 116 [2019-09-08 12:43:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:09,320 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1477 transitions. [2019-09-08 12:43:09,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:09,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1477 transitions. [2019-09-08 12:43:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:09,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:09,322 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:09,322 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:09,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:09,323 INFO L82 PathProgramCache]: Analyzing trace with hash 708861456, now seen corresponding path program 1 times [2019-09-08 12:43:09,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:09,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:09,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:09,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:09,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:09,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:09,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:09,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:09,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:09,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:09,548 INFO L87 Difference]: Start difference. First operand 1088 states and 1477 transitions. Second operand 9 states. [2019-09-08 12:43:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:12,938 INFO L93 Difference]: Finished difference Result 1739 states and 2332 transitions. [2019-09-08 12:43:12,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:12,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:12,944 INFO L225 Difference]: With dead ends: 1739 [2019-09-08 12:43:12,945 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:43:12,946 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:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:43:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:43:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1476 transitions. [2019-09-08 12:43:13,058 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1476 transitions. Word has length 116 [2019-09-08 12:43:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:13,059 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1476 transitions. [2019-09-08 12:43:13,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1476 transitions. [2019-09-08 12:43:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:13,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:13,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:13,061 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1139988945, now seen corresponding path program 1 times [2019-09-08 12:43:13,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:13,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:13,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:13,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:13,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:13,285 INFO L134 CoverageAnalysis]: 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,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:13,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:13,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:13,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:13,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:13,287 INFO L87 Difference]: Start difference. First operand 1088 states and 1476 transitions. Second operand 9 states. [2019-09-08 12:43:17,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:17,325 INFO L93 Difference]: Finished difference Result 1933 states and 2646 transitions. [2019-09-08 12:43:17,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:17,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:17,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:17,330 INFO L225 Difference]: With dead ends: 1933 [2019-09-08 12:43:17,330 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:43:17,332 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,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:43:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:43:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1475 transitions. [2019-09-08 12:43:17,486 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1475 transitions. Word has length 116 [2019-09-08 12:43:17,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:17,487 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1475 transitions. [2019-09-08 12:43:17,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1475 transitions. [2019-09-08 12:43:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:17,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:17,488 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:17,488 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:17,489 INFO L82 PathProgramCache]: Analyzing trace with hash 629608632, now seen corresponding path program 1 times [2019-09-08 12:43:17,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:17,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:17,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:17,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:17,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:17,695 INFO L134 CoverageAnalysis]: 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:17,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:17,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:17,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:17,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:17,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:17,696 INFO L87 Difference]: Start difference. First operand 1088 states and 1475 transitions. Second operand 9 states. [2019-09-08 12:43:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:21,001 INFO L93 Difference]: Finished difference Result 1825 states and 2456 transitions. [2019-09-08 12:43:21,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:21,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:21,007 INFO L225 Difference]: With dead ends: 1825 [2019-09-08 12:43:21,008 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:43:21,009 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:21,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:43:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:43:21,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1474 transitions. [2019-09-08 12:43:21,130 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1474 transitions. Word has length 116 [2019-09-08 12:43:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:21,131 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1474 transitions. [2019-09-08 12:43:21,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1474 transitions. [2019-09-08 12:43:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:21,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:21,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, 1] [2019-09-08 12:43:21,140 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:21,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1428998625, now seen corresponding path program 1 times [2019-09-08 12:43:21,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:21,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:21,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:21,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:21,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:21,388 INFO L134 CoverageAnalysis]: 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:21,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:21,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:21,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:21,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:21,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:21,389 INFO L87 Difference]: Start difference. First operand 1088 states and 1474 transitions. Second operand 9 states. [2019-09-08 12:43:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:25,078 INFO L93 Difference]: Finished difference Result 1988 states and 2717 transitions. [2019-09-08 12:43:25,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:25,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:25,081 INFO L225 Difference]: With dead ends: 1988 [2019-09-08 12:43:25,081 INFO L226 Difference]: Without dead ends: 1838 [2019-09-08 12:43:25,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:43:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-08 12:43:25,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-08 12:43:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1473 transitions. [2019-09-08 12:43:25,161 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1473 transitions. Word has length 116 [2019-09-08 12:43:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:25,161 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1473 transitions. [2019-09-08 12:43:25,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1473 transitions. [2019-09-08 12:43:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:25,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:25,163 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:25,163 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:25,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:25,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1794515206, now seen corresponding path program 1 times [2019-09-08 12:43:25,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:25,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:25,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:25,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:25,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:25,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:25,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:25,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:25,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:25,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:25,379 INFO L87 Difference]: Start difference. First operand 1088 states and 1473 transitions. Second operand 9 states. [2019-09-08 12:43:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:29,320 INFO L93 Difference]: Finished difference Result 1928 states and 2637 transitions. [2019-09-08 12:43:29,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:29,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:29,323 INFO L225 Difference]: With dead ends: 1928 [2019-09-08 12:43:29,323 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:43:29,325 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:43:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:43:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:43:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1472 transitions. [2019-09-08 12:43:29,440 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1472 transitions. Word has length 116 [2019-09-08 12:43:29,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:29,440 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1472 transitions. [2019-09-08 12:43:29,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1472 transitions. [2019-09-08 12:43:29,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:29,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:29,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] [2019-09-08 12:43:29,443 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:29,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:29,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1410611137, now seen corresponding path program 1 times [2019-09-08 12:43:29,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:29,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:29,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:29,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:29,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:29,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:29,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:29,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:29,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:29,652 INFO L87 Difference]: Start difference. First operand 1088 states and 1472 transitions. Second operand 9 states. [2019-09-08 12:43:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:33,281 INFO L93 Difference]: Finished difference Result 1933 states and 2641 transitions. [2019-09-08 12:43:33,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:33,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:33,284 INFO L225 Difference]: With dead ends: 1933 [2019-09-08 12:43:33,284 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:43:33,285 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:43:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:43:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:43:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1471 transitions. [2019-09-08 12:43:33,373 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1471 transitions. Word has length 116 [2019-09-08 12:43:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:33,373 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1471 transitions. [2019-09-08 12:43:33,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1471 transitions. [2019-09-08 12:43:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:33,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:33,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,375 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:33,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:33,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1661615888, now seen corresponding path program 1 times [2019-09-08 12:43:33,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:33,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:33,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:33,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:33,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:33,566 INFO L134 CoverageAnalysis]: 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,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:33,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:33,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:33,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:33,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:33,567 INFO L87 Difference]: Start difference. First operand 1088 states and 1471 transitions. Second operand 9 states. [2019-09-08 12:43:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:36,898 INFO L93 Difference]: Finished difference Result 1739 states and 2324 transitions. [2019-09-08 12:43:36,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:36,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:36,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:36,901 INFO L225 Difference]: With dead ends: 1739 [2019-09-08 12:43:36,901 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:43:36,902 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:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:43:36,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:43:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1470 transitions. [2019-09-08 12:43:36,997 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1470 transitions. Word has length 116 [2019-09-08 12:43:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:36,997 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1470 transitions. [2019-09-08 12:43:36,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1470 transitions. [2019-09-08 12:43:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:36,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:36,999 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:36,999 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:37,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1027968626, now seen corresponding path program 1 times [2019-09-08 12:43:37,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:37,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:37,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:37,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:37,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:37,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:37,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:37,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:37,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:37,180 INFO L87 Difference]: Start difference. First operand 1088 states and 1470 transitions. Second operand 9 states. [2019-09-08 12:43:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:41,057 INFO L93 Difference]: Finished difference Result 1928 states and 2632 transitions. [2019-09-08 12:43:41,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:41,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:41,060 INFO L225 Difference]: With dead ends: 1928 [2019-09-08 12:43:41,060 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:43:41,062 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:43:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:43:41,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:43:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1469 transitions. [2019-09-08 12:43:41,158 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1469 transitions. Word has length 116 [2019-09-08 12:43:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:41,158 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1469 transitions. [2019-09-08 12:43:41,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1469 transitions. [2019-09-08 12:43:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:41,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:41,160 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,160 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash -926819479, now seen corresponding path program 1 times [2019-09-08 12:43:41,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:41,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:41,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:41,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:41,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:41,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:43:41,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:41,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:41,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:41,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:41,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:41,375 INFO L87 Difference]: Start difference. First operand 1088 states and 1469 transitions. Second operand 9 states. [2019-09-08 12:43:45,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:45,604 INFO L93 Difference]: Finished difference Result 1926 states and 2629 transitions. [2019-09-08 12:43:45,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:45,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:45,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:45,607 INFO L225 Difference]: With dead ends: 1926 [2019-09-08 12:43:45,607 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:43:45,608 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:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:43:45,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:43:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1468 transitions. [2019-09-08 12:43:45,697 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1468 transitions. Word has length 116 [2019-09-08 12:43:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:45,697 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1468 transitions. [2019-09-08 12:43:45,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1468 transitions. [2019-09-08 12:43:45,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:43:45,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:45,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,699 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:45,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:45,699 INFO L82 PathProgramCache]: Analyzing trace with hash 579223384, now seen corresponding path program 1 times [2019-09-08 12:43:45,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:45,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:45,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:45,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:45,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:45,879 INFO L134 CoverageAnalysis]: 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:45,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:45,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:45,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:45,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:45,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:45,881 INFO L87 Difference]: Start difference. First operand 1088 states and 1468 transitions. Second operand 9 states. [2019-09-08 12:43:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:50,219 INFO L93 Difference]: Finished difference Result 1928 states and 2630 transitions. [2019-09-08 12:43:50,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:50,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-08 12:43:50,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:50,221 INFO L225 Difference]: With dead ends: 1928 [2019-09-08 12:43:50,222 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:43:50,223 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:50,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:43:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:43:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1467 transitions. [2019-09-08 12:43:50,380 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1467 transitions. Word has length 116 [2019-09-08 12:43:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:50,381 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1467 transitions. [2019-09-08 12:43:50,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1467 transitions. [2019-09-08 12:43:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:43:50,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:50,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,383 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:50,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:50,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1137739447, now seen corresponding path program 1 times [2019-09-08 12:43:50,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:50,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:50,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:50,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:50,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:50,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:50,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:50,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:50,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:50,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:50,577 INFO L87 Difference]: Start difference. First operand 1088 states and 1467 transitions. Second operand 9 states. [2019-09-08 12:43:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:54,426 INFO L93 Difference]: Finished difference Result 1888 states and 2559 transitions. [2019-09-08 12:43:54,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:54,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:43:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:54,429 INFO L225 Difference]: With dead ends: 1888 [2019-09-08 12:43:54,429 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:43:54,430 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:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:43:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:43:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1466 transitions. [2019-09-08 12:43:54,549 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1466 transitions. Word has length 118 [2019-09-08 12:43:54,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:54,549 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1466 transitions. [2019-09-08 12:43:54,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1466 transitions. [2019-09-08 12:43:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:43:54,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:54,551 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:54,552 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1008288702, now seen corresponding path program 1 times [2019-09-08 12:43:54,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:54,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:54,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:54,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:54,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:54,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:54,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:54,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:54,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:54,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:54,761 INFO L87 Difference]: Start difference. First operand 1088 states and 1466 transitions. Second operand 9 states. [2019-09-08 12:43:58,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:43:58,969 INFO L93 Difference]: Finished difference Result 1942 states and 2639 transitions. [2019-09-08 12:43:58,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:43:58,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:43:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:43:58,972 INFO L225 Difference]: With dead ends: 1942 [2019-09-08 12:43:58,972 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:43:58,973 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:43:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:43:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:43:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:43:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1465 transitions. [2019-09-08 12:43:59,111 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1465 transitions. Word has length 118 [2019-09-08 12:43:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:59,111 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1465 transitions. [2019-09-08 12:43:59,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:43:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1465 transitions. [2019-09-08 12:43:59,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:43:59,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:59,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:59,114 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:59,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:59,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1568062438, now seen corresponding path program 1 times [2019-09-08 12:43:59,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:59,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:59,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:59,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:59,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:59,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:43:59,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:43:59,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:43:59,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:43:59,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:43:59,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:43:59,300 INFO L87 Difference]: Start difference. First operand 1088 states and 1465 transitions. Second operand 9 states. [2019-09-08 12:44:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:03,253 INFO L93 Difference]: Finished difference Result 1884 states and 2553 transitions. [2019-09-08 12:44:03,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:03,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:03,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:03,255 INFO L225 Difference]: With dead ends: 1884 [2019-09-08 12:44:03,255 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:44:03,256 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:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:44:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:44:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1464 transitions. [2019-09-08 12:44:03,355 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1464 transitions. Word has length 118 [2019-09-08 12:44:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:03,355 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1464 transitions. [2019-09-08 12:44:03,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1464 transitions. [2019-09-08 12:44:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:03,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:03,357 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,357 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:03,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:03,358 INFO L82 PathProgramCache]: Analyzing trace with hash -530863933, now seen corresponding path program 1 times [2019-09-08 12:44:03,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:03,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:03,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:03,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:03,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:03,590 INFO L134 CoverageAnalysis]: 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:03,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:03,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:03,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:03,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:03,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:03,595 INFO L87 Difference]: Start difference. First operand 1088 states and 1464 transitions. Second operand 9 states. [2019-09-08 12:44:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:06,828 INFO L93 Difference]: Finished difference Result 1825 states and 2443 transitions. [2019-09-08 12:44:06,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:06,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:06,831 INFO L225 Difference]: With dead ends: 1825 [2019-09-08 12:44:06,831 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:44:06,832 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:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:44:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:44:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1463 transitions. [2019-09-08 12:44:06,973 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1463 transitions. Word has length 118 [2019-09-08 12:44:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:06,974 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1463 transitions. [2019-09-08 12:44:06,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1463 transitions. [2019-09-08 12:44:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:06,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:06,976 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,977 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:06,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:06,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1463192374, now seen corresponding path program 1 times [2019-09-08 12:44:06,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:06,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:06,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:06,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:06,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:07,157 INFO L134 CoverageAnalysis]: 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:07,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:07,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:07,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:07,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:07,159 INFO L87 Difference]: Start difference. First operand 1088 states and 1463 transitions. Second operand 9 states. [2019-09-08 12:44:11,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:11,276 INFO L93 Difference]: Finished difference Result 1942 states and 2635 transitions. [2019-09-08 12:44:11,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:11,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:11,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:11,278 INFO L225 Difference]: With dead ends: 1942 [2019-09-08 12:44:11,278 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:44:11,279 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:44:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:44:11,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:44:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1462 transitions. [2019-09-08 12:44:11,377 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1462 transitions. Word has length 118 [2019-09-08 12:44:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:11,377 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1462 transitions. [2019-09-08 12:44:11,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1462 transitions. [2019-09-08 12:44:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:11,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:11,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] [2019-09-08 12:44:11,379 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:11,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:11,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1333741629, now seen corresponding path program 1 times [2019-09-08 12:44:11,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:11,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:11,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:11,571 INFO L134 CoverageAnalysis]: 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,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:11,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:11,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:11,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:11,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:11,574 INFO L87 Difference]: Start difference. First operand 1088 states and 1462 transitions. Second operand 9 states. [2019-09-08 12:44:14,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:14,957 INFO L93 Difference]: Finished difference Result 1825 states and 2440 transitions. [2019-09-08 12:44:14,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:14,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:14,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:14,959 INFO L225 Difference]: With dead ends: 1825 [2019-09-08 12:44:14,960 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:44:14,961 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:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:44:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:44:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1461 transitions. [2019-09-08 12:44:15,071 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1461 transitions. Word has length 118 [2019-09-08 12:44:15,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:15,071 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1461 transitions. [2019-09-08 12:44:15,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1461 transitions. [2019-09-08 12:44:15,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:15,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:15,073 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,073 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:15,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:15,073 INFO L82 PathProgramCache]: Analyzing trace with hash -872434601, now seen corresponding path program 1 times [2019-09-08 12:44:15,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:15,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:15,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:15,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:15,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:15,262 INFO L134 CoverageAnalysis]: 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,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:15,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:15,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:15,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:15,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:15,264 INFO L87 Difference]: Start difference. First operand 1088 states and 1461 transitions. Second operand 9 states. [2019-09-08 12:44:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:19,640 INFO L93 Difference]: Finished difference Result 2003 states and 2713 transitions. [2019-09-08 12:44:19,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:19,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:19,643 INFO L225 Difference]: With dead ends: 2003 [2019-09-08 12:44:19,643 INFO L226 Difference]: Without dead ends: 1838 [2019-09-08 12:44:19,645 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:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-09-08 12:44:19,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1088. [2019-09-08 12:44:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1460 transitions. [2019-09-08 12:44:19,764 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1460 transitions. Word has length 118 [2019-09-08 12:44:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:19,764 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1460 transitions. [2019-09-08 12:44:19,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1460 transitions. [2019-09-08 12:44:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:19,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:19,767 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,767 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:19,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:19,767 INFO L82 PathProgramCache]: Analyzing trace with hash 302871591, now seen corresponding path program 1 times [2019-09-08 12:44:19,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:19,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:19,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:19,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:19,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:20,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:44:20,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:20,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:20,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:20,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:20,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:20,030 INFO L87 Difference]: Start difference. First operand 1088 states and 1460 transitions. Second operand 9 states. [2019-09-08 12:44:24,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:24,220 INFO L93 Difference]: Finished difference Result 1933 states and 2622 transitions. [2019-09-08 12:44:24,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:24,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:24,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:24,223 INFO L225 Difference]: With dead ends: 1933 [2019-09-08 12:44:24,223 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:44:24,224 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:44:24,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:44:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:44:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1459 transitions. [2019-09-08 12:44:24,333 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1459 transitions. Word has length 118 [2019-09-08 12:44:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:24,333 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1459 transitions. [2019-09-08 12:44:24,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1459 transitions. [2019-09-08 12:44:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:24,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:24,335 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:24,335 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:24,335 INFO L82 PathProgramCache]: Analyzing trace with hash -663297848, now seen corresponding path program 1 times [2019-09-08 12:44:24,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:24,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:24,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:24,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:24,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:24,482 INFO L134 CoverageAnalysis]: 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,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:24,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:24,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:24,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:24,483 INFO L87 Difference]: Start difference. First operand 1088 states and 1459 transitions. Second operand 9 states. [2019-09-08 12:44:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:28,472 INFO L93 Difference]: Finished difference Result 1884 states and 2546 transitions. [2019-09-08 12:44:28,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:28,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:28,475 INFO L225 Difference]: With dead ends: 1884 [2019-09-08 12:44:28,475 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:44:28,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:44:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:44:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:44:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1458 transitions. [2019-09-08 12:44:28,592 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1458 transitions. Word has length 118 [2019-09-08 12:44:28,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:28,592 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1458 transitions. [2019-09-08 12:44:28,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:28,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1458 transitions. [2019-09-08 12:44:28,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:28,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:28,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,594 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:28,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:28,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1719539060, now seen corresponding path program 1 times [2019-09-08 12:44:28,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:28,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:28,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:28,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:28,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:28,768 INFO L134 CoverageAnalysis]: 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:28,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:28,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:28,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:28,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:28,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:28,773 INFO L87 Difference]: Start difference. First operand 1088 states and 1458 transitions. Second operand 9 states. [2019-09-08 12:44:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:32,022 INFO L93 Difference]: Finished difference Result 1820 states and 2430 transitions. [2019-09-08 12:44:32,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:32,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:32,025 INFO L225 Difference]: With dead ends: 1820 [2019-09-08 12:44:32,025 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:44:32,026 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:44:32,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:44:32,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:44:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1457 transitions. [2019-09-08 12:44:32,136 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1457 transitions. Word has length 118 [2019-09-08 12:44:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:32,136 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1457 transitions. [2019-09-08 12:44:32,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1457 transitions. [2019-09-08 12:44:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:32,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:32,139 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,139 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:32,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:32,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1927601820, now seen corresponding path program 1 times [2019-09-08 12:44:32,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:32,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:32,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:32,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:32,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:32,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:44:32,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:32,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:32,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:32,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:32,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:32,323 INFO L87 Difference]: Start difference. First operand 1088 states and 1457 transitions. Second operand 9 states. [2019-09-08 12:44:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:36,438 INFO L93 Difference]: Finished difference Result 1928 states and 2612 transitions. [2019-09-08 12:44:36,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:36,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:36,441 INFO L225 Difference]: With dead ends: 1928 [2019-09-08 12:44:36,441 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:44:36,442 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:44:36,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:44:36,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:44:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1456 transitions. [2019-09-08 12:44:36,555 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1456 transitions. Word has length 118 [2019-09-08 12:44:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:36,556 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1456 transitions. [2019-09-08 12:44:36,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1456 transitions. [2019-09-08 12:44:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:36,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:36,557 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,558 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:36,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:36,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1456886781, now seen corresponding path program 1 times [2019-09-08 12:44:36,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:36,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:36,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:36,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:36,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:36,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:36,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:36,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:36,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:36,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:36,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:36,746 INFO L87 Difference]: Start difference. First operand 1088 states and 1456 transitions. Second operand 9 states. [2019-09-08 12:44:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:40,095 INFO L93 Difference]: Finished difference Result 1820 states and 2428 transitions. [2019-09-08 12:44:40,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:40,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:40,097 INFO L225 Difference]: With dead ends: 1820 [2019-09-08 12:44:40,097 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:44:40,098 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:44:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:44:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:44:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1455 transitions. [2019-09-08 12:44:40,208 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1455 transitions. Word has length 118 [2019-09-08 12:44:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:40,208 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1455 transitions. [2019-09-08 12:44:40,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1455 transitions. [2019-09-08 12:44:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:40,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:40,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] [2019-09-08 12:44:40,210 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:40,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:40,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1328567384, now seen corresponding path program 1 times [2019-09-08 12:44:40,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:40,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:40,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:40,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:40,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:40,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:44:40,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:40,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:40,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:40,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:40,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:40,376 INFO L87 Difference]: Start difference. First operand 1088 states and 1455 transitions. Second operand 9 states. [2019-09-08 12:44:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:44,477 INFO L93 Difference]: Finished difference Result 1933 states and 2615 transitions. [2019-09-08 12:44:44,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:44,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:44,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:44,481 INFO L225 Difference]: With dead ends: 1933 [2019-09-08 12:44:44,481 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:44:44,482 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:44:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:44:44,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:44:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1454 transitions. [2019-09-08 12:44:44,596 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1454 transitions. Word has length 118 [2019-09-08 12:44:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:44,596 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1454 transitions. [2019-09-08 12:44:44,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1454 transitions. [2019-09-08 12:44:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:44,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:44,598 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,598 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:44,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:44,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2000230473, now seen corresponding path program 1 times [2019-09-08 12:44:44,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:44,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:44,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:44,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:44,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:44:44,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:44,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:44,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:44,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:44,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:44,750 INFO L87 Difference]: Start difference. First operand 1088 states and 1454 transitions. Second operand 9 states. [2019-09-08 12:44:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:48,760 INFO L93 Difference]: Finished difference Result 1884 states and 2540 transitions. [2019-09-08 12:44:48,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:48,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:48,766 INFO L225 Difference]: With dead ends: 1884 [2019-09-08 12:44:48,766 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:44:48,767 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:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:44:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:44:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1453 transitions. [2019-09-08 12:44:48,889 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1453 transitions. Word has length 118 [2019-09-08 12:44:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:48,889 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1453 transitions. [2019-09-08 12:44:48,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1453 transitions. [2019-09-08 12:44:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:48,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:48,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:48,891 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:48,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:48,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1344929323, now seen corresponding path program 1 times [2019-09-08 12:44:48,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:48,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:48,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:48,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:48,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:49,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:44:49,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:49,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:49,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:49,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:49,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:49,075 INFO L87 Difference]: Start difference. First operand 1088 states and 1453 transitions. Second operand 9 states. [2019-09-08 12:44:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:52,488 INFO L93 Difference]: Finished difference Result 1739 states and 2302 transitions. [2019-09-08 12:44:52,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:52,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:52,490 INFO L225 Difference]: With dead ends: 1739 [2019-09-08 12:44:52,490 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:44:52,491 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:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:44:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:44:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1452 transitions. [2019-09-08 12:44:52,638 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1452 transitions. Word has length 118 [2019-09-08 12:44:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:52,638 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1452 transitions. [2019-09-08 12:44:52,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1452 transitions. [2019-09-08 12:44:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:52,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:52,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] [2019-09-08 12:44:52,640 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:52,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:52,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1214970847, now seen corresponding path program 1 times [2019-09-08 12:44:52,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:52,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:52,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:52,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:52,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:52,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:44:52,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:52,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:52,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:52,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:52,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:52,813 INFO L87 Difference]: Start difference. First operand 1088 states and 1452 transitions. Second operand 9 states. [2019-09-08 12:44:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:56,913 INFO L93 Difference]: Finished difference Result 1942 states and 2619 transitions. [2019-09-08 12:44:56,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:44:56,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:44:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:56,916 INFO L225 Difference]: With dead ends: 1942 [2019-09-08 12:44:56,916 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:44:56,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:44:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:44:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:44:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:44:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1451 transitions. [2019-09-08 12:44:57,048 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1451 transitions. Word has length 118 [2019-09-08 12:44:57,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:57,049 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1451 transitions. [2019-09-08 12:44:57,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1451 transitions. [2019-09-08 12:44:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:44:57,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:57,050 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,051 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:57,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:57,051 INFO L82 PathProgramCache]: Analyzing trace with hash 98899166, now seen corresponding path program 1 times [2019-09-08 12:44:57,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:57,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:57,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:57,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:57,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:57,199 INFO L134 CoverageAnalysis]: 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:57,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:57,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:57,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:57,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:57,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:57,200 INFO L87 Difference]: Start difference. First operand 1088 states and 1451 transitions. Second operand 9 states. [2019-09-08 12:45:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:00,607 INFO L93 Difference]: Finished difference Result 1825 states and 2426 transitions. [2019-09-08 12:45:00,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:00,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:00,610 INFO L225 Difference]: With dead ends: 1825 [2019-09-08 12:45:00,610 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:45:00,611 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:45:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:45:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:45:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1450 transitions. [2019-09-08 12:45:00,741 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1450 transitions. Word has length 118 [2019-09-08 12:45:00,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:00,741 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1450 transitions. [2019-09-08 12:45:00,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1450 transitions. [2019-09-08 12:45:00,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:00,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:00,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,743 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:00,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:00,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2028055678, now seen corresponding path program 1 times [2019-09-08 12:45:00,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:00,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:00,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:00,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:00,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:00,891 INFO L134 CoverageAnalysis]: 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:00,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:00,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:00,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:00,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:00,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:00,893 INFO L87 Difference]: Start difference. First operand 1088 states and 1450 transitions. Second operand 9 states. [2019-09-08 12:45:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:05,137 INFO L93 Difference]: Finished difference Result 1942 states and 2616 transitions. [2019-09-08 12:45:05,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:05,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:05,141 INFO L225 Difference]: With dead ends: 1942 [2019-09-08 12:45:05,141 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:45:05,142 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:05,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:45:05,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:45:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1449 transitions. [2019-09-08 12:45:05,272 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1449 transitions. Word has length 118 [2019-09-08 12:45:05,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:05,272 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1449 transitions. [2019-09-08 12:45:05,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1449 transitions. [2019-09-08 12:45:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:05,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:05,274 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,275 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:05,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1708413887, now seen corresponding path program 1 times [2019-09-08 12:45:05,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:05,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:05,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:05,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:05,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:05,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:05,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:05,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:05,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:05,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:05,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:05,464 INFO L87 Difference]: Start difference. First operand 1088 states and 1449 transitions. Second operand 9 states. [2019-09-08 12:45:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:09,562 INFO L93 Difference]: Finished difference Result 1884 states and 2534 transitions. [2019-09-08 12:45:09,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:09,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:09,565 INFO L225 Difference]: With dead ends: 1884 [2019-09-08 12:45:09,565 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:45:09,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:45:09,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:45:09,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:45:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1448 transitions. [2019-09-08 12:45:09,691 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1448 transitions. Word has length 118 [2019-09-08 12:45:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:09,691 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1448 transitions. [2019-09-08 12:45:09,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:09,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1448 transitions. [2019-09-08 12:45:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:09,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:09,693 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,693 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:09,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:09,693 INFO L82 PathProgramCache]: Analyzing trace with hash 488903043, now seen corresponding path program 1 times [2019-09-08 12:45:09,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:09,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:09,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:09,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:09,854 INFO L134 CoverageAnalysis]: 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:09,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:09,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:09,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:09,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:09,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:09,856 INFO L87 Difference]: Start difference. First operand 1088 states and 1448 transitions. Second operand 9 states. [2019-09-08 12:45:13,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:13,252 INFO L93 Difference]: Finished difference Result 1825 states and 2423 transitions. [2019-09-08 12:45:13,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:13,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:13,255 INFO L225 Difference]: With dead ends: 1825 [2019-09-08 12:45:13,255 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:45:13,255 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:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:45:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:45:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1447 transitions. [2019-09-08 12:45:13,382 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1447 transitions. Word has length 118 [2019-09-08 12:45:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:13,382 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1447 transitions. [2019-09-08 12:45:13,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1447 transitions. [2019-09-08 12:45:13,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:13,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:13,384 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,384 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:13,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:13,384 INFO L82 PathProgramCache]: Analyzing trace with hash 190374528, now seen corresponding path program 1 times [2019-09-08 12:45:13,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:13,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:13,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:13,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:13,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:13,527 INFO L134 CoverageAnalysis]: 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:13,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:13,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:13,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:13,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:13,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:13,528 INFO L87 Difference]: Start difference. First operand 1088 states and 1447 transitions. Second operand 9 states. [2019-09-08 12:45:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:16,850 INFO L93 Difference]: Finished difference Result 1822 states and 2418 transitions. [2019-09-08 12:45:16,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:16,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:16,854 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:45:16,854 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:45:16,855 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:45:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:45:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:45:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1446 transitions. [2019-09-08 12:45:16,985 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1446 transitions. Word has length 118 [2019-09-08 12:45:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:16,986 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1446 transitions. [2019-09-08 12:45:16,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1446 transitions. [2019-09-08 12:45:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:16,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:16,988 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,988 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:16,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:16,988 INFO L82 PathProgramCache]: Analyzing trace with hash 661276899, now seen corresponding path program 1 times [2019-09-08 12:45:16,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:16,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:16,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:17,142 INFO L134 CoverageAnalysis]: 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,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:17,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:17,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:17,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:17,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:17,143 INFO L87 Difference]: Start difference. First operand 1088 states and 1446 transitions. Second operand 9 states. [2019-09-08 12:45:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:21,238 INFO L93 Difference]: Finished difference Result 1884 states and 2529 transitions. [2019-09-08 12:45:21,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:21,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:21,242 INFO L225 Difference]: With dead ends: 1884 [2019-09-08 12:45:21,242 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:45:21,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:45:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:45:21,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:45:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1445 transitions. [2019-09-08 12:45:21,388 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1445 transitions. Word has length 118 [2019-09-08 12:45:21,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:21,388 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1445 transitions. [2019-09-08 12:45:21,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1445 transitions. [2019-09-08 12:45:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:21,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:21,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:21,390 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:21,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:21,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1436168909, now seen corresponding path program 1 times [2019-09-08 12:45:21,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:21,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:21,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:21,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:21,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:21,540 INFO L134 CoverageAnalysis]: 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,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:21,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:21,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:21,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:21,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:21,541 INFO L87 Difference]: Start difference. First operand 1088 states and 1445 transitions. Second operand 9 states. [2019-09-08 12:45:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:24,958 INFO L93 Difference]: Finished difference Result 1825 states and 2418 transitions. [2019-09-08 12:45:24,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:24,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:24,961 INFO L225 Difference]: With dead ends: 1825 [2019-09-08 12:45:24,961 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:45:24,962 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:24,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:45:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:45:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1444 transitions. [2019-09-08 12:45:25,106 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1444 transitions. Word has length 118 [2019-09-08 12:45:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:25,107 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1444 transitions. [2019-09-08 12:45:25,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1444 transitions. [2019-09-08 12:45:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:25,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:25,110 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,110 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:25,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:25,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1268958251, now seen corresponding path program 1 times [2019-09-08 12:45:25,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:25,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:25,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:25,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:25,311 INFO L134 CoverageAnalysis]: 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,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:25,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:25,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:25,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:25,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:25,312 INFO L87 Difference]: Start difference. First operand 1088 states and 1444 transitions. Second operand 9 states. [2019-09-08 12:45:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:29,336 INFO L93 Difference]: Finished difference Result 1933 states and 2598 transitions. [2019-09-08 12:45:29,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:29,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:29,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:29,339 INFO L225 Difference]: With dead ends: 1933 [2019-09-08 12:45:29,339 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:45:29,340 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:29,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:45:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:45:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1443 transitions. [2019-09-08 12:45:29,475 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1443 transitions. Word has length 118 [2019-09-08 12:45:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:29,476 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1443 transitions. [2019-09-08 12:45:29,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1443 transitions. [2019-09-08 12:45:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:29,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:29,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,477 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:29,478 INFO L82 PathProgramCache]: Analyzing trace with hash 302788812, now seen corresponding path program 1 times [2019-09-08 12:45:29,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:29,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:29,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:29,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:29,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:29,638 INFO L134 CoverageAnalysis]: 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:29,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:29,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:29,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:29,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:29,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:29,639 INFO L87 Difference]: Start difference. First operand 1088 states and 1443 transitions. Second operand 9 states. [2019-09-08 12:45:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:33,223 INFO L93 Difference]: Finished difference Result 1884 states and 2525 transitions. [2019-09-08 12:45:33,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:33,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:33,225 INFO L225 Difference]: With dead ends: 1884 [2019-09-08 12:45:33,226 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:45:33,226 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:45:33,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:45:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:45:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1442 transitions. [2019-09-08 12:45:33,366 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1442 transitions. Word has length 118 [2019-09-08 12:45:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:33,366 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1442 transitions. [2019-09-08 12:45:33,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1442 transitions. [2019-09-08 12:45:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:33,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:33,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,368 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:33,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:33,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1718311127, now seen corresponding path program 1 times [2019-09-08 12:45:33,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:33,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:33,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:33,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:33,546 INFO L134 CoverageAnalysis]: 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:33,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:33,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:33,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:33,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:33,548 INFO L87 Difference]: Start difference. First operand 1088 states and 1442 transitions. Second operand 9 states. [2019-09-08 12:45:36,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:36,917 INFO L93 Difference]: Finished difference Result 1820 states and 2409 transitions. [2019-09-08 12:45:36,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:36,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:36,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:36,920 INFO L225 Difference]: With dead ends: 1820 [2019-09-08 12:45:36,920 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:45:36,921 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:45:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:45:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:45:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1441 transitions. [2019-09-08 12:45:37,069 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1441 transitions. Word has length 118 [2019-09-08 12:45:37,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:37,069 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1441 transitions. [2019-09-08 12:45:37,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:37,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1441 transitions. [2019-09-08 12:45:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:37,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:37,071 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,071 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:37,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:37,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1719479256, now seen corresponding path program 1 times [2019-09-08 12:45:37,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:37,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:37,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:37,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:37,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:37,232 INFO L134 CoverageAnalysis]: 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:37,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:37,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:37,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:37,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:37,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:37,233 INFO L87 Difference]: Start difference. First operand 1088 states and 1441 transitions. Second operand 9 states. [2019-09-08 12:45:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:41,387 INFO L93 Difference]: Finished difference Result 1884 states and 2523 transitions. [2019-09-08 12:45:41,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:41,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:41,389 INFO L225 Difference]: With dead ends: 1884 [2019-09-08 12:45:41,389 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:45: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:45:41,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:45:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:45:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1440 transitions. [2019-09-08 12:45:41,530 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1440 transitions. Word has length 118 [2019-09-08 12:45:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:41,530 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1440 transitions. [2019-09-08 12:45:41,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1440 transitions. [2019-09-08 12:45:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:41,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:41,532 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,533 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1598048276, now seen corresponding path program 1 times [2019-09-08 12:45:41,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:41,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:41,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:41,697 INFO L134 CoverageAnalysis]: 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:41,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:41,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:41,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:41,698 INFO L87 Difference]: Start difference. First operand 1088 states and 1440 transitions. Second operand 9 states. [2019-09-08 12:45:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:44,900 INFO L93 Difference]: Finished difference Result 1820 states and 2406 transitions. [2019-09-08 12:45:44,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:44,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:44,903 INFO L225 Difference]: With dead ends: 1820 [2019-09-08 12:45:44,903 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:45:44,904 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:45:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:45:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:45:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1439 transitions. [2019-09-08 12:45:45,079 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1439 transitions. Word has length 118 [2019-09-08 12:45:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:45,079 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1439 transitions. [2019-09-08 12:45:45,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1439 transitions. [2019-09-08 12:45:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:45,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:45,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,081 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:45,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash -988448613, now seen corresponding path program 1 times [2019-09-08 12:45:45,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:45,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:45,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:45,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:45,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:45,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:45:45,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:45,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:45,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:45,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:45,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:45,243 INFO L87 Difference]: Start difference. First operand 1088 states and 1439 transitions. Second operand 9 states. [2019-09-08 12:45:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:48,654 INFO L93 Difference]: Finished difference Result 1820 states and 2404 transitions. [2019-09-08 12:45:48,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:48,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:48,656 INFO L225 Difference]: With dead ends: 1820 [2019-09-08 12:45:48,656 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:45:48,657 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:45:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:45:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:45:48,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1438 transitions. [2019-09-08 12:45:48,801 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1438 transitions. Word has length 118 [2019-09-08 12:45:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:48,801 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1438 transitions. [2019-09-08 12:45:48,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1438 transitions. [2019-09-08 12:45:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:45:48,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:48,802 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,803 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:48,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:48,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1076099122, now seen corresponding path program 1 times [2019-09-08 12:45:48,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:48,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:48,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:48,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:48,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:48,957 INFO L134 CoverageAnalysis]: 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:48,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:48,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:48,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:48,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:48,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:48,958 INFO L87 Difference]: Start difference. First operand 1088 states and 1438 transitions. Second operand 9 states. [2019-09-08 12:45:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:53,044 INFO L93 Difference]: Finished difference Result 1884 states and 2518 transitions. [2019-09-08 12:45:53,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:53,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-08 12:45:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:53,046 INFO L225 Difference]: With dead ends: 1884 [2019-09-08 12:45:53,046 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:45:53,047 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:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:45:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:45:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1437 transitions. [2019-09-08 12:45:53,192 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1437 transitions. Word has length 118 [2019-09-08 12:45:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:53,192 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1437 transitions. [2019-09-08 12:45:53,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1437 transitions. [2019-09-08 12:45:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:45:53,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:53,193 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,194 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:53,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:53,194 INFO L82 PathProgramCache]: Analyzing trace with hash -524771572, now seen corresponding path program 1 times [2019-09-08 12:45:53,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:53,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:53,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:53,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:53,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:53,349 INFO L134 CoverageAnalysis]: 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:53,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:53,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:53,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:53,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:53,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:53,352 INFO L87 Difference]: Start difference. First operand 1088 states and 1437 transitions. Second operand 9 states. [2019-09-08 12:45:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:57,339 INFO L93 Difference]: Finished difference Result 1882 states and 2514 transitions. [2019-09-08 12:45:57,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:45:57,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-08 12:45:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:57,342 INFO L225 Difference]: With dead ends: 1882 [2019-09-08 12:45:57,343 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:45:57,343 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:45:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:45:57,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:45:57,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:45:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1436 transitions. [2019-09-08 12:45:57,494 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1436 transitions. Word has length 119 [2019-09-08 12:45:57,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:57,494 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1436 transitions. [2019-09-08 12:45:57,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:45:57,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1436 transitions. [2019-09-08 12:45:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:45:57,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:57,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:57,496 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:57,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:57,496 INFO L82 PathProgramCache]: Analyzing trace with hash 438986769, now seen corresponding path program 1 times [2019-09-08 12:45:57,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:57,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:57,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:57,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:57,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:57,634 INFO L134 CoverageAnalysis]: 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:57,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:45:57,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:45:57,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:45:57,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:45:57,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:45:57,635 INFO L87 Difference]: Start difference. First operand 1088 states and 1436 transitions. Second operand 9 states. [2019-09-08 12:46:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:01,593 INFO L93 Difference]: Finished difference Result 1893 states and 2523 transitions. [2019-09-08 12:46:01,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:01,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:01,596 INFO L225 Difference]: With dead ends: 1893 [2019-09-08 12:46:01,596 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:46:01,596 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:46:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:46:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:46:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1435 transitions. [2019-09-08 12:46:01,749 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1435 transitions. Word has length 120 [2019-09-08 12:46:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:01,749 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1435 transitions. [2019-09-08 12:46:01,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1435 transitions. [2019-09-08 12:46:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:01,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:01,751 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,751 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:01,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:01,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1490169743, now seen corresponding path program 1 times [2019-09-08 12:46:01,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:01,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:01,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:01,910 INFO L134 CoverageAnalysis]: 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:01,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:01,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:01,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:01,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:01,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:01,911 INFO L87 Difference]: Start difference. First operand 1088 states and 1435 transitions. Second operand 9 states. [2019-09-08 12:46:05,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:05,669 INFO L93 Difference]: Finished difference Result 1825 states and 2404 transitions. [2019-09-08 12:46:05,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:05,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:05,672 INFO L225 Difference]: With dead ends: 1825 [2019-09-08 12:46:05,672 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:46:05,673 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:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:46:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:46:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1434 transitions. [2019-09-08 12:46:05,829 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1434 transitions. Word has length 120 [2019-09-08 12:46:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:05,830 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1434 transitions. [2019-09-08 12:46:05,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1434 transitions. [2019-09-08 12:46:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:05,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:05,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,832 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:05,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:05,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1643582949, now seen corresponding path program 1 times [2019-09-08 12:46:05,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:05,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:05,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:05,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:05,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:06,018 INFO L134 CoverageAnalysis]: 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:06,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:06,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:06,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:06,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:06,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:06,019 INFO L87 Difference]: Start difference. First operand 1088 states and 1434 transitions. Second operand 9 states. [2019-09-08 12:46:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:09,774 INFO L93 Difference]: Finished difference Result 1825 states and 2403 transitions. [2019-09-08 12:46:09,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:09,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:09,776 INFO L225 Difference]: With dead ends: 1825 [2019-09-08 12:46:09,776 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:46:09,777 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:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:46:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:46:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1433 transitions. [2019-09-08 12:46:09,933 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1433 transitions. Word has length 120 [2019-09-08 12:46:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:09,933 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1433 transitions. [2019-09-08 12:46:09,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1433 transitions. [2019-09-08 12:46:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:09,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:09,934 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,934 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:09,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:09,935 INFO L82 PathProgramCache]: Analyzing trace with hash -526309723, now seen corresponding path program 1 times [2019-09-08 12:46:09,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:09,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:09,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:09,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:09,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:10,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:46:10,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:10,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:10,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:10,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:10,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:10,094 INFO L87 Difference]: Start difference. First operand 1088 states and 1433 transitions. Second operand 9 states. [2019-09-08 12:46:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:13,843 INFO L93 Difference]: Finished difference Result 1822 states and 2398 transitions. [2019-09-08 12:46:13,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:13,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:13,845 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:46:13,845 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:46:13,846 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:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:46:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:46:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1432 transitions. [2019-09-08 12:46:14,000 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1432 transitions. Word has length 120 [2019-09-08 12:46:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:14,000 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1432 transitions. [2019-09-08 12:46:14,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1432 transitions. [2019-09-08 12:46:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:14,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:14,002 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,002 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:14,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:14,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1818410374, now seen corresponding path program 1 times [2019-09-08 12:46:14,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:14,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:14,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:14,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:14,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:14,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:14,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:14,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:14,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:14,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:14,155 INFO L87 Difference]: Start difference. First operand 1088 states and 1432 transitions. Second operand 9 states. [2019-09-08 12:46:17,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:17,751 INFO L93 Difference]: Finished difference Result 1822 states and 2397 transitions. [2019-09-08 12:46:17,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:17,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:17,753 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:46:17,753 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:46:17,755 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:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:46:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:46:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1431 transitions. [2019-09-08 12:46:17,920 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1431 transitions. Word has length 120 [2019-09-08 12:46:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:17,921 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1431 transitions. [2019-09-08 12:46:17,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1431 transitions. [2019-09-08 12:46:17,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:17,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:17,922 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,922 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:17,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:17,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2031462205, now seen corresponding path program 1 times [2019-09-08 12:46:17,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:17,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:17,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:17,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:17,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:18,065 INFO L134 CoverageAnalysis]: 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:18,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:18,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:18,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:18,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:18,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:18,066 INFO L87 Difference]: Start difference. First operand 1088 states and 1431 transitions. Second operand 9 states. [2019-09-08 12:46:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:21,720 INFO L93 Difference]: Finished difference Result 1822 states and 2395 transitions. [2019-09-08 12:46:21,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:21,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:21,724 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:46:21,724 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:46:21,725 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:21,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:46:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:46:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1430 transitions. [2019-09-08 12:46:21,907 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1430 transitions. Word has length 120 [2019-09-08 12:46:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:21,908 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1430 transitions. [2019-09-08 12:46:21,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1430 transitions. [2019-09-08 12:46:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:21,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:21,909 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,909 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:21,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash -34663321, now seen corresponding path program 1 times [2019-09-08 12:46:21,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:21,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:21,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:22,063 INFO L134 CoverageAnalysis]: 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:22,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:22,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:22,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:22,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:22,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:22,064 INFO L87 Difference]: Start difference. First operand 1088 states and 1430 transitions. Second operand 9 states. [2019-09-08 12:46:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:26,171 INFO L93 Difference]: Finished difference Result 1888 states and 2509 transitions. [2019-09-08 12:46:26,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:26,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:26,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:26,173 INFO L225 Difference]: With dead ends: 1888 [2019-09-08 12:46:26,173 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:46:26,173 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:26,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:46:26,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:46:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1429 transitions. [2019-09-08 12:46:26,333 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1429 transitions. Word has length 120 [2019-09-08 12:46:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:26,333 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1429 transitions. [2019-09-08 12:46:26,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1429 transitions. [2019-09-08 12:46:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:26,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:26,335 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:26,335 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:26,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:26,335 INFO L82 PathProgramCache]: Analyzing trace with hash 462579645, now seen corresponding path program 1 times [2019-09-08 12:46:26,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:26,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:26,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:26,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:26,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:26,481 INFO L134 CoverageAnalysis]: 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:26,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:26,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:26,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:26,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:26,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:26,482 INFO L87 Difference]: Start difference. First operand 1088 states and 1429 transitions. Second operand 9 states. [2019-09-08 12:46:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:30,256 INFO L93 Difference]: Finished difference Result 1893 states and 2512 transitions. [2019-09-08 12:46:30,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:30,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:30,259 INFO L225 Difference]: With dead ends: 1893 [2019-09-08 12:46:30,259 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:46:30,259 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:46:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:46:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:46:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1428 transitions. [2019-09-08 12:46:30,427 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1428 transitions. Word has length 120 [2019-09-08 12:46:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:30,427 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1428 transitions. [2019-09-08 12:46:30,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1428 transitions. [2019-09-08 12:46:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:30,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:30,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,429 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:30,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:30,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1466576867, now seen corresponding path program 1 times [2019-09-08 12:46:30,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:30,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:30,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:30,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:30,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:30,601 INFO L134 CoverageAnalysis]: 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,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:30,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:30,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:30,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:30,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:30,602 INFO L87 Difference]: Start difference. First operand 1088 states and 1428 transitions. Second operand 9 states. [2019-09-08 12:46:34,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:34,298 INFO L93 Difference]: Finished difference Result 1825 states and 2395 transitions. [2019-09-08 12:46:34,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:34,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:34,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:34,301 INFO L225 Difference]: With dead ends: 1825 [2019-09-08 12:46:34,301 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:46:34,301 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,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:46:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:46:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1427 transitions. [2019-09-08 12:46:34,466 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1427 transitions. Word has length 120 [2019-09-08 12:46:34,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:34,466 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1427 transitions. [2019-09-08 12:46:34,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1427 transitions. [2019-09-08 12:46:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:34,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:34,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,467 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:34,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:34,468 INFO L82 PathProgramCache]: Analyzing trace with hash -502475548, now seen corresponding path program 1 times [2019-09-08 12:46:34,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:34,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:34,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:34,618 INFO L134 CoverageAnalysis]: 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,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:34,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:34,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:34,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:34,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:34,619 INFO L87 Difference]: Start difference. First operand 1088 states and 1427 transitions. Second operand 9 states. [2019-09-08 12:46:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:37,978 INFO L93 Difference]: Finished difference Result 1822 states and 2391 transitions. [2019-09-08 12:46:37,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:37,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:37,981 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:46:37,981 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:46:37,982 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:46:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:46:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:46:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1426 transitions. [2019-09-08 12:46:38,147 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1426 transitions. Word has length 120 [2019-09-08 12:46:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:38,147 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1426 transitions. [2019-09-08 12:46:38,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1426 transitions. [2019-09-08 12:46:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:38,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:38,148 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,149 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1493972807, now seen corresponding path program 1 times [2019-09-08 12:46:38,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:38,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:38,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:38,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:38,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:38,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:38,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:38,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:38,303 INFO L87 Difference]: Start difference. First operand 1088 states and 1426 transitions. Second operand 9 states. [2019-09-08 12:46:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:42,159 INFO L93 Difference]: Finished difference Result 1888 states and 2502 transitions. [2019-09-08 12:46:42,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:42,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:42,162 INFO L225 Difference]: With dead ends: 1888 [2019-09-08 12:46:42,162 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:46:42,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:46:42,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:46:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:46:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1425 transitions. [2019-09-08 12:46:42,342 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1425 transitions. Word has length 120 [2019-09-08 12:46:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:42,342 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1425 transitions. [2019-09-08 12:46:42,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1425 transitions. [2019-09-08 12:46:42,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:42,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:42,344 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,344 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2061061959, now seen corresponding path program 1 times [2019-09-08 12:46:42,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:42,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:42,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:42,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:46:42,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:42,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:42,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:42,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:42,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:42,514 INFO L87 Difference]: Start difference. First operand 1088 states and 1425 transitions. Second operand 9 states. [2019-09-08 12:46:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:46,193 INFO L93 Difference]: Finished difference Result 1948 states and 2586 transitions. [2019-09-08 12:46:46,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:46,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:46,196 INFO L225 Difference]: With dead ends: 1948 [2019-09-08 12:46:46,196 INFO L226 Difference]: Without dead ends: 1822 [2019-09-08 12:46:46,197 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:46:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-08 12:46:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1088. [2019-09-08 12:46:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1424 transitions. [2019-09-08 12:46:46,397 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1424 transitions. Word has length 120 [2019-09-08 12:46:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:46,397 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1424 transitions. [2019-09-08 12:46:46,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1424 transitions. [2019-09-08 12:46:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:46,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:46,399 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,399 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:46,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:46,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1566617361, now seen corresponding path program 1 times [2019-09-08 12:46:46,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:46,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:46,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:46,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:46,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:46,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:46,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:46,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:46,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:46,568 INFO L87 Difference]: Start difference. First operand 1088 states and 1424 transitions. Second operand 9 states. [2019-09-08 12:46:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:50,266 INFO L93 Difference]: Finished difference Result 1825 states and 2391 transitions. [2019-09-08 12:46:50,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:50,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:50,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:50,268 INFO L225 Difference]: With dead ends: 1825 [2019-09-08 12:46:50,268 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:46:50,269 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:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:46:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:46:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1423 transitions. [2019-09-08 12:46:50,442 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1423 transitions. Word has length 120 [2019-09-08 12:46:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:50,442 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1423 transitions. [2019-09-08 12:46:50,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1423 transitions. [2019-09-08 12:46:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:50,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:50,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,444 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:50,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:50,444 INFO L82 PathProgramCache]: Analyzing trace with hash -799193423, now seen corresponding path program 1 times [2019-09-08 12:46:50,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:50,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:50,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:50,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:50,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:50,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:46:50,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:50,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:50,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:50,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:50,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:50,588 INFO L87 Difference]: Start difference. First operand 1088 states and 1423 transitions. Second operand 9 states. [2019-09-08 12:46:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:54,651 INFO L93 Difference]: Finished difference Result 1893 states and 2504 transitions. [2019-09-08 12:46:54,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:54,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:54,653 INFO L225 Difference]: With dead ends: 1893 [2019-09-08 12:46:54,653 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:46:54,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:46:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:46:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:46:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1422 transitions. [2019-09-08 12:46:54,826 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1422 transitions. Word has length 120 [2019-09-08 12:46:54,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:54,826 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1422 transitions. [2019-09-08 12:46:54,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1422 transitions. [2019-09-08 12:46:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:54,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:54,828 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,828 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:54,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1289509032, now seen corresponding path program 1 times [2019-09-08 12:46:54,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:54,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:54,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:54,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:54,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:54,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:54,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:54,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:54,982 INFO L87 Difference]: Start difference. First operand 1088 states and 1422 transitions. Second operand 9 states. [2019-09-08 12:46:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:58,606 INFO L93 Difference]: Finished difference Result 1822 states and 2386 transitions. [2019-09-08 12:46:58,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:46:58,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:46:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:58,609 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:46:58,609 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:46:58,610 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:46:58,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:46:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:46:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:46:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1421 transitions. [2019-09-08 12:46:58,803 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1421 transitions. Word has length 120 [2019-09-08 12:46:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:58,803 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1421 transitions. [2019-09-08 12:46:58,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1421 transitions. [2019-09-08 12:46:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:46:58,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:58,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, 1, 1, 1] [2019-09-08 12:46:58,805 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:58,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:58,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1774124078, now seen corresponding path program 1 times [2019-09-08 12:46:58,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:58,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:58,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:58,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:58,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:58,978 INFO L134 CoverageAnalysis]: 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:58,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:58,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:46:58,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:46:58,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:46:58,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:46:58,979 INFO L87 Difference]: Start difference. First operand 1088 states and 1421 transitions. Second operand 9 states. [2019-09-08 12:47:02,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:02,573 INFO L93 Difference]: Finished difference Result 1820 states and 2382 transitions. [2019-09-08 12:47:02,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:02,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:02,576 INFO L225 Difference]: With dead ends: 1820 [2019-09-08 12:47:02,576 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:47:02,577 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:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:47:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:47:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1420 transitions. [2019-09-08 12:47:02,755 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1420 transitions. Word has length 120 [2019-09-08 12:47:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:02,755 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1420 transitions. [2019-09-08 12:47:02,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1420 transitions. [2019-09-08 12:47:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:02,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:02,756 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,756 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:02,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:02,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1734122598, now seen corresponding path program 1 times [2019-09-08 12:47:02,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:02,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:02,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:02,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:02,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:02,932 INFO L134 CoverageAnalysis]: 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:02,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:02,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:02,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:02,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:02,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:02,933 INFO L87 Difference]: Start difference. First operand 1088 states and 1420 transitions. Second operand 9 states. [2019-09-08 12:47:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:06,983 INFO L93 Difference]: Finished difference Result 1888 states and 2495 transitions. [2019-09-08 12:47:06,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:06,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:06,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:06,985 INFO L225 Difference]: With dead ends: 1888 [2019-09-08 12:47:06,986 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:47:06,986 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:47:06,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:47:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:47:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1419 transitions. [2019-09-08 12:47:07,172 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1419 transitions. Word has length 120 [2019-09-08 12:47:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:07,172 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1419 transitions. [2019-09-08 12:47:07,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1419 transitions. [2019-09-08 12:47:07,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:07,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:07,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,173 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:07,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:07,174 INFO L82 PathProgramCache]: Analyzing trace with hash -928740028, now seen corresponding path program 1 times [2019-09-08 12:47:07,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:07,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:07,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:07,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:07,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:07,316 INFO L134 CoverageAnalysis]: 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:07,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:07,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:07,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:07,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:07,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:07,317 INFO L87 Difference]: Start difference. First operand 1088 states and 1419 transitions. Second operand 9 states. [2019-09-08 12:47:11,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:11,044 INFO L93 Difference]: Finished difference Result 1822 states and 2382 transitions. [2019-09-08 12:47:11,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:11,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:11,047 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:47:11,047 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:47:11,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:47:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:47:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:47:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1418 transitions. [2019-09-08 12:47:11,228 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1418 transitions. Word has length 120 [2019-09-08 12:47:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:11,228 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1418 transitions. [2019-09-08 12:47:11,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:11,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1418 transitions. [2019-09-08 12:47:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:11,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:11,229 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,229 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:11,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:11,230 INFO L82 PathProgramCache]: Analyzing trace with hash -2093888074, now seen corresponding path program 1 times [2019-09-08 12:47:11,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:11,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:11,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:11,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:11,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:11,420 INFO L134 CoverageAnalysis]: 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:11,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:11,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:11,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:11,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:11,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:11,421 INFO L87 Difference]: Start difference. First operand 1088 states and 1418 transitions. Second operand 9 states. [2019-09-08 12:47:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:15,635 INFO L93 Difference]: Finished difference Result 1884 states and 2488 transitions. [2019-09-08 12:47:15,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:15,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:15,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:15,638 INFO L225 Difference]: With dead ends: 1884 [2019-09-08 12:47:15,638 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:47:15,639 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:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:47:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:47:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1417 transitions. [2019-09-08 12:47:15,823 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1417 transitions. Word has length 120 [2019-09-08 12:47:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:15,823 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1417 transitions. [2019-09-08 12:47:15,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1417 transitions. [2019-09-08 12:47:15,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:15,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:15,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,824 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:15,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash -2079343493, now seen corresponding path program 1 times [2019-09-08 12:47:15,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:15,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:15,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:15,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:15,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:15,978 INFO L134 CoverageAnalysis]: 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:15,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:15,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:15,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:15,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:15,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:15,980 INFO L87 Difference]: Start difference. First operand 1088 states and 1417 transitions. Second operand 9 states. [2019-09-08 12:47:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:19,784 INFO L93 Difference]: Finished difference Result 1888 states and 2489 transitions. [2019-09-08 12:47:19,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:19,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:19,787 INFO L225 Difference]: With dead ends: 1888 [2019-09-08 12:47:19,787 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:47:19,788 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:47:19,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:47:19,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:47:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1416 transitions. [2019-09-08 12:47:19,980 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1416 transitions. Word has length 120 [2019-09-08 12:47:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:19,980 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1416 transitions. [2019-09-08 12:47:19,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1416 transitions. [2019-09-08 12:47:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:19,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:19,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:19,982 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:19,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:19,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1273960923, now seen corresponding path program 1 times [2019-09-08 12:47:19,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:19,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:19,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:19,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:19,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:20,143 INFO L134 CoverageAnalysis]: 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:20,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:20,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:20,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:20,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:20,144 INFO L87 Difference]: Start difference. First operand 1088 states and 1416 transitions. Second operand 9 states. [2019-09-08 12:47:23,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:23,852 INFO L93 Difference]: Finished difference Result 1822 states and 2379 transitions. [2019-09-08 12:47:23,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:23,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:23,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:23,854 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:47:23,854 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:47:23,855 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:23,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:47:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:47:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1415 transitions. [2019-09-08 12:47:24,041 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1415 transitions. Word has length 120 [2019-09-08 12:47:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:24,041 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1415 transitions. [2019-09-08 12:47:24,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1415 transitions. [2019-09-08 12:47:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:24,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:24,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, 1, 1, 1] [2019-09-08 12:47:24,043 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:24,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:24,043 INFO L82 PathProgramCache]: Analyzing trace with hash 944288137, now seen corresponding path program 1 times [2019-09-08 12:47:24,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:24,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:24,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:24,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:24,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:24,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:24,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:24,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:24,197 INFO L87 Difference]: Start difference. First operand 1088 states and 1415 transitions. Second operand 9 states. [2019-09-08 12:47:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:28,040 INFO L93 Difference]: Finished difference Result 1822 states and 2378 transitions. [2019-09-08 12:47:28,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:28,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:28,043 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:47:28,043 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:47:28,044 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:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:47:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:47:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1414 transitions. [2019-09-08 12:47:28,256 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1414 transitions. Word has length 120 [2019-09-08 12:47:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:28,256 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1414 transitions. [2019-09-08 12:47:28,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1414 transitions. [2019-09-08 12:47:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:28,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:28,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,258 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:28,258 INFO L82 PathProgramCache]: Analyzing trace with hash -349907354, now seen corresponding path program 1 times [2019-09-08 12:47:28,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:28,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:28,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:28,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:28,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:28,420 INFO L134 CoverageAnalysis]: 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:28,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:28,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:28,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:28,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:28,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:28,421 INFO L87 Difference]: Start difference. First operand 1088 states and 1414 transitions. Second operand 9 states. [2019-09-08 12:47:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:32,169 INFO L93 Difference]: Finished difference Result 1820 states and 2374 transitions. [2019-09-08 12:47:32,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:32,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:32,171 INFO L225 Difference]: With dead ends: 1820 [2019-09-08 12:47:32,171 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:47:32,172 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:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:47:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:47:32,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1413 transitions. [2019-09-08 12:47:32,363 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1413 transitions. Word has length 120 [2019-09-08 12:47:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:32,363 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1413 transitions. [2019-09-08 12:47:32,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1413 transitions. [2019-09-08 12:47:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:32,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:32,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,364 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:32,364 INFO L82 PathProgramCache]: Analyzing trace with hash -3622801, now seen corresponding path program 1 times [2019-09-08 12:47:32,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:32,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:32,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:32,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:32,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:32,552 INFO L134 CoverageAnalysis]: 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:32,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:32,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:32,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:32,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:32,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:32,554 INFO L87 Difference]: Start difference. First operand 1088 states and 1413 transitions. Second operand 9 states. [2019-09-08 12:47:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:36,389 INFO L93 Difference]: Finished difference Result 1807 states and 2362 transitions. [2019-09-08 12:47:36,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:36,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:36,392 INFO L225 Difference]: With dead ends: 1807 [2019-09-08 12:47:36,392 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:47:36,392 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:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:47:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:47:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1412 transitions. [2019-09-08 12:47:36,586 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1412 transitions. Word has length 120 [2019-09-08 12:47:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:36,586 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1412 transitions. [2019-09-08 12:47:36,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1412 transitions. [2019-09-08 12:47:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:36,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:36,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, 1] [2019-09-08 12:47:36,587 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:36,588 INFO L82 PathProgramCache]: Analyzing trace with hash 381425360, now seen corresponding path program 1 times [2019-09-08 12:47:36,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:36,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:36,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:36,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:36,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:36,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:36,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:36,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:36,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:36,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:36,757 INFO L87 Difference]: Start difference. First operand 1088 states and 1412 transitions. Second operand 9 states. [2019-09-08 12:47:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:40,473 INFO L93 Difference]: Finished difference Result 1739 states and 2250 transitions. [2019-09-08 12:47:40,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:40,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:40,476 INFO L225 Difference]: With dead ends: 1739 [2019-09-08 12:47:40,476 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:47:40,477 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:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:47:40,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:47:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1411 transitions. [2019-09-08 12:47:40,675 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1411 transitions. Word has length 120 [2019-09-08 12:47:40,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:40,675 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1411 transitions. [2019-09-08 12:47:40,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:40,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1411 transitions. [2019-09-08 12:47:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:40,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:40,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,676 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:40,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:40,677 INFO L82 PathProgramCache]: Analyzing trace with hash 663554906, now seen corresponding path program 1 times [2019-09-08 12:47:40,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:40,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:40,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:40,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:40,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:40,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:40,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:40,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:40,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:40,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:40,827 INFO L87 Difference]: Start difference. First operand 1088 states and 1411 transitions. Second operand 9 states. [2019-09-08 12:47:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:44,784 INFO L93 Difference]: Finished difference Result 1888 states and 2479 transitions. [2019-09-08 12:47:44,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:44,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:44,786 INFO L225 Difference]: With dead ends: 1888 [2019-09-08 12:47:44,786 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:47:44,786 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:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:47:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:47:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1410 transitions. [2019-09-08 12:47:44,994 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1410 transitions. Word has length 120 [2019-09-08 12:47:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:44,994 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1410 transitions. [2019-09-08 12:47:44,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1410 transitions. [2019-09-08 12:47:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:44,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:44,995 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,995 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:44,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:44,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1468937476, now seen corresponding path program 1 times [2019-09-08 12:47:44,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:44,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:44,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:45,147 INFO L134 CoverageAnalysis]: 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:45,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:45,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:45,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:45,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:45,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:45,148 INFO L87 Difference]: Start difference. First operand 1088 states and 1410 transitions. Second operand 9 states. [2019-09-08 12:47:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:48,565 INFO L93 Difference]: Finished difference Result 1822 states and 2372 transitions. [2019-09-08 12:47:48,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:48,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:48,567 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:47:48,567 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:47:48,568 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:47:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:47:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:47:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1409 transitions. [2019-09-08 12:47:48,767 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1409 transitions. Word has length 120 [2019-09-08 12:47:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:48,767 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1409 transitions. [2019-09-08 12:47:48,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1409 transitions. [2019-09-08 12:47:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:48,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:48,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,769 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:48,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:48,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1182548337, now seen corresponding path program 1 times [2019-09-08 12:47:48,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:48,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:48,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:48,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:48,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:48,921 INFO L134 CoverageAnalysis]: 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:48,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:48,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:48,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:48,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:48,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:48,922 INFO L87 Difference]: Start difference. First operand 1088 states and 1409 transitions. Second operand 9 states. [2019-09-08 12:47:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:52,996 INFO L93 Difference]: Finished difference Result 1893 states and 2483 transitions. [2019-09-08 12:47:52,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:52,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:52,998 INFO L225 Difference]: With dead ends: 1893 [2019-09-08 12:47:52,998 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:47:52,999 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:53,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:47:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:47:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1408 transitions. [2019-09-08 12:47:53,239 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1408 transitions. Word has length 120 [2019-09-08 12:47:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:53,239 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1408 transitions. [2019-09-08 12:47:53,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1408 transitions. [2019-09-08 12:47:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:53,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:53,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,241 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash 215975840, now seen corresponding path program 1 times [2019-09-08 12:47:53,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:53,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:53,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:53,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:53,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:53,395 INFO L134 CoverageAnalysis]: 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:53,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:53,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:53,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:53,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:53,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:53,396 INFO L87 Difference]: Start difference. First operand 1088 states and 1408 transitions. Second operand 9 states. [2019-09-08 12:47:57,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:57,140 INFO L93 Difference]: Finished difference Result 1822 states and 2370 transitions. [2019-09-08 12:47:57,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:47:57,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:47:57,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:57,142 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:47:57,143 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:47:57,143 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:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:47:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:47:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:47:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1407 transitions. [2019-09-08 12:47:57,369 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1407 transitions. Word has length 120 [2019-09-08 12:47:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:57,369 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1407 transitions. [2019-09-08 12:47:57,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:47:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1407 transitions. [2019-09-08 12:47:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:47:57,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:57,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:57,370 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:57,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:57,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2081025797, now seen corresponding path program 1 times [2019-09-08 12:47:57,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:57,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:57,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:57,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:57,517 INFO L134 CoverageAnalysis]: 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,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:47:57,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:47:57,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:47:57,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:47:57,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:47:57,518 INFO L87 Difference]: Start difference. First operand 1088 states and 1407 transitions. Second operand 9 states. [2019-09-08 12:48:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:01,447 INFO L93 Difference]: Finished difference Result 1888 states and 2475 transitions. [2019-09-08 12:48:01,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:01,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:01,449 INFO L225 Difference]: With dead ends: 1888 [2019-09-08 12:48:01,450 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:48:01,450 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:48:01,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:48:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:48:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1406 transitions. [2019-09-08 12:48:01,664 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1406 transitions. Word has length 120 [2019-09-08 12:48:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:01,664 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1406 transitions. [2019-09-08 12:48:01,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1406 transitions. [2019-09-08 12:48:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:01,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:01,665 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,666 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:01,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:01,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1734271359, now seen corresponding path program 1 times [2019-09-08 12:48:01,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:01,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:01,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:01,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:01,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:01,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:48:01,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:01,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:01,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:01,823 INFO L87 Difference]: Start difference. First operand 1088 states and 1406 transitions. Second operand 9 states. [2019-09-08 12:48:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:05,770 INFO L93 Difference]: Finished difference Result 1822 states and 2368 transitions. [2019-09-08 12:48:05,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:05,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:05,772 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:48:05,772 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:48:05,773 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:48:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:48:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:48:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1405 transitions. [2019-09-08 12:48:05,985 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1405 transitions. Word has length 120 [2019-09-08 12:48:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:05,985 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1405 transitions. [2019-09-08 12:48:05,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1405 transitions. [2019-09-08 12:48:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:05,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:05,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:05,987 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:05,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:05,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1289176642, now seen corresponding path program 1 times [2019-09-08 12:48:05,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:05,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:05,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:05,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:05,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:06,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:06,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:06,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:06,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:06,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:06,139 INFO L87 Difference]: Start difference. First operand 1088 states and 1405 transitions. Second operand 9 states. [2019-09-08 12:48:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:09,590 INFO L93 Difference]: Finished difference Result 1822 states and 2366 transitions. [2019-09-08 12:48:09,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:09,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:09,593 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:48:09,593 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:48:09,594 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:48:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:48:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:48:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1404 transitions. [2019-09-08 12:48:09,857 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1404 transitions. Word has length 120 [2019-09-08 12:48:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:09,857 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1404 transitions. [2019-09-08 12:48:09,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1404 transitions. [2019-09-08 12:48:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:09,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:09,859 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,859 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:09,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:09,859 INFO L82 PathProgramCache]: Analyzing trace with hash 708898247, now seen corresponding path program 1 times [2019-09-08 12:48:09,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:09,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:09,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:09,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:09,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:10,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:10,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:10,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:10,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:10,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:10,014 INFO L87 Difference]: Start difference. First operand 1088 states and 1404 transitions. Second operand 9 states. [2019-09-08 12:48:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:14,050 INFO L93 Difference]: Finished difference Result 1888 states and 2471 transitions. [2019-09-08 12:48:14,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:14,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:14,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:14,052 INFO L225 Difference]: With dead ends: 1888 [2019-09-08 12:48:14,053 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:48:14,053 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:48:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:48:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:48:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1403 transitions. [2019-09-08 12:48:14,261 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1403 transitions. Word has length 120 [2019-09-08 12:48:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:14,261 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1403 transitions. [2019-09-08 12:48:14,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1403 transitions. [2019-09-08 12:48:14,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:14,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:14,262 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,262 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:14,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:14,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1239740929, now seen corresponding path program 1 times [2019-09-08 12:48:14,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:14,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:14,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:14,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:14,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:14,442 INFO L134 CoverageAnalysis]: 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:14,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:14,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:14,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:14,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:14,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:14,444 INFO L87 Difference]: Start difference. First operand 1088 states and 1403 transitions. Second operand 9 states. [2019-09-08 12:48:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:18,588 INFO L93 Difference]: Finished difference Result 1883 states and 2465 transitions. [2019-09-08 12:48:18,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:18,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:18,591 INFO L225 Difference]: With dead ends: 1883 [2019-09-08 12:48:18,591 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:48:18,592 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:48:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:48:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:48:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1402 transitions. [2019-09-08 12:48:18,807 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1402 transitions. Word has length 120 [2019-09-08 12:48:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:18,807 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1402 transitions. [2019-09-08 12:48:18,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1402 transitions. [2019-09-08 12:48:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:18,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:18,808 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,808 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:18,808 INFO L82 PathProgramCache]: Analyzing trace with hash 822642674, now seen corresponding path program 1 times [2019-09-08 12:48:18,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:18,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:18,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:18,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:18,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:18,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:48:18,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:18,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:18,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:18,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:18,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:18,951 INFO L87 Difference]: Start difference. First operand 1088 states and 1402 transitions. Second operand 9 states. [2019-09-08 12:48:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:23,036 INFO L93 Difference]: Finished difference Result 1884 states and 2464 transitions. [2019-09-08 12:48:23,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:23,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:23,038 INFO L225 Difference]: With dead ends: 1884 [2019-09-08 12:48:23,038 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:48:23,038 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:48:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:48:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:48:23,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1401 transitions. [2019-09-08 12:48:23,251 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1401 transitions. Word has length 120 [2019-09-08 12:48:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:23,251 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1401 transitions. [2019-09-08 12:48:23,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1401 transitions. [2019-09-08 12:48:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:23,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:23,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,252 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:23,253 INFO L82 PathProgramCache]: Analyzing trace with hash -597710621, now seen corresponding path program 1 times [2019-09-08 12:48:23,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:23,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:23,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:23,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:23,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:23,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:48:23,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:23,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:23,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:23,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:23,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:23,407 INFO L87 Difference]: Start difference. First operand 1088 states and 1401 transitions. Second operand 9 states. [2019-09-08 12:48:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:26,840 INFO L93 Difference]: Finished difference Result 1822 states and 2362 transitions. [2019-09-08 12:48:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:26,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:26,843 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:48:26,843 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:48:26,843 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:48:26,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:48:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:48:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1400 transitions. [2019-09-08 12:48:27,063 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1400 transitions. Word has length 120 [2019-09-08 12:48:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:27,063 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1400 transitions. [2019-09-08 12:48:27,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1400 transitions. [2019-09-08 12:48:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:27,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:27,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,065 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:27,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:27,065 INFO L82 PathProgramCache]: Analyzing trace with hash -152615904, now seen corresponding path program 1 times [2019-09-08 12:48:27,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:27,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:27,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:27,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:27,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:27,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:27,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:27,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:27,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:27,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:27,229 INFO L87 Difference]: Start difference. First operand 1088 states and 1400 transitions. Second operand 9 states. [2019-09-08 12:48:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:30,583 INFO L93 Difference]: Finished difference Result 1822 states and 2360 transitions. [2019-09-08 12:48:30,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:30,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:30,586 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:48:30,586 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:48:30,587 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:48:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:48:30,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:48:30,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1399 transitions. [2019-09-08 12:48:30,842 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1399 transitions. Word has length 120 [2019-09-08 12:48:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:30,842 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1399 transitions. [2019-09-08 12:48:30,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1399 transitions. [2019-09-08 12:48:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:30,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:30,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,843 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:30,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:30,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1845663543, now seen corresponding path program 1 times [2019-09-08 12:48:30,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:30,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:30,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:30,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:30,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:30,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:48:30,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:30,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:30,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:30,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:30,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:30,990 INFO L87 Difference]: Start difference. First operand 1088 states and 1399 transitions. Second operand 9 states. [2019-09-08 12:48:34,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:34,875 INFO L93 Difference]: Finished difference Result 1888 states and 2463 transitions. [2019-09-08 12:48:34,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:34,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:34,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:34,877 INFO L225 Difference]: With dead ends: 1888 [2019-09-08 12:48:34,877 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:48:34,878 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:48:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:48:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:48:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1398 transitions. [2019-09-08 12:48:35,097 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1398 transitions. Word has length 120 [2019-09-08 12:48:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:35,097 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1398 transitions. [2019-09-08 12:48:35,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1398 transitions. [2019-09-08 12:48:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:35,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:35,098 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,099 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:35,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1134633556, now seen corresponding path program 1 times [2019-09-08 12:48:35,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:35,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:35,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:35,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:35,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:35,257 INFO L134 CoverageAnalysis]: 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,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:35,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:35,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:35,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:35,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:35,258 INFO L87 Difference]: Start difference. First operand 1088 states and 1398 transitions. Second operand 9 states. [2019-09-08 12:48:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:38,910 INFO L93 Difference]: Finished difference Result 1822 states and 2358 transitions. [2019-09-08 12:48:38,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:38,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:38,913 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:48:38,913 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:48:38,914 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:48:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:48:39,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:48:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1397 transitions. [2019-09-08 12:48:39,139 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1397 transitions. Word has length 120 [2019-09-08 12:48:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:39,139 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1397 transitions. [2019-09-08 12:48:39,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1397 transitions. [2019-09-08 12:48:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:39,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:39,140 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,140 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:39,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1989155418, now seen corresponding path program 1 times [2019-09-08 12:48:39,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:39,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:39,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:39,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:39,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:39,291 INFO L134 CoverageAnalysis]: 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,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:39,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:39,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:39,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:39,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:39,293 INFO L87 Difference]: Start difference. First operand 1088 states and 1397 transitions. Second operand 9 states. [2019-09-08 12:48:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:42,848 INFO L93 Difference]: Finished difference Result 1820 states and 2354 transitions. [2019-09-08 12:48:42,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:42,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:42,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:42,851 INFO L225 Difference]: With dead ends: 1820 [2019-09-08 12:48:42,851 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:48:42,851 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:48:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:48:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:48:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1396 transitions. [2019-09-08 12:48:43,078 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1396 transitions. Word has length 120 [2019-09-08 12:48:43,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:43,078 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1396 transitions. [2019-09-08 12:48:43,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1396 transitions. [2019-09-08 12:48:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:43,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:43,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,080 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:43,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:43,080 INFO L82 PathProgramCache]: Analyzing trace with hash 136702110, now seen corresponding path program 1 times [2019-09-08 12:48:43,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:43,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:43,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:43,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:43,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:43,244 INFO L134 CoverageAnalysis]: 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:43,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:43,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:43,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:43,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:43,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:43,246 INFO L87 Difference]: Start difference. First operand 1088 states and 1396 transitions. Second operand 9 states. [2019-09-08 12:48:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:46,932 INFO L93 Difference]: Finished difference Result 1888 states and 2458 transitions. [2019-09-08 12:48:46,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:46,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:46,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:46,934 INFO L225 Difference]: With dead ends: 1888 [2019-09-08 12:48:46,934 INFO L226 Difference]: Without dead ends: 1790 [2019-09-08 12:48:46,935 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:48:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-09-08 12:48:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1088. [2019-09-08 12:48:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1395 transitions. [2019-09-08 12:48:47,158 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1395 transitions. Word has length 120 [2019-09-08 12:48:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:47,158 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1395 transitions. [2019-09-08 12:48:47,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1395 transitions. [2019-09-08 12:48:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:47,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:47,160 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,160 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:47,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash 942084680, now seen corresponding path program 1 times [2019-09-08 12:48:47,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:47,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:47,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:47,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:47,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:48:47,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:47,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:47,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:47,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:47,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:47,305 INFO L87 Difference]: Start difference. First operand 1088 states and 1395 transitions. Second operand 9 states. [2019-09-08 12:48:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:50,828 INFO L93 Difference]: Finished difference Result 1822 states and 2354 transitions. [2019-09-08 12:48:50,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:50,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:50,830 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:48:50,831 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:48:50,832 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:48:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:48:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:48:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1394 transitions. [2019-09-08 12:48:51,072 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1394 transitions. Word has length 120 [2019-09-08 12:48:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:51,072 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1394 transitions. [2019-09-08 12:48:51,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1394 transitions. [2019-09-08 12:48:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:51,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:51,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:51,074 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1177456136, now seen corresponding path program 1 times [2019-09-08 12:48:51,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:51,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:51,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:51,215 INFO L134 CoverageAnalysis]: 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:51,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:51,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:51,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:51,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:51,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:51,216 INFO L87 Difference]: Start difference. First operand 1088 states and 1394 transitions. Second operand 9 states. [2019-09-08 12:48:55,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:55,233 INFO L93 Difference]: Finished difference Result 1822 states and 2353 transitions. [2019-09-08 12:48:55,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:55,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:55,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:55,235 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:48:55,235 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:48:55,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:48:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:48:55,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:48:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1393 transitions. [2019-09-08 12:48:55,464 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1393 transitions. Word has length 120 [2019-09-08 12:48:55,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:55,464 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1393 transitions. [2019-09-08 12:48:55,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1393 transitions. [2019-09-08 12:48:55,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:55,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:55,465 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:55,466 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:55,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:55,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1777985122, now seen corresponding path program 1 times [2019-09-08 12:48:55,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:55,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:55,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:55,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:48:55,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:48:55,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:48:55,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:48:55,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:48:55,608 INFO L87 Difference]: Start difference. First operand 1088 states and 1393 transitions. Second operand 9 states. [2019-09-08 12:48:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:59,586 INFO L93 Difference]: Finished difference Result 1820 states and 2349 transitions. [2019-09-08 12:48:59,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:48:59,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:48:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:59,589 INFO L225 Difference]: With dead ends: 1820 [2019-09-08 12:48:59,589 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:48:59,590 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:48:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:48:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:48:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:48:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1392 transitions. [2019-09-08 12:48:59,865 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1392 transitions. Word has length 120 [2019-09-08 12:48:59,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:59,865 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1392 transitions. [2019-09-08 12:48:59,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:48:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1392 transitions. [2019-09-08 12:48:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:48:59,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:59,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,866 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:59,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:59,867 INFO L82 PathProgramCache]: Analyzing trace with hash -743933870, now seen corresponding path program 1 times [2019-09-08 12:48:59,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:59,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:59,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:59,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:59,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:00,019 INFO L134 CoverageAnalysis]: 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:00,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:00,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:00,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:00,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:00,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:00,020 INFO L87 Difference]: Start difference. First operand 1088 states and 1392 transitions. Second operand 9 states. [2019-09-08 12:49:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:03,999 INFO L93 Difference]: Finished difference Result 1822 states and 2350 transitions. [2019-09-08 12:49:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:03,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:49:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:04,002 INFO L225 Difference]: With dead ends: 1822 [2019-09-08 12:49:04,002 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:49:04,002 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:49:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:49:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:49:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:49:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1391 transitions. [2019-09-08 12:49:04,235 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1391 transitions. Word has length 120 [2019-09-08 12:49:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:04,235 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1391 transitions. [2019-09-08 12:49:04,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1391 transitions. [2019-09-08 12:49:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:49:04,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:04,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,237 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:04,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:04,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1350775706, now seen corresponding path program 1 times [2019-09-08 12:49:04,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:04,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:04,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:04,383 INFO L134 CoverageAnalysis]: 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:04,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:04,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:04,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:04,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:04,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:04,384 INFO L87 Difference]: Start difference. First operand 1088 states and 1391 transitions. Second operand 9 states. [2019-09-08 12:49:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:08,373 INFO L93 Difference]: Finished difference Result 1820 states and 2346 transitions. [2019-09-08 12:49:08,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:08,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-08 12:49:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:08,376 INFO L225 Difference]: With dead ends: 1820 [2019-09-08 12:49:08,376 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:49:08,377 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:49:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:49:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:49:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:49:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1390 transitions. [2019-09-08 12:49:08,614 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1390 transitions. Word has length 120 [2019-09-08 12:49:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:08,614 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1390 transitions. [2019-09-08 12:49:08,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1390 transitions. [2019-09-08 12:49:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:49:08,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:08,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,616 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:08,616 INFO L82 PathProgramCache]: Analyzing trace with hash 780681115, now seen corresponding path program 1 times [2019-09-08 12:49:08,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:08,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:08,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:08,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:08,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:08,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:08,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:08,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:08,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:08,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:08,776 INFO L87 Difference]: Start difference. First operand 1088 states and 1390 transitions. Second operand 9 states. [2019-09-08 12:49:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:12,674 INFO L93 Difference]: Finished difference Result 1821 states and 2346 transitions. [2019-09-08 12:49:12,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:12,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:49:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:12,676 INFO L225 Difference]: With dead ends: 1821 [2019-09-08 12:49:12,676 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:49:12,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:49:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:49:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:49:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:49:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1389 transitions. [2019-09-08 12:49:12,957 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1389 transitions. Word has length 121 [2019-09-08 12:49:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:12,957 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1389 transitions. [2019-09-08 12:49:12,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1389 transitions. [2019-09-08 12:49:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:49:12,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:12,958 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,958 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:12,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:12,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1446425802, now seen corresponding path program 1 times [2019-09-08 12:49:12,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:12,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:12,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:12,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:12,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:13,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:13,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:13,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:13,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:13,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:13,103 INFO L87 Difference]: Start difference. First operand 1088 states and 1389 transitions. Second operand 9 states. [2019-09-08 12:49:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:16,956 INFO L93 Difference]: Finished difference Result 1821 states and 2345 transitions. [2019-09-08 12:49:16,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:16,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:49:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:16,958 INFO L225 Difference]: With dead ends: 1821 [2019-09-08 12:49:16,958 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:49:16,959 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:49:16,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:49:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:49:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:49:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1388 transitions. [2019-09-08 12:49:17,194 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1388 transitions. Word has length 121 [2019-09-08 12:49:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:17,194 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1388 transitions. [2019-09-08 12:49:17,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1388 transitions. [2019-09-08 12:49:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:49:17,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:17,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,196 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:17,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:17,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1590323129, now seen corresponding path program 1 times [2019-09-08 12:49:17,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:17,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:17,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:17,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:17,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:17,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:17,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:17,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:17,336 INFO L87 Difference]: Start difference. First operand 1088 states and 1388 transitions. Second operand 9 states. [2019-09-08 12:49:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:21,025 INFO L93 Difference]: Finished difference Result 1821 states and 2344 transitions. [2019-09-08 12:49:21,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:21,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:49:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:21,027 INFO L225 Difference]: With dead ends: 1821 [2019-09-08 12:49:21,027 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:49:21,027 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:49:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:49:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:49:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:49:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1387 transitions. [2019-09-08 12:49:21,264 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1387 transitions. Word has length 121 [2019-09-08 12:49:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:21,265 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1387 transitions. [2019-09-08 12:49:21,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1387 transitions. [2019-09-08 12:49:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:49:21,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:21,266 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,266 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash 855966831, now seen corresponding path program 1 times [2019-09-08 12:49:21,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:21,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:21,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:21,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:21,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:21,438 INFO L134 CoverageAnalysis]: 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:21,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:21,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:21,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:21,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:21,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:21,440 INFO L87 Difference]: Start difference. First operand 1088 states and 1387 transitions. Second operand 9 states. [2019-09-08 12:49:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:25,307 INFO L93 Difference]: Finished difference Result 1821 states and 2343 transitions. [2019-09-08 12:49:25,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:25,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:49:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:25,310 INFO L225 Difference]: With dead ends: 1821 [2019-09-08 12:49:25,310 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:49:25,311 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:49:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:49:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:49:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:49:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1386 transitions. [2019-09-08 12:49:25,554 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1386 transitions. Word has length 121 [2019-09-08 12:49:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:25,554 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1386 transitions. [2019-09-08 12:49:25,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:25,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1386 transitions. [2019-09-08 12:49:25,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:49:25,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:25,556 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:25,556 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:25,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1512469138, now seen corresponding path program 1 times [2019-09-08 12:49:25,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:25,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:25,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:25,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:25,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:25,711 INFO L134 CoverageAnalysis]: 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:25,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:25,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:25,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:25,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:25,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:25,712 INFO L87 Difference]: Start difference. First operand 1088 states and 1386 transitions. Second operand 9 states. [2019-09-08 12:49:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:29,668 INFO L93 Difference]: Finished difference Result 1821 states and 2341 transitions. [2019-09-08 12:49:29,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:29,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:49:29,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:29,671 INFO L225 Difference]: With dead ends: 1821 [2019-09-08 12:49:29,671 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:49:29,672 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:49:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:49:29,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:49:29,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:49:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1385 transitions. [2019-09-08 12:49:29,932 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1385 transitions. Word has length 121 [2019-09-08 12:49:29,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:29,932 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1385 transitions. [2019-09-08 12:49:29,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:29,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1385 transitions. [2019-09-08 12:49:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:49:29,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:29,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,933 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:29,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:29,934 INFO L82 PathProgramCache]: Analyzing trace with hash 202339011, now seen corresponding path program 1 times [2019-09-08 12:49:29,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:29,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:29,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:29,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:29,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:30,076 INFO L134 CoverageAnalysis]: 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,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:30,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:49:30,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:49:30,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:49:30,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:49:30,077 INFO L87 Difference]: Start difference. First operand 1088 states and 1385 transitions. Second operand 9 states. [2019-09-08 12:49:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:33,935 INFO L93 Difference]: Finished difference Result 1821 states and 2340 transitions. [2019-09-08 12:49:33,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:49:33,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-08 12:49:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:33,937 INFO L225 Difference]: With dead ends: 1821 [2019-09-08 12:49:33,937 INFO L226 Difference]: Without dead ends: 1734 [2019-09-08 12:49:33,938 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:49:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-08 12:49:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1088. [2019-09-08 12:49:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-08 12:49:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1384 transitions. [2019-09-08 12:49:34,185 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1384 transitions. Word has length 121 [2019-09-08 12:49:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:34,185 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1384 transitions. [2019-09-08 12:49:34,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:49:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1384 transitions. [2019-09-08 12:49:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:49:34,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:34,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,186 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:34,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:34,187 INFO L82 PathProgramCache]: Analyzing trace with hash -76336468, now seen corresponding path program 1 times [2019-09-08 12:49:34,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:34,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:34,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:34,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:34,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:35,694 INFO L134 CoverageAnalysis]: 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:35,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:35,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:49:35,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:49:35,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:49:35,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:49:35,695 INFO L87 Difference]: Start difference. First operand 1088 states and 1384 transitions. Second operand 21 states. [2019-09-08 12:49:36,601 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-09-08 12:49:36,826 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:49:37,111 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-09-08 12:49:37,303 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-08 12:49:37,488 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-08 12:49:37,759 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:49:49,361 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 12:49:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:50,529 INFO L93 Difference]: Finished difference Result 2459 states and 3087 transitions. [2019-09-08 12:49:50,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:49:50,529 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 122 [2019-09-08 12:49:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:50,533 INFO L225 Difference]: With dead ends: 2459 [2019-09-08 12:49:50,533 INFO L226 Difference]: Without dead ends: 2369 [2019-09-08 12:49:50,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:49:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-09-08 12:49:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1121. [2019-09-08 12:49:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-09-08 12:49:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1428 transitions. [2019-09-08 12:49:50,819 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1428 transitions. Word has length 122 [2019-09-08 12:49:50,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:49:50,819 INFO L475 AbstractCegarLoop]: Abstraction has 1121 states and 1428 transitions. [2019-09-08 12:49:50,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:49:50,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1428 transitions. [2019-09-08 12:49:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:49:50,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:49:50,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:49:50,820 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:49:50,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:49:50,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1490416469, now seen corresponding path program 1 times [2019-09-08 12:49:50,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:49:50,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:49:50,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:50,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:49:50,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:49:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:49:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:49:52,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:49:52,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:49:52,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:49:52,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:49:52,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:49:52,223 INFO L87 Difference]: Start difference. First operand 1121 states and 1428 transitions. Second operand 22 states. [2019-09-08 12:49:53,365 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 12:49:53,621 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-08 12:49:54,030 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 12:49:54,184 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 12:49:54,538 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 12:49:54,883 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 12:49:55,084 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 12:50:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:00,362 INFO L93 Difference]: Finished difference Result 2322 states and 2993 transitions. [2019-09-08 12:50:00,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:50:00,363 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-08 12:50:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:00,365 INFO L225 Difference]: With dead ends: 2322 [2019-09-08 12:50:00,365 INFO L226 Difference]: Without dead ends: 2165 [2019-09-08 12:50:00,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:50:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2019-09-08 12:50:00,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1133. [2019-09-08 12:50:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2019-09-08 12:50:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1440 transitions. [2019-09-08 12:50:00,667 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1440 transitions. Word has length 122 [2019-09-08 12:50:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:00,667 INFO L475 AbstractCegarLoop]: Abstraction has 1133 states and 1440 transitions. [2019-09-08 12:50:00,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:50:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1440 transitions. [2019-09-08 12:50:00,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:00,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:00,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, 1, 1, 1, 1, 1] [2019-09-08 12:50:00,669 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:00,670 INFO L82 PathProgramCache]: Analyzing trace with hash 484088792, now seen corresponding path program 1 times [2019-09-08 12:50:00,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:00,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:00,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:00,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:00,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:01,529 INFO L134 CoverageAnalysis]: 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:01,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:01,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:50:01,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:50:01,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:50:01,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:50:01,530 INFO L87 Difference]: Start difference. First operand 1133 states and 1440 transitions. Second operand 17 states. [2019-09-08 12:50:02,227 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:50:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:08,192 INFO L93 Difference]: Finished difference Result 2135 states and 2759 transitions. [2019-09-08 12:50:08,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:50:08,193 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:50:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:08,196 INFO L225 Difference]: With dead ends: 2135 [2019-09-08 12:50:08,196 INFO L226 Difference]: Without dead ends: 2034 [2019-09-08 12:50:08,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:50:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2019-09-08 12:50:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1127. [2019-09-08 12:50:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127 states. [2019-09-08 12:50:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1429 transitions. [2019-09-08 12:50:08,511 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1429 transitions. Word has length 122 [2019-09-08 12:50:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:08,512 INFO L475 AbstractCegarLoop]: Abstraction has 1127 states and 1429 transitions. [2019-09-08 12:50:08,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:50:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1429 transitions. [2019-09-08 12:50:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:08,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:08,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:08,513 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:08,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:08,513 INFO L82 PathProgramCache]: Analyzing trace with hash -982869291, now seen corresponding path program 1 times [2019-09-08 12:50:08,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:08,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:08,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:08,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:08,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:09,884 INFO L134 CoverageAnalysis]: 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:09,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:09,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:50:09,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:50:09,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:50:09,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:50:09,885 INFO L87 Difference]: Start difference. First operand 1127 states and 1429 transitions. Second operand 22 states. [2019-09-08 12:50:11,006 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-08 12:50:11,305 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-08 12:50:11,665 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-09-08 12:50:11,851 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:50:12,299 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-08 12:50:12,759 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-08 12:50:13,075 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-08 12:50:21,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:21,205 INFO L93 Difference]: Finished difference Result 2166 states and 2787 transitions. [2019-09-08 12:50:21,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:50:21,205 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-09-08 12:50:21,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:21,207 INFO L225 Difference]: With dead ends: 2166 [2019-09-08 12:50:21,207 INFO L226 Difference]: Without dead ends: 2060 [2019-09-08 12:50:21,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:50:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2019-09-08 12:50:21,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1133. [2019-09-08 12:50:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2019-09-08 12:50:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1435 transitions. [2019-09-08 12:50:21,571 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1435 transitions. Word has length 122 [2019-09-08 12:50:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:21,571 INFO L475 AbstractCegarLoop]: Abstraction has 1133 states and 1435 transitions. [2019-09-08 12:50:21,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:50:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1435 transitions. [2019-09-08 12:50:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:21,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:21,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,573 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:21,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:21,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1606641247, now seen corresponding path program 1 times [2019-09-08 12:50:21,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:21,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:21,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:21,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:21,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:22,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:22,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:50:22,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:50:22,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:50:22,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:50:22,378 INFO L87 Difference]: Start difference. First operand 1133 states and 1435 transitions. Second operand 17 states. [2019-09-08 12:50:22,972 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:50:23,111 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:50:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:26,825 INFO L93 Difference]: Finished difference Result 2172 states and 2805 transitions. [2019-09-08 12:50:26,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:50:26,826 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:50:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:26,827 INFO L225 Difference]: With dead ends: 2172 [2019-09-08 12:50:26,828 INFO L226 Difference]: Without dead ends: 2027 [2019-09-08 12:50:26,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:50:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-09-08 12:50:27,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1109. [2019-09-08 12:50:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2019-09-08 12:50:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1403 transitions. [2019-09-08 12:50:27,160 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1403 transitions. Word has length 122 [2019-09-08 12:50:27,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:27,160 INFO L475 AbstractCegarLoop]: Abstraction has 1109 states and 1403 transitions. [2019-09-08 12:50:27,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:50:27,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1403 transitions. [2019-09-08 12:50:27,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:27,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:27,161 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,161 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:27,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:27,162 INFO L82 PathProgramCache]: Analyzing trace with hash -185074006, now seen corresponding path program 1 times [2019-09-08 12:50:27,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:27,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:27,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:27,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:27,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:28,194 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-08 12:50:28,352 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-08 12:50:28,511 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-08 12:50:28,694 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 12:50:28,903 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-08 12:50:29,106 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-08 12:50:29,317 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-09-08 12:50:29,523 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-08 12:50:29,718 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-08 12:50:30,376 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-08 12:50:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:31,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:31,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:50:31,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:50:31,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:50:31,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1186, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:50:31,763 INFO L87 Difference]: Start difference. First operand 1109 states and 1403 transitions. Second operand 36 states. [2019-09-08 12:50:32,068 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 56 [2019-09-08 12:50:33,398 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 32 [2019-09-08 12:50:33,648 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 34 [2019-09-08 12:50:33,919 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 49 [2019-09-08 12:50:34,193 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 48 [2019-09-08 12:50:35,097 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 59 [2019-09-08 12:50:35,554 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 77 [2019-09-08 12:50:36,089 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 97 [2019-09-08 12:50:36,767 WARN L188 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 114 [2019-09-08 12:50:37,586 WARN L188 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 131 [2019-09-08 12:50:38,596 WARN L188 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 151 [2019-09-08 12:50:39,083 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 92 [2019-09-08 12:50:39,524 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 92 [2019-09-08 12:50:39,822 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-08 12:50:40,338 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 12:51:21,475 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 64 [2019-09-08 12:51:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:25,453 INFO L93 Difference]: Finished difference Result 2641 states and 3344 transitions. [2019-09-08 12:51:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 12:51:25,454 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 122 [2019-09-08 12:51:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:25,457 INFO L225 Difference]: With dead ends: 2641 [2019-09-08 12:51:25,457 INFO L226 Difference]: Without dead ends: 2551 [2019-09-08 12:51:25,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=589, Invalid=3317, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 12:51:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2019-09-08 12:51:25,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 1129. [2019-09-08 12:51:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-09-08 12:51:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1430 transitions. [2019-09-08 12:51:25,836 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1430 transitions. Word has length 122 [2019-09-08 12:51:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:25,837 INFO L475 AbstractCegarLoop]: Abstraction has 1129 states and 1430 transitions. [2019-09-08 12:51:25,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:51:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1430 transitions. [2019-09-08 12:51:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:51:25,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:25,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,838 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:25,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:25,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1305180917, now seen corresponding path program 1 times [2019-09-08 12:51:25,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:25,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:25,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:25,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:25,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:26,934 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 12:51:27,080 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:51:27,258 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-09-08 12:51:27,432 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:51:27,604 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:51:28,205 WARN L188 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-08 12:51:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:29,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:29,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-08 12:51:29,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-08 12:51:29,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-08 12:51:29,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:51:29,662 INFO L87 Difference]: Start difference. First operand 1129 states and 1430 transitions. Second operand 36 states. [2019-09-08 12:51:29,904 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-09-08 12:51:31,001 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-08 12:51:31,175 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-08 12:51:31,379 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-08 12:51:31,592 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-08 12:51:32,238 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-08 12:51:32,666 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-09-08 12:51:33,154 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 115 [2019-09-08 12:51:33,808 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2019-09-08 12:51:50,974 WARN L188 SmtUtils]: Spent 17.05 s on a formula simplification. DAG size of input: 180 DAG size of output: 159 [2019-09-08 12:52:31,720 WARN L188 SmtUtils]: Spent 40.64 s on a formula simplification. DAG size of input: 210 DAG size of output: 187 [2019-09-08 12:52:32,096 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-08 12:52:32,431 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2019-09-08 12:52:32,874 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-08 12:53:00,922 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-08 12:53:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:24,569 INFO L93 Difference]: Finished difference Result 4069 states and 5142 transitions. [2019-09-08 12:53:24,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 12:53:24,570 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 122 [2019-09-08 12:53:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:24,574 INFO L225 Difference]: With dead ends: 4069 [2019-09-08 12:53:24,574 INFO L226 Difference]: Without dead ends: 3976 [2019-09-08 12:53:24,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 65.9s TimeCoverageRelationStatistics Valid=773, Invalid=4197, Unknown=0, NotChecked=0, Total=4970 [2019-09-08 12:53:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3976 states. [2019-09-08 12:53:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3976 to 1138. [2019-09-08 12:53:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-09-08 12:53:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1442 transitions. [2019-09-08 12:53:25,023 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1442 transitions. Word has length 122 [2019-09-08 12:53:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:25,023 INFO L475 AbstractCegarLoop]: Abstraction has 1138 states and 1442 transitions. [2019-09-08 12:53:25,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-08 12:53:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1442 transitions. [2019-09-08 12:53:25,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:53:25,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:25,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:25,025 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:25,025 INFO L82 PathProgramCache]: Analyzing trace with hash -261572020, now seen corresponding path program 1 times [2019-09-08 12:53:25,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:25,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:25,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:25,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:25,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:25,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:25,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:53:25,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:53:25,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:53:25,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:53:25,975 INFO L87 Difference]: Start difference. First operand 1138 states and 1442 transitions. Second operand 17 states. [2019-09-08 12:53:26,632 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:53:26,793 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 12:53:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:31,918 INFO L93 Difference]: Finished difference Result 2093 states and 2702 transitions. [2019-09-08 12:53:31,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:53:31,919 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:53:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:31,920 INFO L225 Difference]: With dead ends: 2093 [2019-09-08 12:53:31,920 INFO L226 Difference]: Without dead ends: 1974 [2019-09-08 12:53:31,921 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:53:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-09-08 12:53:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1118. [2019-09-08 12:53:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-09-08 12:53:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1415 transitions. [2019-09-08 12:53:32,362 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1415 transitions. Word has length 122 [2019-09-08 12:53:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:32,362 INFO L475 AbstractCegarLoop]: Abstraction has 1118 states and 1415 transitions. [2019-09-08 12:53:32,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:53:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1415 transitions. [2019-09-08 12:53:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:53:32,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:32,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:32,364 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:32,364 INFO L82 PathProgramCache]: Analyzing trace with hash -364307142, now seen corresponding path program 1 times [2019-09-08 12:53:32,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:32,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:32,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:32,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:32,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:33,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:33,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:53:33,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:53:33,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:53:33,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:53:33,185 INFO L87 Difference]: Start difference. First operand 1118 states and 1415 transitions. Second operand 17 states. [2019-09-08 12:53:33,833 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 12:53:33,992 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-08 12:53:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:37,384 INFO L93 Difference]: Finished difference Result 2199 states and 2838 transitions. [2019-09-08 12:53:37,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:53:37,385 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:53:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:37,387 INFO L225 Difference]: With dead ends: 2199 [2019-09-08 12:53:37,388 INFO L226 Difference]: Without dead ends: 2020 [2019-09-08 12:53:37,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:53:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-09-08 12:53:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1076. [2019-09-08 12:53:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-09-08 12:53:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1356 transitions. [2019-09-08 12:53:37,759 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1356 transitions. Word has length 122 [2019-09-08 12:53:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:37,759 INFO L475 AbstractCegarLoop]: Abstraction has 1076 states and 1356 transitions. [2019-09-08 12:53:37,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:53:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1356 transitions. [2019-09-08 12:53:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:53:37,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:37,760 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:37,761 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:37,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:37,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1209199447, now seen corresponding path program 1 times [2019-09-08 12:53:37,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:37,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:37,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:37,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:37,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:38,724 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2019-09-08 12:53:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:38,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:38,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:53:38,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:53:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:53:38,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:53:38,918 INFO L87 Difference]: Start difference. First operand 1076 states and 1356 transitions. Second operand 17 states. [2019-09-08 12:53:39,568 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:53:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:42,939 INFO L93 Difference]: Finished difference Result 2135 states and 2743 transitions. [2019-09-08 12:53:42,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:53:42,940 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:53:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:42,943 INFO L225 Difference]: With dead ends: 2135 [2019-09-08 12:53:42,943 INFO L226 Difference]: Without dead ends: 1874 [2019-09-08 12:53:42,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:53:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2019-09-08 12:53:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1021. [2019-09-08 12:53:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2019-09-08 12:53:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1286 transitions. [2019-09-08 12:53:43,380 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1286 transitions. Word has length 122 [2019-09-08 12:53:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:43,380 INFO L475 AbstractCegarLoop]: Abstraction has 1021 states and 1286 transitions. [2019-09-08 12:53:43,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:53:43,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1286 transitions. [2019-09-08 12:53:43,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:53:43,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:43,381 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:43,381 INFO L418 AbstractCegarLoop]: === Iteration 127 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:43,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:43,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1521800364, now seen corresponding path program 1 times [2019-09-08 12:53:43,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:43,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:43,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:43,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:43,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:44,257 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-08 12:53:44,422 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 12:53:44,587 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 12:53:44,759 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 12:53:44,947 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-08 12:53:45,129 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-08 12:53:46,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:53:46,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:46,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-09-08 12:53:46,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 12:53:46,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 12:53:46,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1083, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:53:46,550 INFO L87 Difference]: Start difference. First operand 1021 states and 1286 transitions. Second operand 35 states. [2019-09-08 12:53:46,781 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 12:53:47,947 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-08 12:53:48,128 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-08 12:53:48,315 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-08 12:53:48,528 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 12:53:48,891 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 12:53:49,574 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 74 [2019-09-08 12:53:49,981 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2019-09-08 12:53:50,455 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-09-08 12:53:51,004 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 97 [2019-09-08 12:53:51,624 WARN L188 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 110 [2019-09-08 12:53:51,955 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2019-09-08 12:53:52,280 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-09-08 12:53:52,630 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-08 12:53:52,898 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 12:53:53,217 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 12:53:53,720 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-08 12:54:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:19,917 INFO L93 Difference]: Finished difference Result 2098 states and 2687 transitions. [2019-09-08 12:54:19,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 12:54:19,918 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 122 [2019-09-08 12:54:19,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:19,920 INFO L225 Difference]: With dead ends: 2098 [2019-09-08 12:54:19,920 INFO L226 Difference]: Without dead ends: 1983 [2019-09-08 12:54:19,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=707, Invalid=2715, Unknown=0, NotChecked=0, Total=3422 [2019-09-08 12:54:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2019-09-08 12:54:20,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1042. [2019-09-08 12:54:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-09-08 12:54:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1310 transitions. [2019-09-08 12:54:20,338 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1310 transitions. Word has length 122 [2019-09-08 12:54:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:20,339 INFO L475 AbstractCegarLoop]: Abstraction has 1042 states and 1310 transitions. [2019-09-08 12:54:20,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 12:54:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1310 transitions. [2019-09-08 12:54:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:54:20,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:20,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:20,341 INFO L418 AbstractCegarLoop]: === Iteration 128 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:20,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:20,341 INFO L82 PathProgramCache]: Analyzing trace with hash -784730414, now seen corresponding path program 1 times [2019-09-08 12:54:20,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:20,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:20,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:20,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:20,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:21,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:21,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:54:21,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:54:21,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:54:21,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:54:21,124 INFO L87 Difference]: Start difference. First operand 1042 states and 1310 transitions. Second operand 17 states. [2019-09-08 12:54:21,907 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 12:54:22,048 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 12:54:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:29,973 INFO L93 Difference]: Finished difference Result 1870 states and 2399 transitions. [2019-09-08 12:54:29,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:54:29,973 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2019-09-08 12:54:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:29,977 INFO L225 Difference]: With dead ends: 1870 [2019-09-08 12:54:29,977 INFO L226 Difference]: Without dead ends: 1781 [2019-09-08 12:54:29,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:54:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2019-09-08 12:54:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1042. [2019-09-08 12:54:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-09-08 12:54:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1308 transitions. [2019-09-08 12:54:30,436 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1308 transitions. Word has length 122 [2019-09-08 12:54:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:30,437 INFO L475 AbstractCegarLoop]: Abstraction has 1042 states and 1308 transitions. [2019-09-08 12:54:30,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:54:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1308 transitions. [2019-09-08 12:54:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:54:30,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:30,439 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:30,439 INFO L418 AbstractCegarLoop]: === Iteration 129 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:30,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:30,439 INFO L82 PathProgramCache]: Analyzing trace with hash -442149559, now seen corresponding path program 1 times [2019-09-08 12:54:30,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:30,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:30,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:30,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:30,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:31,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:31,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:54:31,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:54:31,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:54:31,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:54:31,978 INFO L87 Difference]: Start difference. First operand 1042 states and 1308 transitions. Second operand 22 states. [2019-09-08 12:54:33,130 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-08 12:54:33,391 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-08 12:54:33,718 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-09-08 12:54:33,905 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-08 12:54:35,094 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-09-08 12:54:36,007 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-09-08 12:54:36,453 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-09-08 12:54:36,951 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41