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-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:58:21,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:58:21,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:58:21,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:58:21,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:58:21,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:58:21,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:58:21,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:58:21,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:58:21,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:58:21,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:58:21,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:58:21,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:58:21,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:58:21,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:58:21,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:58:21,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:58:21,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:58:21,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:58:21,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:58:21,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:58:21,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:58:21,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:58:21,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:58:21,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:58:21,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:58:21,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:58:21,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:58:21,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:58:21,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:58:21,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:58:21,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:58:21,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:58:21,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:58:21,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:58:21,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:58:21,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:58:21,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:58:21,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:58:21,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:58:21,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:58:21,539 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-10-02 14:58:21,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:58:21,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:58:21,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:58:21,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:58:21,556 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:58:21,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:58:21,556 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:58:21,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:58:21,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:58:21,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:58:21,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:58:21,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:58:21,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:58:21,557 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:58:21,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:58:21,558 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:58:21,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:58:21,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:58:21,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:58:21,559 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:58:21,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:58:21,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:58:21,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:58:21,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:58:21,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:58:21,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:58:21,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:58:21,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:58:21,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:58:21,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:58:21,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:58:21,610 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:58:21,612 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:58:21,612 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:58:21,613 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-02 14:58:21,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ab8a182/35898ec133384eb8a411362bc527fa60/FLAG63470216e [2019-10-02 14:58:22,318 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:58:22,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-02 14:58:22,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ab8a182/35898ec133384eb8a411362bc527fa60/FLAG63470216e [2019-10-02 14:58:22,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ab8a182/35898ec133384eb8a411362bc527fa60 [2019-10-02 14:58:22,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:58:22,525 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:58:22,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:58:22,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:58:22,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:58:22,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:58:22" (1/1) ... [2019-10-02 14:58:22,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de48500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:58:22, skipping insertion in model container [2019-10-02 14:58:22,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:58:22" (1/1) ... [2019-10-02 14:58:22,547 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:58:22,708 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:58:23,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:58:23,745 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:58:24,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:58:24,066 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:58:24,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:58:24 WrapperNode [2019-10-02 14:58:24,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:58:24,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:58:24,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:58:24,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:58:24,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:58:24" (1/1) ... [2019-10-02 14:58:24,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:58:24" (1/1) ... [2019-10-02 14:58:24,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:58:24" (1/1) ... [2019-10-02 14:58:24,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:58:24" (1/1) ... [2019-10-02 14:58:24,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:58:24" (1/1) ... [2019-10-02 14:58:24,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:58:24" (1/1) ... [2019-10-02 14:58:24,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:58:24" (1/1) ... [2019-10-02 14:58:24,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:58:24,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:58:24,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:58:24,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:58:24,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:58:24" (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-10-02 14:58:24,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:58:24,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:58:24,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:58:24,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:58:24,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 14:58:24,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 14:58:24,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-02 14:58:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 14:58:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 14:58:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 14:58:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 14:58:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 14:58:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 14:58:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 14:58:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 14:58:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 14:58:24,439 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:58:24,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:58:24,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:58:27,942 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:58:27,943 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 14:58:27,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:58:27 BoogieIcfgContainer [2019-10-02 14:58:27,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:58:27,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:58:27,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:58:27,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:58:27,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:58:22" (1/3) ... [2019-10-02 14:58:27,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c88aec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:58:27, skipping insertion in model container [2019-10-02 14:58:27,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:58:24" (2/3) ... [2019-10-02 14:58:27,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c88aec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:58:27, skipping insertion in model container [2019-10-02 14:58:27,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:58:27" (3/3) ... [2019-10-02 14:58:27,955 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-02 14:58:27,967 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:58:27,977 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-02 14:58:27,996 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-02 14:58:28,042 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:58:28,043 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:58:28,043 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:58:28,043 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:58:28,043 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:58:28,043 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:58:28,043 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:58:28,044 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:58:28,044 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:58:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states. [2019-10-02 14:58:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:58:28,116 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:28,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:28,119 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:28,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:28,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2082146872, now seen corresponding path program 1 times [2019-10-02 14:58:28,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:28,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:28,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:28,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:28,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:28,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:28,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:58:28,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:58:28,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:58:28,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:58:28,798 INFO L87 Difference]: Start difference. First operand 1126 states. Second operand 6 states. [2019-10-02 14:58:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:30,727 INFO L93 Difference]: Finished difference Result 2122 states and 3724 transitions. [2019-10-02 14:58:30,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:58:30,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-02 14:58:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:30,755 INFO L225 Difference]: With dead ends: 2122 [2019-10-02 14:58:30,756 INFO L226 Difference]: Without dead ends: 1429 [2019-10-02 14:58:30,764 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:58:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2019-10-02 14:58:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1413. [2019-10-02 14:58:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-10-02 14:58:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1913 transitions. [2019-10-02 14:58:30,890 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1913 transitions. Word has length 55 [2019-10-02 14:58:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:30,890 INFO L475 AbstractCegarLoop]: Abstraction has 1413 states and 1913 transitions. [2019-10-02 14:58:30,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:58:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1913 transitions. [2019-10-02 14:58:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:58:30,895 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:30,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:30,895 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:30,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:30,896 INFO L82 PathProgramCache]: Analyzing trace with hash 995005511, now seen corresponding path program 1 times [2019-10-02 14:58:30,896 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:30,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:30,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:31,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:31,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:58:31,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:58:31,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:58:31,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:58:31,076 INFO L87 Difference]: Start difference. First operand 1413 states and 1913 transitions. Second operand 6 states. [2019-10-02 14:58:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:32,240 INFO L93 Difference]: Finished difference Result 3350 states and 4627 transitions. [2019-10-02 14:58:32,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:58:32,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-02 14:58:32,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:32,257 INFO L225 Difference]: With dead ends: 3350 [2019-10-02 14:58:32,257 INFO L226 Difference]: Without dead ends: 2341 [2019-10-02 14:58:32,261 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:58:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2019-10-02 14:58:32,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2321. [2019-10-02 14:58:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-10-02 14:58:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3206 transitions. [2019-10-02 14:58:32,385 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3206 transitions. Word has length 55 [2019-10-02 14:58:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:32,385 INFO L475 AbstractCegarLoop]: Abstraction has 2321 states and 3206 transitions. [2019-10-02 14:58:32,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:58:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3206 transitions. [2019-10-02 14:58:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:58:32,391 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:32,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:32,392 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:32,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:32,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1195094756, now seen corresponding path program 1 times [2019-10-02 14:58:32,392 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:32,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:32,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:32,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:32,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:32,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:32,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:58:32,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:58:32,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:58:32,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:58:32,514 INFO L87 Difference]: Start difference. First operand 2321 states and 3206 transitions. Second operand 5 states. [2019-10-02 14:58:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:33,761 INFO L93 Difference]: Finished difference Result 4811 states and 6730 transitions. [2019-10-02 14:58:33,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:58:33,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-02 14:58:33,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:33,781 INFO L225 Difference]: With dead ends: 4811 [2019-10-02 14:58:33,782 INFO L226 Difference]: Without dead ends: 3583 [2019-10-02 14:58:33,787 INFO L640 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-10-02 14:58:33,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3583 states. [2019-10-02 14:58:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3583 to 3577. [2019-10-02 14:58:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-02 14:58:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4928 transitions. [2019-10-02 14:58:33,970 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4928 transitions. Word has length 55 [2019-10-02 14:58:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:33,973 INFO L475 AbstractCegarLoop]: Abstraction has 3577 states and 4928 transitions. [2019-10-02 14:58:33,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:58:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4928 transitions. [2019-10-02 14:58:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:58:33,977 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:33,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:33,978 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:33,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:33,978 INFO L82 PathProgramCache]: Analyzing trace with hash 103967417, now seen corresponding path program 1 times [2019-10-02 14:58:33,978 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:33,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:33,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:33,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:33,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:34,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-10-02 14:58:34,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:34,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:58:34,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:58:34,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:58:34,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:58:34,223 INFO L87 Difference]: Start difference. First operand 3577 states and 4928 transitions. Second operand 9 states. [2019-10-02 14:58:37,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:37,558 INFO L93 Difference]: Finished difference Result 7800 states and 11355 transitions. [2019-10-02 14:58:37,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 14:58:37,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-02 14:58:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:37,603 INFO L225 Difference]: With dead ends: 7800 [2019-10-02 14:58:37,604 INFO L226 Difference]: Without dead ends: 7795 [2019-10-02 14:58:37,608 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:58:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7795 states. [2019-10-02 14:58:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7795 to 3577. [2019-10-02 14:58:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-02 14:58:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4927 transitions. [2019-10-02 14:58:37,929 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4927 transitions. Word has length 56 [2019-10-02 14:58:37,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:37,931 INFO L475 AbstractCegarLoop]: Abstraction has 3577 states and 4927 transitions. [2019-10-02 14:58:37,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:58:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4927 transitions. [2019-10-02 14:58:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:58:37,936 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:37,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:37,937 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:37,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1702566800, now seen corresponding path program 1 times [2019-10-02 14:58:37,938 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:37,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:37,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:37,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:38,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:38,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:58:38,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:58:38,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:58:38,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:58:38,164 INFO L87 Difference]: Start difference. First operand 3577 states and 4927 transitions. Second operand 9 states. [2019-10-02 14:58:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:41,085 INFO L93 Difference]: Finished difference Result 9669 states and 14060 transitions. [2019-10-02 14:58:41,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:58:41,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-02 14:58:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:41,127 INFO L225 Difference]: With dead ends: 9669 [2019-10-02 14:58:41,127 INFO L226 Difference]: Without dead ends: 8656 [2019-10-02 14:58:41,132 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:58:41,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2019-10-02 14:58:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 3577. [2019-10-02 14:58:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-02 14:58:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4926 transitions. [2019-10-02 14:58:41,416 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4926 transitions. Word has length 56 [2019-10-02 14:58:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:41,416 INFO L475 AbstractCegarLoop]: Abstraction has 3577 states and 4926 transitions. [2019-10-02 14:58:41,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:58:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4926 transitions. [2019-10-02 14:58:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:58:41,421 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:41,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:41,421 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:41,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:41,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1133124815, now seen corresponding path program 1 times [2019-10-02 14:58:41,422 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:41,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:41,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:41,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:41,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:41,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:41,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:58:41,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:58:41,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:58:41,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:58:41,657 INFO L87 Difference]: Start difference. First operand 3577 states and 4926 transitions. Second operand 8 states. [2019-10-02 14:58:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:44,012 INFO L93 Difference]: Finished difference Result 8367 states and 12323 transitions. [2019-10-02 14:58:44,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:58:44,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-02 14:58:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:44,038 INFO L225 Difference]: With dead ends: 8367 [2019-10-02 14:58:44,038 INFO L226 Difference]: Without dead ends: 7101 [2019-10-02 14:58:44,044 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:58:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7101 states. [2019-10-02 14:58:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7101 to 3577. [2019-10-02 14:58:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-02 14:58:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4925 transitions. [2019-10-02 14:58:44,269 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4925 transitions. Word has length 56 [2019-10-02 14:58:44,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:44,301 INFO L475 AbstractCegarLoop]: Abstraction has 3577 states and 4925 transitions. [2019-10-02 14:58:44,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:58:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4925 transitions. [2019-10-02 14:58:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:58:44,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:44,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:44,309 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:44,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:44,309 INFO L82 PathProgramCache]: Analyzing trace with hash 609358766, now seen corresponding path program 1 times [2019-10-02 14:58:44,309 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:44,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:44,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:44,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:44,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:44,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:44,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:44,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:44,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:44,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:44,398 INFO L87 Difference]: Start difference. First operand 3577 states and 4925 transitions. Second operand 3 states. [2019-10-02 14:58:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:44,769 INFO L93 Difference]: Finished difference Result 5469 states and 7836 transitions. [2019-10-02 14:58:44,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:44,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-02 14:58:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:44,781 INFO L225 Difference]: With dead ends: 5469 [2019-10-02 14:58:44,782 INFO L226 Difference]: Without dead ends: 3990 [2019-10-02 14:58:44,787 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2019-10-02 14:58:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3684. [2019-10-02 14:58:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3684 states. [2019-10-02 14:58:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 5107 transitions. [2019-10-02 14:58:45,089 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 5107 transitions. Word has length 57 [2019-10-02 14:58:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:45,089 INFO L475 AbstractCegarLoop]: Abstraction has 3684 states and 5107 transitions. [2019-10-02 14:58:45,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 5107 transitions. [2019-10-02 14:58:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:58:45,094 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:45,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:45,094 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:45,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:45,095 INFO L82 PathProgramCache]: Analyzing trace with hash 371035602, now seen corresponding path program 1 times [2019-10-02 14:58:45,095 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:45,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:45,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:45,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:45,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:45,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:45,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:45,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:45,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:45,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:45,183 INFO L87 Difference]: Start difference. First operand 3684 states and 5107 transitions. Second operand 3 states. [2019-10-02 14:58:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:45,598 INFO L93 Difference]: Finished difference Result 6301 states and 9163 transitions. [2019-10-02 14:58:45,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:45,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-02 14:58:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:45,612 INFO L225 Difference]: With dead ends: 6301 [2019-10-02 14:58:45,612 INFO L226 Difference]: Without dead ends: 4626 [2019-10-02 14:58:45,617 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2019-10-02 14:58:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4174. [2019-10-02 14:58:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-10-02 14:58:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 5875 transitions. [2019-10-02 14:58:46,099 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 5875 transitions. Word has length 57 [2019-10-02 14:58:46,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:46,099 INFO L475 AbstractCegarLoop]: Abstraction has 4174 states and 5875 transitions. [2019-10-02 14:58:46,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 5875 transitions. [2019-10-02 14:58:46,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:58:46,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:46,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:46,103 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:46,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:46,104 INFO L82 PathProgramCache]: Analyzing trace with hash -369094904, now seen corresponding path program 1 times [2019-10-02 14:58:46,104 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:46,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:46,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:46,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:46,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:46,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:46,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:46,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:46,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:46,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:46,174 INFO L87 Difference]: Start difference. First operand 4174 states and 5875 transitions. Second operand 3 states. [2019-10-02 14:58:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:46,610 INFO L93 Difference]: Finished difference Result 8364 states and 12201 transitions. [2019-10-02 14:58:46,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:46,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-02 14:58:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:46,625 INFO L225 Difference]: With dead ends: 8364 [2019-10-02 14:58:46,625 INFO L226 Difference]: Without dead ends: 5370 [2019-10-02 14:58:46,634 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5370 states. [2019-10-02 14:58:47,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5370 to 5368. [2019-10-02 14:58:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5368 states. [2019-10-02 14:58:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7645 transitions. [2019-10-02 14:58:47,163 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7645 transitions. Word has length 57 [2019-10-02 14:58:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:47,164 INFO L475 AbstractCegarLoop]: Abstraction has 5368 states and 7645 transitions. [2019-10-02 14:58:47,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7645 transitions. [2019-10-02 14:58:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:58:47,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:47,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:47,167 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:47,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:47,167 INFO L82 PathProgramCache]: Analyzing trace with hash 2011629158, now seen corresponding path program 1 times [2019-10-02 14:58:47,167 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:47,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:47,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:47,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:47,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:47,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:47,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:47,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:47,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:47,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:47,224 INFO L87 Difference]: Start difference. First operand 5368 states and 7645 transitions. Second operand 3 states. [2019-10-02 14:58:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:47,847 INFO L93 Difference]: Finished difference Result 12677 states and 18597 transitions. [2019-10-02 14:58:47,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:47,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 14:58:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:47,869 INFO L225 Difference]: With dead ends: 12677 [2019-10-02 14:58:47,870 INFO L226 Difference]: Without dead ends: 8089 [2019-10-02 14:58:47,883 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8089 states. [2019-10-02 14:58:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 6379. [2019-10-02 14:58:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6379 states. [2019-10-02 14:58:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6379 states to 6379 states and 9282 transitions. [2019-10-02 14:58:48,637 INFO L78 Accepts]: Start accepts. Automaton has 6379 states and 9282 transitions. Word has length 58 [2019-10-02 14:58:48,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:48,637 INFO L475 AbstractCegarLoop]: Abstraction has 6379 states and 9282 transitions. [2019-10-02 14:58:48,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 9282 transitions. [2019-10-02 14:58:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:58:48,640 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:48,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:48,640 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:48,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:48,641 INFO L82 PathProgramCache]: Analyzing trace with hash 883688950, now seen corresponding path program 1 times [2019-10-02 14:58:48,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:48,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:48,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:48,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:48,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:48,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-10-02 14:58:48,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:48,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:48,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:48,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:48,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:48,696 INFO L87 Difference]: Start difference. First operand 6379 states and 9282 transitions. Second operand 3 states. [2019-10-02 14:58:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:49,516 INFO L93 Difference]: Finished difference Result 16222 states and 24049 transitions. [2019-10-02 14:58:49,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:49,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 14:58:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:49,530 INFO L225 Difference]: With dead ends: 16222 [2019-10-02 14:58:49,530 INFO L226 Difference]: Without dead ends: 10378 [2019-10-02 14:58:49,541 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:49,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-10-02 14:58:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 8062. [2019-10-02 14:58:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8062 states. [2019-10-02 14:58:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8062 states to 8062 states and 11884 transitions. [2019-10-02 14:58:50,225 INFO L78 Accepts]: Start accepts. Automaton has 8062 states and 11884 transitions. Word has length 58 [2019-10-02 14:58:50,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:50,225 INFO L475 AbstractCegarLoop]: Abstraction has 8062 states and 11884 transitions. [2019-10-02 14:58:50,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 8062 states and 11884 transitions. [2019-10-02 14:58:50,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:58:50,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:50,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:50,230 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:50,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:50,231 INFO L82 PathProgramCache]: Analyzing trace with hash -550232989, now seen corresponding path program 1 times [2019-10-02 14:58:50,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:50,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:50,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:50,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:50,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:50,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:50,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 14:58:50,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:58:50,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:58:50,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:58:50,904 INFO L87 Difference]: Start difference. First operand 8062 states and 11884 transitions. Second operand 19 states. [2019-10-02 14:58:51,100 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-10-02 14:58:51,860 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-10-02 14:58:52,151 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-02 14:58:52,390 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-02 14:58:52,552 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-02 14:58:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:59,366 INFO L93 Difference]: Finished difference Result 25633 states and 38263 transitions. [2019-10-02 14:58:59,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:58:59,367 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2019-10-02 14:58:59,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:59,392 INFO L225 Difference]: With dead ends: 25633 [2019-10-02 14:58:59,392 INFO L226 Difference]: Without dead ends: 25629 [2019-10-02 14:58:59,398 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:58:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25629 states. [2019-10-02 14:59:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25629 to 8074. [2019-10-02 14:59:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8074 states. [2019-10-02 14:59:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8074 states to 8074 states and 11901 transitions. [2019-10-02 14:59:00,360 INFO L78 Accepts]: Start accepts. Automaton has 8074 states and 11901 transitions. Word has length 59 [2019-10-02 14:59:00,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:00,361 INFO L475 AbstractCegarLoop]: Abstraction has 8074 states and 11901 transitions. [2019-10-02 14:59:00,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:59:00,361 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 11901 transitions. [2019-10-02 14:59:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:59:00,363 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:00,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:59:00,364 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:00,364 INFO L82 PathProgramCache]: Analyzing trace with hash 74715795, now seen corresponding path program 1 times [2019-10-02 14:59:00,364 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:00,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:00,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:00,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:00,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:00,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:00,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 14:59:00,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:59:00,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:59:00,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:59:00,934 INFO L87 Difference]: Start difference. First operand 8074 states and 11901 transitions. Second operand 19 states. [2019-10-02 14:59:01,111 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-10-02 14:59:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:09,307 INFO L93 Difference]: Finished difference Result 21588 states and 32173 transitions. [2019-10-02 14:59:09,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:59:09,308 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2019-10-02 14:59:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:09,332 INFO L225 Difference]: With dead ends: 21588 [2019-10-02 14:59:09,332 INFO L226 Difference]: Without dead ends: 21584 [2019-10-02 14:59:09,338 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=273, Invalid=987, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:59:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21584 states. [2019-10-02 14:59:10,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21584 to 8074. [2019-10-02 14:59:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8074 states. [2019-10-02 14:59:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8074 states to 8074 states and 11900 transitions. [2019-10-02 14:59:10,254 INFO L78 Accepts]: Start accepts. Automaton has 8074 states and 11900 transitions. Word has length 59 [2019-10-02 14:59:10,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:10,255 INFO L475 AbstractCegarLoop]: Abstraction has 8074 states and 11900 transitions. [2019-10-02 14:59:10,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:59:10,255 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 11900 transitions. [2019-10-02 14:59:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:59:10,257 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:10,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:59:10,257 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:10,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:10,258 INFO L82 PathProgramCache]: Analyzing trace with hash -615559955, now seen corresponding path program 1 times [2019-10-02 14:59:10,258 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:10,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:10,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:10,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:10,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:10,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:10,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 14:59:10,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:59:10,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:59:10,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:59:10,851 INFO L87 Difference]: Start difference. First operand 8074 states and 11900 transitions. Second operand 19 states. [2019-10-02 14:59:11,086 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-10-02 14:59:12,045 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-10-02 14:59:12,350 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-02 14:59:13,033 WARN L191 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-02 14:59:13,460 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-02 14:59:13,657 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-02 14:59:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:19,285 INFO L93 Difference]: Finished difference Result 21056 states and 31417 transitions. [2019-10-02 14:59:19,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:59:19,286 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2019-10-02 14:59:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:19,309 INFO L225 Difference]: With dead ends: 21056 [2019-10-02 14:59:19,309 INFO L226 Difference]: Without dead ends: 21050 [2019-10-02 14:59:19,315 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=335, Invalid=1147, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:59:19,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21050 states. [2019-10-02 14:59:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21050 to 8074. [2019-10-02 14:59:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8074 states. [2019-10-02 14:59:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8074 states to 8074 states and 11899 transitions. [2019-10-02 14:59:20,408 INFO L78 Accepts]: Start accepts. Automaton has 8074 states and 11899 transitions. Word has length 59 [2019-10-02 14:59:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:20,408 INFO L475 AbstractCegarLoop]: Abstraction has 8074 states and 11899 transitions. [2019-10-02 14:59:20,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:59:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 11899 transitions. [2019-10-02 14:59:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:59:20,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:20,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:59:20,410 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:20,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:20,410 INFO L82 PathProgramCache]: Analyzing trace with hash -638988576, now seen corresponding path program 1 times [2019-10-02 14:59:20,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:20,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:20,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:20,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:20,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:20,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:20,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:59:20,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:59:20,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:59:20,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:59:20,843 INFO L87 Difference]: Start difference. First operand 8074 states and 11899 transitions. Second operand 11 states. [2019-10-02 14:59:21,306 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-10-02 14:59:21,478 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-02 14:59:21,747 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-02 14:59:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:27,023 INFO L93 Difference]: Finished difference Result 26982 states and 40005 transitions. [2019-10-02 14:59:27,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:59:27,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-10-02 14:59:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:27,048 INFO L225 Difference]: With dead ends: 26982 [2019-10-02 14:59:27,049 INFO L226 Difference]: Without dead ends: 26685 [2019-10-02 14:59:27,054 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:59:27,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26685 states. [2019-10-02 14:59:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26685 to 7963. [2019-10-02 14:59:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7963 states. [2019-10-02 14:59:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 11757 transitions. [2019-10-02 14:59:28,174 INFO L78 Accepts]: Start accepts. Automaton has 7963 states and 11757 transitions. Word has length 59 [2019-10-02 14:59:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:28,174 INFO L475 AbstractCegarLoop]: Abstraction has 7963 states and 11757 transitions. [2019-10-02 14:59:28,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:59:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 7963 states and 11757 transitions. [2019-10-02 14:59:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:59:28,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:28,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:59:28,176 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:28,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:28,176 INFO L82 PathProgramCache]: Analyzing trace with hash 217595752, now seen corresponding path program 1 times [2019-10-02 14:59:28,176 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:28,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:28,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:28,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:28,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:28,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:28,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 14:59:28,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:59:28,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:59:28,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:59:28,928 INFO L87 Difference]: Start difference. First operand 7963 states and 11757 transitions. Second operand 15 states. [2019-10-02 14:59:29,501 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-10-02 14:59:29,761 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-02 14:59:29,998 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-02 14:59:30,338 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-02 14:59:31,566 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-10-02 14:59:32,152 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-10-02 14:59:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:35,307 INFO L93 Difference]: Finished difference Result 16377 states and 24184 transitions. [2019-10-02 14:59:35,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 14:59:35,307 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-10-02 14:59:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:35,326 INFO L225 Difference]: With dead ends: 16377 [2019-10-02 14:59:35,326 INFO L226 Difference]: Without dead ends: 16144 [2019-10-02 14:59:35,331 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:59:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16144 states. [2019-10-02 14:59:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16144 to 7954. [2019-10-02 14:59:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7954 states. [2019-10-02 14:59:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7954 states to 7954 states and 11745 transitions. [2019-10-02 14:59:36,732 INFO L78 Accepts]: Start accepts. Automaton has 7954 states and 11745 transitions. Word has length 60 [2019-10-02 14:59:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:36,733 INFO L475 AbstractCegarLoop]: Abstraction has 7954 states and 11745 transitions. [2019-10-02 14:59:36,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:59:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 7954 states and 11745 transitions. [2019-10-02 14:59:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 14:59:36,735 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:36,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:59:36,736 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:36,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:36,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1596599088, now seen corresponding path program 1 times [2019-10-02 14:59:36,736 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:36,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:36,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:36,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:36,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:36,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:36,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:59:36,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:59:36,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:59:36,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:59:36,821 INFO L87 Difference]: Start difference. First operand 7954 states and 11745 transitions. Second operand 6 states. [2019-10-02 14:59:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:42,328 INFO L93 Difference]: Finished difference Result 35898 states and 53179 transitions. [2019-10-02 14:59:42,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:59:42,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-10-02 14:59:42,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:42,355 INFO L225 Difference]: With dead ends: 35898 [2019-10-02 14:59:42,356 INFO L226 Difference]: Without dead ends: 28560 [2019-10-02 14:59:42,367 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:59:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28560 states. [2019-10-02 14:59:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28560 to 24972. [2019-10-02 14:59:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24972 states. [2019-10-02 14:59:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24972 states to 24972 states and 36102 transitions. [2019-10-02 14:59:46,487 INFO L78 Accepts]: Start accepts. Automaton has 24972 states and 36102 transitions. Word has length 64 [2019-10-02 14:59:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:46,488 INFO L475 AbstractCegarLoop]: Abstraction has 24972 states and 36102 transitions. [2019-10-02 14:59:46,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:59:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 24972 states and 36102 transitions. [2019-10-02 14:59:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 14:59:46,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:46,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:59:46,491 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:46,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:46,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1766576601, now seen corresponding path program 1 times [2019-10-02 14:59:46,492 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:46,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:46,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:46,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:46,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:46,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-10-02 14:59:46,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:46,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:59:46,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:59:46,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:59:46,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:59:46,608 INFO L87 Difference]: Start difference. First operand 24972 states and 36102 transitions. Second operand 6 states. [2019-10-02 14:59:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:54,358 INFO L93 Difference]: Finished difference Result 43933 states and 62642 transitions. [2019-10-02 14:59:54,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:59:54,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-02 14:59:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:54,406 INFO L225 Difference]: With dead ends: 43933 [2019-10-02 14:59:54,406 INFO L226 Difference]: Without dead ends: 43931 [2019-10-02 14:59:54,415 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:59:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43931 states. [2019-10-02 14:59:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43931 to 25938. [2019-10-02 14:59:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25938 states. [2019-10-02 14:59:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25938 states to 25938 states and 36886 transitions. [2019-10-02 14:59:59,830 INFO L78 Accepts]: Start accepts. Automaton has 25938 states and 36886 transitions. Word has length 65 [2019-10-02 14:59:59,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:59,830 INFO L475 AbstractCegarLoop]: Abstraction has 25938 states and 36886 transitions. [2019-10-02 14:59:59,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:59:59,831 INFO L276 IsEmpty]: Start isEmpty. Operand 25938 states and 36886 transitions. [2019-10-02 14:59:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 14:59:59,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:59,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:59:59,834 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:59,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:59,835 INFO L82 PathProgramCache]: Analyzing trace with hash -913257528, now seen corresponding path program 1 times [2019-10-02 14:59:59,835 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:59,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:59,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:59,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:59,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:59,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:59,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:59:59,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:59:59,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:59:59,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:59:59,895 INFO L87 Difference]: Start difference. First operand 25938 states and 36886 transitions. Second operand 3 states. [2019-10-02 15:00:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:08,126 INFO L93 Difference]: Finished difference Result 69922 states and 99701 transitions. [2019-10-02 15:00:08,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:08,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-02 15:00:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:08,179 INFO L225 Difference]: With dead ends: 69922 [2019-10-02 15:00:08,179 INFO L226 Difference]: Without dead ends: 44578 [2019-10-02 15:00:08,210 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:08,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44578 states. [2019-10-02 15:00:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44578 to 43946. [2019-10-02 15:00:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43946 states. [2019-10-02 15:00:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43946 states to 43946 states and 61767 transitions. [2019-10-02 15:00:17,185 INFO L78 Accepts]: Start accepts. Automaton has 43946 states and 61767 transitions. Word has length 66 [2019-10-02 15:00:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:17,186 INFO L475 AbstractCegarLoop]: Abstraction has 43946 states and 61767 transitions. [2019-10-02 15:00:17,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 43946 states and 61767 transitions. [2019-10-02 15:00:17,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 15:00:17,190 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:17,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:17,191 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:17,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:17,191 INFO L82 PathProgramCache]: Analyzing trace with hash 476487767, now seen corresponding path program 1 times [2019-10-02 15:00:17,192 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:17,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:17,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:17,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:17,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:17,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:17,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:17,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:17,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:17,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:17,253 INFO L87 Difference]: Start difference. First operand 43946 states and 61767 transitions. Second operand 3 states. [2019-10-02 15:00:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:25,154 INFO L93 Difference]: Finished difference Result 61734 states and 86673 transitions. [2019-10-02 15:00:25,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:25,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-02 15:00:25,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:25,205 INFO L225 Difference]: With dead ends: 61734 [2019-10-02 15:00:25,205 INFO L226 Difference]: Without dead ends: 43931 [2019-10-02 15:00:25,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43931 states. [2019-10-02 15:00:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43931 to 34179. [2019-10-02 15:00:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34179 states. [2019-10-02 15:00:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34179 states to 34179 states and 47276 transitions. [2019-10-02 15:00:32,496 INFO L78 Accepts]: Start accepts. Automaton has 34179 states and 47276 transitions. Word has length 70 [2019-10-02 15:00:32,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:32,497 INFO L475 AbstractCegarLoop]: Abstraction has 34179 states and 47276 transitions. [2019-10-02 15:00:32,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 34179 states and 47276 transitions. [2019-10-02 15:00:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 15:00:32,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:32,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:32,502 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:32,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:32,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2006601938, now seen corresponding path program 1 times [2019-10-02 15:00:32,502 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:32,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:32,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:32,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:32,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:32,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:32,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:00:32,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:00:32,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:00:32,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:00:32,566 INFO L87 Difference]: Start difference. First operand 34179 states and 47276 transitions. Second operand 5 states. [2019-10-02 15:00:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:49,881 INFO L93 Difference]: Finished difference Result 107594 states and 148672 transitions. [2019-10-02 15:00:49,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:00:49,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-10-02 15:00:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:49,972 INFO L225 Difference]: With dead ends: 107594 [2019-10-02 15:00:49,973 INFO L226 Difference]: Without dead ends: 73998 [2019-10-02 15:00:50,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:00:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73998 states. [2019-10-02 15:00:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73998 to 41465. [2019-10-02 15:00:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41465 states. [2019-10-02 15:00:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41465 states to 41465 states and 55967 transitions. [2019-10-02 15:00:58,922 INFO L78 Accepts]: Start accepts. Automaton has 41465 states and 55967 transitions. Word has length 70 [2019-10-02 15:00:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:58,922 INFO L475 AbstractCegarLoop]: Abstraction has 41465 states and 55967 transitions. [2019-10-02 15:00:58,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:00:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 41465 states and 55967 transitions. [2019-10-02 15:00:58,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 15:00:58,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:58,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:58,926 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:58,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:58,927 INFO L82 PathProgramCache]: Analyzing trace with hash 538296260, now seen corresponding path program 1 times [2019-10-02 15:00:58,927 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:58,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:58,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:58,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:58,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:58,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:58,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:00:58,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:00:58,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:00:58,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:00:58,996 INFO L87 Difference]: Start difference. First operand 41465 states and 55967 transitions. Second operand 5 states. [2019-10-02 15:01:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:26,456 INFO L93 Difference]: Finished difference Result 156759 states and 211790 transitions. [2019-10-02 15:01:26,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 15:01:26,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-02 15:01:26,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:26,597 INFO L225 Difference]: With dead ends: 156759 [2019-10-02 15:01:26,598 INFO L226 Difference]: Without dead ends: 115886 [2019-10-02 15:01:26,638 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:01:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115886 states. [2019-10-02 15:01:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115886 to 77790. [2019-10-02 15:01:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77790 states. [2019-10-02 15:01:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77790 states to 77790 states and 104583 transitions. [2019-10-02 15:01:45,274 INFO L78 Accepts]: Start accepts. Automaton has 77790 states and 104583 transitions. Word has length 75 [2019-10-02 15:01:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:45,275 INFO L475 AbstractCegarLoop]: Abstraction has 77790 states and 104583 transitions. [2019-10-02 15:01:45,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:01:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 77790 states and 104583 transitions. [2019-10-02 15:01:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 15:01:45,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:45,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:45,280 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:45,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:45,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1290568497, now seen corresponding path program 1 times [2019-10-02 15:01:45,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:45,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:45,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:45,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:45,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:45,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:45,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:01:45,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:01:45,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:01:45,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:01:45,358 INFO L87 Difference]: Start difference. First operand 77790 states and 104583 transitions. Second operand 3 states. [2019-10-02 15:02:18,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:18,212 INFO L93 Difference]: Finished difference Result 216090 states and 289757 transitions. [2019-10-02 15:02:18,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:02:18,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-10-02 15:02:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:18,390 INFO L225 Difference]: With dead ends: 216090 [2019-10-02 15:02:18,390 INFO L226 Difference]: Without dead ends: 138894 [2019-10-02 15:02:18,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:02:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138894 states. [2019-10-02 15:02:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138894 to 100076. [2019-10-02 15:02:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100076 states. [2019-10-02 15:02:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100076 states to 100076 states and 132139 transitions. [2019-10-02 15:02:43,559 INFO L78 Accepts]: Start accepts. Automaton has 100076 states and 132139 transitions. Word has length 78 [2019-10-02 15:02:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:43,559 INFO L475 AbstractCegarLoop]: Abstraction has 100076 states and 132139 transitions. [2019-10-02 15:02:43,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:02:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 100076 states and 132139 transitions. [2019-10-02 15:02:43,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-02 15:02:43,565 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:43,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:02:43,565 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:43,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:43,565 INFO L82 PathProgramCache]: Analyzing trace with hash 162122952, now seen corresponding path program 1 times [2019-10-02 15:02:43,565 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:43,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:43,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:43,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:43,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:43,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-10-02 15:02:43,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:43,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:02:43,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:02:43,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:02:43,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:02:43,640 INFO L87 Difference]: Start difference. First operand 100076 states and 132139 transitions. Second operand 3 states. [2019-10-02 15:03:13,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:13,607 INFO L93 Difference]: Finished difference Result 230522 states and 303675 transitions. [2019-10-02 15:03:13,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:03:13,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-10-02 15:03:13,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:13,788 INFO L225 Difference]: With dead ends: 230522 [2019-10-02 15:03:13,789 INFO L226 Difference]: Without dead ends: 131035 [2019-10-02 15:03:13,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:03:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131035 states. [2019-10-02 15:03:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131035 to 101397. [2019-10-02 15:03:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101397 states. [2019-10-02 15:03:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101397 states to 101397 states and 131616 transitions. [2019-10-02 15:03:40,358 INFO L78 Accepts]: Start accepts. Automaton has 101397 states and 131616 transitions. Word has length 81 [2019-10-02 15:03:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:40,359 INFO L475 AbstractCegarLoop]: Abstraction has 101397 states and 131616 transitions. [2019-10-02 15:03:40,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:03:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 101397 states and 131616 transitions. [2019-10-02 15:03:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 15:03:40,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:40,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:03:40,365 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:40,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:40,365 INFO L82 PathProgramCache]: Analyzing trace with hash 328610332, now seen corresponding path program 1 times [2019-10-02 15:03:40,365 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:40,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:40,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:40,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:40,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:03:40,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:40,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 15:03:40,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:03:40,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:03:40,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:03:40,521 INFO L87 Difference]: Start difference. First operand 101397 states and 131616 transitions. Second operand 6 states. [2019-10-02 15:04:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:04:15,285 INFO L93 Difference]: Finished difference Result 168817 states and 219743 transitions. [2019-10-02 15:04:15,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 15:04:15,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-10-02 15:04:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:04:15,459 INFO L225 Difference]: With dead ends: 168817 [2019-10-02 15:04:15,459 INFO L226 Difference]: Without dead ends: 141001 [2019-10-02 15:04:15,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:04:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141001 states. [2019-10-02 15:04:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141001 to 128451. [2019-10-02 15:04:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128451 states. [2019-10-02 15:04:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128451 states to 128451 states and 166896 transitions. [2019-10-02 15:04:50,126 INFO L78 Accepts]: Start accepts. Automaton has 128451 states and 166896 transitions. Word has length 84 [2019-10-02 15:04:50,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:04:50,126 INFO L475 AbstractCegarLoop]: Abstraction has 128451 states and 166896 transitions. [2019-10-02 15:04:50,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:04:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 128451 states and 166896 transitions. [2019-10-02 15:04:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 15:04:50,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:04:50,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:04:50,133 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:04:50,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:04:50,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1028439201, now seen corresponding path program 1 times [2019-10-02 15:04:50,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:04:50,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:04:50,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:50,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:04:50,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:04:50,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-10-02 15:04:50,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:04:50,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:04:50,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:04:50,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:04:50,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:04:50,219 INFO L87 Difference]: Start difference. First operand 128451 states and 166896 transitions. Second operand 3 states. [2019-10-02 15:05:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:27,392 INFO L93 Difference]: Finished difference Result 273801 states and 354250 transitions. [2019-10-02 15:05:27,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:05:27,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-02 15:05:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:27,635 INFO L225 Difference]: With dead ends: 273801 [2019-10-02 15:05:27,636 INFO L226 Difference]: Without dead ends: 145907 [2019-10-02 15:05:27,721 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:27,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145907 states. [2019-10-02 15:06:05,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145907 to 138525. [2019-10-02 15:06:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138525 states. [2019-10-02 15:06:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138525 states to 138525 states and 177154 transitions. [2019-10-02 15:06:05,758 INFO L78 Accepts]: Start accepts. Automaton has 138525 states and 177154 transitions. Word has length 84 [2019-10-02 15:06:05,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:06:05,758 INFO L475 AbstractCegarLoop]: Abstraction has 138525 states and 177154 transitions. [2019-10-02 15:06:05,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:06:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 138525 states and 177154 transitions. [2019-10-02 15:06:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 15:06:05,765 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:06:05,765 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:06:05,765 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:06:05,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:06:05,766 INFO L82 PathProgramCache]: Analyzing trace with hash -217793458, now seen corresponding path program 1 times [2019-10-02 15:06:05,766 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:06:05,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:06:05,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:05,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:06:05,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:06:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 15:06:05,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:06:05,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:06:05,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:06:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:06:05,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:06:05,892 INFO L87 Difference]: Start difference. First operand 138525 states and 177154 transitions. Second operand 5 states. [2019-10-02 15:06:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:26,510 INFO L93 Difference]: Finished difference Result 203691 states and 259852 transitions. [2019-10-02 15:06:26,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:06:26,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-02 15:06:26,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:26,607 INFO L225 Difference]: With dead ends: 203691 [2019-10-02 15:06:26,607 INFO L226 Difference]: Without dead ends: 71009 [2019-10-02 15:06:26,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:06:26,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71009 states. [2019-10-02 15:06:48,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71009 to 68016. [2019-10-02 15:06:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68016 states. [2019-10-02 15:06:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68016 states to 68016 states and 86103 transitions. [2019-10-02 15:06:48,329 INFO L78 Accepts]: Start accepts. Automaton has 68016 states and 86103 transitions. Word has length 85 [2019-10-02 15:06:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:06:48,329 INFO L475 AbstractCegarLoop]: Abstraction has 68016 states and 86103 transitions. [2019-10-02 15:06:48,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:06:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 68016 states and 86103 transitions. [2019-10-02 15:06:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 15:06:48,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:06:48,335 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:06:48,335 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:06:48,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:06:48,335 INFO L82 PathProgramCache]: Analyzing trace with hash 708629354, now seen corresponding path program 1 times [2019-10-02 15:06:48,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:06:48,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:06:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:48,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:06:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:06:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 15:06:48,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:06:48,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:06:48,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:06:48,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:06:48,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:06:48,482 INFO L87 Difference]: Start difference. First operand 68016 states and 86103 transitions. Second operand 9 states. [2019-10-02 15:07:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:07:16,666 INFO L93 Difference]: Finished difference Result 102408 states and 129052 transitions. [2019-10-02 15:07:16,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 15:07:16,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-10-02 15:07:16,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:07:16,780 INFO L225 Difference]: With dead ends: 102408 [2019-10-02 15:07:16,780 INFO L226 Difference]: Without dead ends: 99735 [2019-10-02 15:07:16,801 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-10-02 15:07:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99735 states. [2019-10-02 15:07:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99735 to 68004. [2019-10-02 15:07:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68004 states. [2019-10-02 15:07:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68004 states to 68004 states and 86090 transitions. [2019-10-02 15:07:35,394 INFO L78 Accepts]: Start accepts. Automaton has 68004 states and 86090 transitions. Word has length 88 [2019-10-02 15:07:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:07:35,394 INFO L475 AbstractCegarLoop]: Abstraction has 68004 states and 86090 transitions. [2019-10-02 15:07:35,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:07:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 68004 states and 86090 transitions. [2019-10-02 15:07:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 15:07:35,400 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:07:35,400 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:07:35,400 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:07:35,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:07:35,401 INFO L82 PathProgramCache]: Analyzing trace with hash 48670285, now seen corresponding path program 1 times [2019-10-02 15:07:35,401 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:07:35,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:07:35,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:35,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:07:35,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:07:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 15:07:35,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:07:35,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 15:07:35,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:07:35,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:07:35,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:07:35,724 INFO L87 Difference]: Start difference. First operand 68004 states and 86090 transitions. Second operand 8 states. [2019-10-02 15:08:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:08:17,832 INFO L93 Difference]: Finished difference Result 131486 states and 166444 transitions. [2019-10-02 15:08:17,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 15:08:17,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-10-02 15:08:17,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:08:17,983 INFO L225 Difference]: With dead ends: 131486 [2019-10-02 15:08:17,984 INFO L226 Difference]: Without dead ends: 131195 [2019-10-02 15:08:18,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-10-02 15:08:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131195 states. [2019-10-02 15:08:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131195 to 68004. [2019-10-02 15:08:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68004 states. [2019-10-02 15:08:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68004 states to 68004 states and 86089 transitions. [2019-10-02 15:08:36,900 INFO L78 Accepts]: Start accepts. Automaton has 68004 states and 86089 transitions. Word has length 88 [2019-10-02 15:08:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:08:36,900 INFO L475 AbstractCegarLoop]: Abstraction has 68004 states and 86089 transitions. [2019-10-02 15:08:36,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:08:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 68004 states and 86089 transitions. [2019-10-02 15:08:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 15:08:36,906 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:08:36,906 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:08:36,906 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:08:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:08:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1485835272, now seen corresponding path program 1 times [2019-10-02 15:08:36,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:08:36,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:08:36,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:08:36,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:08:36,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:08:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:08:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:08:37,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:08:37,056 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 15:08:37,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:08:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:08:37,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 15:08:37,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:08:37,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 15:08:37,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 15:08:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:08:38,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 15:08:38,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-10-02 15:08:38,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 15:08:38,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 15:08:38,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-10-02 15:08:38,272 INFO L87 Difference]: Start difference. First operand 68004 states and 86089 transitions. Second operand 16 states. [2019-10-02 15:08:38,542 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-02 15:08:38,802 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-02 15:08:38,986 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-02 15:09:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:16,836 INFO L93 Difference]: Finished difference Result 117679 states and 147676 transitions. [2019-10-02 15:09:16,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 15:09:16,836 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-10-02 15:09:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:17,181 INFO L225 Difference]: With dead ends: 117679 [2019-10-02 15:09:17,181 INFO L226 Difference]: Without dead ends: 115018 [2019-10-02 15:09:17,221 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 15:09:17,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115018 states. [2019-10-02 15:09:37,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115018 to 68241. [2019-10-02 15:09:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68241 states. [2019-10-02 15:09:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68241 states to 68241 states and 86372 transitions. [2019-10-02 15:09:37,543 INFO L78 Accepts]: Start accepts. Automaton has 68241 states and 86372 transitions. Word has length 89 [2019-10-02 15:09:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:37,544 INFO L475 AbstractCegarLoop]: Abstraction has 68241 states and 86372 transitions. [2019-10-02 15:09:37,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 15:09:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 68241 states and 86372 transitions. [2019-10-02 15:09:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 15:09:37,560 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:37,560 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:09:37,560 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:37,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:37,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1635641784, now seen corresponding path program 1 times [2019-10-02 15:09:37,561 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:37,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:37,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:37,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:37,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:37,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:37,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 15:09:37,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 15:09:37,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 15:09:37,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 15:09:37,798 INFO L87 Difference]: Start difference. First operand 68241 states and 86372 transitions. Second operand 10 states. [2019-10-02 15:10:48,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:48,050 INFO L93 Difference]: Finished difference Result 219514 states and 276572 transitions. [2019-10-02 15:10:48,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 15:10:48,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-10-02 15:10:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:48,411 INFO L225 Difference]: With dead ends: 219514 [2019-10-02 15:10:48,411 INFO L226 Difference]: Without dead ends: 190864 [2019-10-02 15:10:48,487 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=383, Invalid=1099, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 15:10:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190864 states. [2019-10-02 15:11:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190864 to 84366. [2019-10-02 15:11:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84366 states. [2019-10-02 15:11:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84366 states to 84366 states and 106772 transitions. [2019-10-02 15:11:15,433 INFO L78 Accepts]: Start accepts. Automaton has 84366 states and 106772 transitions. Word has length 89 [2019-10-02 15:11:15,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:11:15,433 INFO L475 AbstractCegarLoop]: Abstraction has 84366 states and 106772 transitions. [2019-10-02 15:11:15,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 15:11:15,433 INFO L276 IsEmpty]: Start isEmpty. Operand 84366 states and 106772 transitions. [2019-10-02 15:11:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 15:11:15,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:11:15,439 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:11:15,439 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:11:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:11:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash -877671765, now seen corresponding path program 1 times [2019-10-02 15:11:15,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:11:15,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:11:15,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:15,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:11:15,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:11:15,755 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-10-02 15:11:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:11:15,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:11:15,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 15:11:15,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 15:11:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 15:11:15,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-02 15:11:15,841 INFO L87 Difference]: Start difference. First operand 84366 states and 106772 transitions. Second operand 12 states.