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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:41:22,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:41:22,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:41:22,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:41:22,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:41:22,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:41:22,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:41:22,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:41:22,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:41:22,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:41:22,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:41:22,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:41:22,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:41:22,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:41:22,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:41:22,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:41:22,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:41:22,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:41:22,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:41:22,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:41:22,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:41:22,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:41:22,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:41:22,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:41:22,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:41:22,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:41:22,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:41:22,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:41:22,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:41:22,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:41:22,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:41:22,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:41:22,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:41:22,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:41:22,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:41:22,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:41:22,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:41:22,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:41:22,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:41:22,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:41:22,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:41:22,574 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:41:22,589 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:41:22,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:41:22,590 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:41:22,590 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:41:22,591 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:41:22,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:41:22,591 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:41:22,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:41:22,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:41:22,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:41:22,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:41:22,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:41:22,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:41:22,592 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:41:22,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:41:22,593 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:41:22,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:41:22,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:41:22,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:41:22,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:41:22,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:41:22,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:41:22,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:41:22,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:41:22,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:41:22,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:41:22,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:41:22,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:41:22,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:41:22,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:41:22,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:41:22,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:41:22,641 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:41:22,641 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:41:22,642 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:41:22,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1a19072/61ecd384c7064b70a8ad737fa64fd5c3/FLAGfc8350d2c [2019-09-08 10:41:23,434 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:41:23,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:41:23,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1a19072/61ecd384c7064b70a8ad737fa64fd5c3/FLAGfc8350d2c [2019-09-08 10:41:23,513 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d1a19072/61ecd384c7064b70a8ad737fa64fd5c3 [2019-09-08 10:41:23,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:41:23,526 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:41:23,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:41:23,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:41:23,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:41:23,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:41:23" (1/1) ... [2019-09-08 10:41:23,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fc9e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:23, skipping insertion in model container [2019-09-08 10:41:23,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:41:23" (1/1) ... [2019-09-08 10:41:23,544 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:41:23,704 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:41:24,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:41:24,804 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:41:25,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:41:25,224 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:41:25,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:25 WrapperNode [2019-09-08 10:41:25,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:41:25,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:41:25,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:41:25,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:41:25,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:25" (1/1) ... [2019-09-08 10:41:25,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:25" (1/1) ... [2019-09-08 10:41:25,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:25" (1/1) ... [2019-09-08 10:41:25,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:25" (1/1) ... [2019-09-08 10:41:25,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:25" (1/1) ... [2019-09-08 10:41:25,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:25" (1/1) ... [2019-09-08 10:41:25,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:25" (1/1) ... [2019-09-08 10:41:25,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:41:25,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:41:25,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:41:25,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:41:25,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:41:25,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:41:25,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:41:25,565 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:41:25,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:41:25,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:41:25,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:41:25,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:41:25,567 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:41:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:41:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:41:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:41:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:41:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:41:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:41:25,570 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:41:25,570 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:41:25,571 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:41:25,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:41:25,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:41:25,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:41:29,740 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:41:29,741 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:41:29,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:41:29 BoogieIcfgContainer [2019-09-08 10:41:29,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:41:29,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:41:29,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:41:29,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:41:29,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:41:23" (1/3) ... [2019-09-08 10:41:29,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce9d37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:41:29, skipping insertion in model container [2019-09-08 10:41:29,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:41:25" (2/3) ... [2019-09-08 10:41:29,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce9d37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:41:29, skipping insertion in model container [2019-09-08 10:41:29,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:41:29" (3/3) ... [2019-09-08 10:41:29,753 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:41:29,767 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:41:29,778 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-08 10:41:29,803 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-08 10:41:29,853 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:41:29,854 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:41:29,854 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:41:29,854 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:41:29,854 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:41:29,855 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:41:29,855 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:41:29,855 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:41:29,855 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:41:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states. [2019-09-08 10:41:29,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:41:29,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:29,922 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:29,924 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:29,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:29,932 INFO L82 PathProgramCache]: Analyzing trace with hash -492967282, now seen corresponding path program 1 times [2019-09-08 10:41:29,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:29,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:30,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:30,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:30,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:30,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:30,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:41:30,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:41:30,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:41:30,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:41:30,812 INFO L87 Difference]: Start difference. First operand 1107 states. Second operand 5 states. [2019-09-08 10:41:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:32,147 INFO L93 Difference]: Finished difference Result 1799 states and 3284 transitions. [2019-09-08 10:41:32,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:41:32,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-08 10:41:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:32,180 INFO L225 Difference]: With dead ends: 1799 [2019-09-08 10:41:32,180 INFO L226 Difference]: Without dead ends: 992 [2019-09-08 10:41:32,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:41:32,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-09-08 10:41:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 984. [2019-09-08 10:41:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-09-08 10:41:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1315 transitions. [2019-09-08 10:41:32,320 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1315 transitions. Word has length 67 [2019-09-08 10:41:32,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:32,321 INFO L475 AbstractCegarLoop]: Abstraction has 984 states and 1315 transitions. [2019-09-08 10:41:32,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:41:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1315 transitions. [2019-09-08 10:41:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:41:32,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:32,327 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:32,327 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:32,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:32,328 INFO L82 PathProgramCache]: Analyzing trace with hash 39988205, now seen corresponding path program 1 times [2019-09-08 10:41:32,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:32,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:32,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:32,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:32,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41: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-09-08 10:41:32,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:32,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:41:32,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:41:32,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:41:32,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:41:32,569 INFO L87 Difference]: Start difference. First operand 984 states and 1315 transitions. Second operand 6 states. [2019-09-08 10:41:33,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:33,441 INFO L93 Difference]: Finished difference Result 2087 states and 2919 transitions. [2019-09-08 10:41:33,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:41:33,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-08 10:41:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:33,449 INFO L225 Difference]: With dead ends: 2087 [2019-09-08 10:41:33,450 INFO L226 Difference]: Without dead ends: 1335 [2019-09-08 10:41:33,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:41:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-08 10:41:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1319. [2019-09-08 10:41:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2019-09-08 10:41:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1870 transitions. [2019-09-08 10:41:33,507 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1870 transitions. Word has length 68 [2019-09-08 10:41:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:33,508 INFO L475 AbstractCegarLoop]: Abstraction has 1319 states and 1870 transitions. [2019-09-08 10:41:33,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:41:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1870 transitions. [2019-09-08 10:41:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:41:33,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:33,512 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:33,513 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:33,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2058401878, now seen corresponding path program 1 times [2019-09-08 10:41:33,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:33,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:33,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:33,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:33,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:33,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:33,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:41:33,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:41:33,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:41:33,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:33,686 INFO L87 Difference]: Start difference. First operand 1319 states and 1870 transitions. Second operand 3 states. [2019-09-08 10:41:33,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:33,797 INFO L93 Difference]: Finished difference Result 2684 states and 3894 transitions. [2019-09-08 10:41:33,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:41:33,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 10:41:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:33,816 INFO L225 Difference]: With dead ends: 2684 [2019-09-08 10:41:33,816 INFO L226 Difference]: Without dead ends: 1894 [2019-09-08 10:41:33,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-09-08 10:41:33,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1882. [2019-09-08 10:41:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2019-09-08 10:41:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2669 transitions. [2019-09-08 10:41:33,921 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2669 transitions. Word has length 69 [2019-09-08 10:41:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:33,921 INFO L475 AbstractCegarLoop]: Abstraction has 1882 states and 2669 transitions. [2019-09-08 10:41:33,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:41:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2669 transitions. [2019-09-08 10:41:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:41:33,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:33,926 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:33,927 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:33,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:33,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1291573, now seen corresponding path program 1 times [2019-09-08 10:41:33,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:33,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:33,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:33,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:33,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:34,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:34,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:41:34,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:41:34,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:41:34,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:34,109 INFO L87 Difference]: Start difference. First operand 1882 states and 2669 transitions. Second operand 3 states. [2019-09-08 10:41:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:34,267 INFO L93 Difference]: Finished difference Result 4016 states and 5880 transitions. [2019-09-08 10:41:34,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:41:34,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 10:41:34,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:34,283 INFO L225 Difference]: With dead ends: 4016 [2019-09-08 10:41:34,284 INFO L226 Difference]: Without dead ends: 2831 [2019-09-08 10:41:34,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2019-09-08 10:41:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2823. [2019-09-08 10:41:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-09-08 10:41:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 4048 transitions. [2019-09-08 10:41:34,426 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 4048 transitions. Word has length 69 [2019-09-08 10:41:34,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:34,429 INFO L475 AbstractCegarLoop]: Abstraction has 2823 states and 4048 transitions. [2019-09-08 10:41:34,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:41:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 4048 transitions. [2019-09-08 10:41:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:41:34,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:34,435 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:34,436 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:34,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:34,436 INFO L82 PathProgramCache]: Analyzing trace with hash -327434068, now seen corresponding path program 1 times [2019-09-08 10:41:34,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:34,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:34,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:34,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:34,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:34,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:34,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:41:34,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:41:34,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:41:34,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:34,600 INFO L87 Difference]: Start difference. First operand 2823 states and 4048 transitions. Second operand 3 states. [2019-09-08 10:41:34,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:34,800 INFO L93 Difference]: Finished difference Result 7039 states and 10261 transitions. [2019-09-08 10:41:34,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:41:34,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-08 10:41:34,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:34,824 INFO L225 Difference]: With dead ends: 7039 [2019-09-08 10:41:34,825 INFO L226 Difference]: Without dead ends: 4824 [2019-09-08 10:41:34,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2019-09-08 10:41:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4806. [2019-09-08 10:41:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4806 states. [2019-09-08 10:41:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 6897 transitions. [2019-09-08 10:41:35,103 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 6897 transitions. Word has length 69 [2019-09-08 10:41:35,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:35,104 INFO L475 AbstractCegarLoop]: Abstraction has 4806 states and 6897 transitions. [2019-09-08 10:41:35,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:41:35,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 6897 transitions. [2019-09-08 10:41:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:41:35,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:35,110 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:35,111 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash -135245892, now seen corresponding path program 1 times [2019-09-08 10:41:35,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:35,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:35,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:35,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:35,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:35,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:35,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:41:35,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:41:35,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:41:35,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:41:35,270 INFO L87 Difference]: Start difference. First operand 4806 states and 6897 transitions. Second operand 6 states. [2019-09-08 10:41:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:36,281 INFO L93 Difference]: Finished difference Result 13286 states and 19432 transitions. [2019-09-08 10:41:36,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:41:36,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:41:36,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:36,327 INFO L225 Difference]: With dead ends: 13286 [2019-09-08 10:41:36,327 INFO L226 Difference]: Without dead ends: 8974 [2019-09-08 10:41:36,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:41:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8974 states. [2019-09-08 10:41:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8974 to 8918. [2019-09-08 10:41:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8918 states. [2019-09-08 10:41:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 13039 transitions. [2019-09-08 10:41:36,740 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 13039 transitions. Word has length 69 [2019-09-08 10:41:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:36,742 INFO L475 AbstractCegarLoop]: Abstraction has 8918 states and 13039 transitions. [2019-09-08 10:41:36,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:41:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 13039 transitions. [2019-09-08 10:41:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:41:36,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:36,751 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:36,752 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:36,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:36,757 INFO L82 PathProgramCache]: Analyzing trace with hash 956177235, now seen corresponding path program 1 times [2019-09-08 10:41:36,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:36,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:36,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:36,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:36,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:36,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:36,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:41:36,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:41:36,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:41:36,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:41:36,939 INFO L87 Difference]: Start difference. First operand 8918 states and 13039 transitions. Second operand 6 states. [2019-09-08 10:41:38,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:38,902 INFO L93 Difference]: Finished difference Result 29840 states and 43864 transitions. [2019-09-08 10:41:38,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:41:38,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:41:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:38,991 INFO L225 Difference]: With dead ends: 29840 [2019-09-08 10:41:38,991 INFO L226 Difference]: Without dead ends: 21416 [2019-09-08 10:41:39,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:41:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21416 states. [2019-09-08 10:41:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21416 to 21400. [2019-09-08 10:41:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21400 states. [2019-09-08 10:41:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21400 states to 21400 states and 31191 transitions. [2019-09-08 10:41:40,870 INFO L78 Accepts]: Start accepts. Automaton has 21400 states and 31191 transitions. Word has length 70 [2019-09-08 10:41:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:40,870 INFO L475 AbstractCegarLoop]: Abstraction has 21400 states and 31191 transitions. [2019-09-08 10:41:40,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:41:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21400 states and 31191 transitions. [2019-09-08 10:41:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:41:40,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:40,879 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:40,879 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:40,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:40,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1074377200, now seen corresponding path program 1 times [2019-09-08 10:41:40,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:40,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:40,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:40,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:40,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:40,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:40,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:41:40,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:41:40,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:41:40,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:40,992 INFO L87 Difference]: Start difference. First operand 21400 states and 31191 transitions. Second operand 3 states. [2019-09-08 10:41:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:42,297 INFO L93 Difference]: Finished difference Result 51676 states and 75874 transitions. [2019-09-08 10:41:42,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:41:42,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 10:41:42,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:42,371 INFO L225 Difference]: With dead ends: 51676 [2019-09-08 10:41:42,371 INFO L226 Difference]: Without dead ends: 32303 [2019-09-08 10:41:42,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:41:42,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32303 states. [2019-09-08 10:41:43,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32303 to 32095. [2019-09-08 10:41:43,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32095 states. [2019-09-08 10:41:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32095 states to 32095 states and 46321 transitions. [2019-09-08 10:41:43,844 INFO L78 Accepts]: Start accepts. Automaton has 32095 states and 46321 transitions. Word has length 70 [2019-09-08 10:41:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:43,845 INFO L475 AbstractCegarLoop]: Abstraction has 32095 states and 46321 transitions. [2019-09-08 10:41:43,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:41:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 32095 states and 46321 transitions. [2019-09-08 10:41:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:41:43,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:43,857 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:43,857 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:43,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:43,858 INFO L82 PathProgramCache]: Analyzing trace with hash -36131484, now seen corresponding path program 1 times [2019-09-08 10:41:43,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:43,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:43,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:43,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:43,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:43,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:43,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:41:43,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:41:43,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:41:43,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:41:43,999 INFO L87 Difference]: Start difference. First operand 32095 states and 46321 transitions. Second operand 7 states. [2019-09-08 10:41:48,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:48,986 INFO L93 Difference]: Finished difference Result 120227 states and 174538 transitions. [2019-09-08 10:41:48,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:41:48,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-08 10:41:48,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:49,279 INFO L225 Difference]: With dead ends: 120227 [2019-09-08 10:41:49,279 INFO L226 Difference]: Without dead ends: 103732 [2019-09-08 10:41:49,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:41:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103732 states. [2019-09-08 10:41:51,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103732 to 32123. [2019-09-08 10:41:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32123 states. [2019-09-08 10:41:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32123 states to 32123 states and 46357 transitions. [2019-09-08 10:41:51,664 INFO L78 Accepts]: Start accepts. Automaton has 32123 states and 46357 transitions. Word has length 71 [2019-09-08 10:41:51,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:51,664 INFO L475 AbstractCegarLoop]: Abstraction has 32123 states and 46357 transitions. [2019-09-08 10:41:51,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:41:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 32123 states and 46357 transitions. [2019-09-08 10:41:51,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:41:51,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:51,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:51,677 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:51,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:51,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1924835021, now seen corresponding path program 1 times [2019-09-08 10:41:51,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:51,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:51,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:51,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:51,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:41:51,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:51,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:41:51,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:41:51,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:41:51,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:41:51,857 INFO L87 Difference]: Start difference. First operand 32123 states and 46357 transitions. Second operand 7 states. [2019-09-08 10:41:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:59,597 INFO L93 Difference]: Finished difference Result 134897 states and 195938 transitions. [2019-09-08 10:41:59,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:41:59,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-08 10:41:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:59,842 INFO L225 Difference]: With dead ends: 134897 [2019-09-08 10:41:59,843 INFO L226 Difference]: Without dead ends: 119082 [2019-09-08 10:41:59,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:42:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119082 states. [2019-09-08 10:42:02,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119082 to 32211. [2019-09-08 10:42:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32211 states. [2019-09-08 10:42:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32211 states to 32211 states and 46478 transitions. [2019-09-08 10:42:02,375 INFO L78 Accepts]: Start accepts. Automaton has 32211 states and 46478 transitions. Word has length 71 [2019-09-08 10:42:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:02,375 INFO L475 AbstractCegarLoop]: Abstraction has 32211 states and 46478 transitions. [2019-09-08 10:42:02,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:42:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 32211 states and 46478 transitions. [2019-09-08 10:42:02,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:42:02,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:02,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:42:02,388 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:02,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:02,388 INFO L82 PathProgramCache]: Analyzing trace with hash -181098417, now seen corresponding path program 1 times [2019-09-08 10:42:02,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:02,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:02,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:02,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:02,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:42:02,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:02,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:42:02,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:42:02,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:42:02,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:42:02,531 INFO L87 Difference]: Start difference. First operand 32211 states and 46478 transitions. Second operand 7 states. [2019-09-08 10:42:14,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:14,889 INFO L93 Difference]: Finished difference Result 188303 states and 273715 transitions. [2019-09-08 10:42:14,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:42:14,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-08 10:42:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:15,144 INFO L225 Difference]: With dead ends: 188303 [2019-09-08 10:42:15,145 INFO L226 Difference]: Without dead ends: 174378 [2019-09-08 10:42:15,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:42:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174378 states. [2019-09-08 10:42:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174378 to 32279. [2019-09-08 10:42:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32279 states. [2019-09-08 10:42:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32279 states to 32279 states and 46566 transitions. [2019-09-08 10:42:20,128 INFO L78 Accepts]: Start accepts. Automaton has 32279 states and 46566 transitions. Word has length 71 [2019-09-08 10:42:20,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:20,128 INFO L475 AbstractCegarLoop]: Abstraction has 32279 states and 46566 transitions. [2019-09-08 10:42:20,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:42:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 32279 states and 46566 transitions. [2019-09-08 10:42:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:42:20,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:20,139 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:42:20,140 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:20,140 INFO L82 PathProgramCache]: Analyzing trace with hash 514388176, now seen corresponding path program 1 times [2019-09-08 10:42:20,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:20,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:20,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:20,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:20,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:42:20,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:20,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:42:20,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:42:20,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:42:20,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:42:20,268 INFO L87 Difference]: Start difference. First operand 32279 states and 46566 transitions. Second operand 7 states. [2019-09-08 10:42:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:32,605 INFO L93 Difference]: Finished difference Result 155293 states and 225552 transitions. [2019-09-08 10:42:32,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:42:32,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-08 10:42:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:32,829 INFO L225 Difference]: With dead ends: 155293 [2019-09-08 10:42:32,829 INFO L226 Difference]: Without dead ends: 139046 [2019-09-08 10:42:32,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:42:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139046 states. [2019-09-08 10:42:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139046 to 32442. [2019-09-08 10:42:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32442 states. [2019-09-08 10:42:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32442 states to 32442 states and 46781 transitions. [2019-09-08 10:42:36,248 INFO L78 Accepts]: Start accepts. Automaton has 32442 states and 46781 transitions. Word has length 71 [2019-09-08 10:42:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:36,248 INFO L475 AbstractCegarLoop]: Abstraction has 32442 states and 46781 transitions. [2019-09-08 10:42:36,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:42:36,248 INFO L276 IsEmpty]: Start isEmpty. Operand 32442 states and 46781 transitions. [2019-09-08 10:42:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:42:36,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:36,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:42:36,258 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:36,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:36,259 INFO L82 PathProgramCache]: Analyzing trace with hash 178314812, now seen corresponding path program 1 times [2019-09-08 10:42:36,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:36,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:36,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:42:36,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:36,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:42:36,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:42:36,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:42:36,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:42:36,523 INFO L87 Difference]: Start difference. First operand 32442 states and 46781 transitions. Second operand 9 states. [2019-09-08 10:42:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:52,471 INFO L93 Difference]: Finished difference Result 163018 states and 240149 transitions. [2019-09-08 10:42:52,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:42:52,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 10:42:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:52,677 INFO L225 Difference]: With dead ends: 163018 [2019-09-08 10:42:52,677 INFO L226 Difference]: Without dead ends: 136165 [2019-09-08 10:42:52,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:42:52,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136165 states. [2019-09-08 10:42:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136165 to 32430. [2019-09-08 10:42:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32430 states. [2019-09-08 10:42:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32430 states to 32430 states and 46757 transitions. [2019-09-08 10:42:57,002 INFO L78 Accepts]: Start accepts. Automaton has 32430 states and 46757 transitions. Word has length 72 [2019-09-08 10:42:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:57,002 INFO L475 AbstractCegarLoop]: Abstraction has 32430 states and 46757 transitions. [2019-09-08 10:42:57,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:42:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 32430 states and 46757 transitions. [2019-09-08 10:42:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:42:57,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:57,010 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:42:57,010 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:57,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:57,010 INFO L82 PathProgramCache]: Analyzing trace with hash 334798970, now seen corresponding path program 1 times [2019-09-08 10:42:57,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:57,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:57,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:57,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:57,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:42:57,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:57,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:42:57,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:42:57,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:42:57,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:42:57,149 INFO L87 Difference]: Start difference. First operand 32430 states and 46757 transitions. Second operand 7 states. [2019-09-08 10:43:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:13,459 INFO L93 Difference]: Finished difference Result 135182 states and 196309 transitions. [2019-09-08 10:43:13,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:43:13,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-08 10:43:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:13,605 INFO L225 Difference]: With dead ends: 135182 [2019-09-08 10:43:13,605 INFO L226 Difference]: Without dead ends: 119367 [2019-09-08 10:43:13,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:43:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119367 states. [2019-09-08 10:43:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119367 to 32521. [2019-09-08 10:43:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32521 states. [2019-09-08 10:43:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32521 states to 32521 states and 46885 transitions. [2019-09-08 10:43:17,513 INFO L78 Accepts]: Start accepts. Automaton has 32521 states and 46885 transitions. Word has length 72 [2019-09-08 10:43:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:17,513 INFO L475 AbstractCegarLoop]: Abstraction has 32521 states and 46885 transitions. [2019-09-08 10:43:17,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:43:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 32521 states and 46885 transitions. [2019-09-08 10:43:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:43:17,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:17,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:43:17,522 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:17,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:17,522 INFO L82 PathProgramCache]: Analyzing trace with hash -132358958, now seen corresponding path program 1 times [2019-09-08 10:43:17,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:17,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:17,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:17,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:17,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:43:17,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:17,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:43:17,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:43:17,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:43:17,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:43:17,744 INFO L87 Difference]: Start difference. First operand 32521 states and 46885 transitions. Second operand 9 states. [2019-09-08 10:43:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:36,397 INFO L93 Difference]: Finished difference Result 163154 states and 240347 transitions. [2019-09-08 10:43:36,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:43:36,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 10:43:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:36,593 INFO L225 Difference]: With dead ends: 163154 [2019-09-08 10:43:36,593 INFO L226 Difference]: Without dead ends: 136269 [2019-09-08 10:43:36,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:43:36,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136269 states. [2019-09-08 10:43:41,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136269 to 32493. [2019-09-08 10:43:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32493 states. [2019-09-08 10:43:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32493 states to 32493 states and 46841 transitions. [2019-09-08 10:43:41,293 INFO L78 Accepts]: Start accepts. Automaton has 32493 states and 46841 transitions. Word has length 72 [2019-09-08 10:43:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:41,294 INFO L475 AbstractCegarLoop]: Abstraction has 32493 states and 46841 transitions. [2019-09-08 10:43:41,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:43:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 32493 states and 46841 transitions. [2019-09-08 10:43:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:43:41,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:41,302 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:43:41,303 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:41,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:41,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1003542542, now seen corresponding path program 1 times [2019-09-08 10:43:41,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:41,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:41,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:41,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:41,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:43:41,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:41,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:43:41,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:43:41,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:43:41,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:43:41,514 INFO L87 Difference]: Start difference. First operand 32493 states and 46841 transitions. Second operand 9 states. [2019-09-08 10:44:01,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:01,871 INFO L93 Difference]: Finished difference Result 157123 states and 229743 transitions. [2019-09-08 10:44:01,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:44:01,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 10:44:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:02,050 INFO L225 Difference]: With dead ends: 157123 [2019-09-08 10:44:02,050 INFO L226 Difference]: Without dead ends: 129920 [2019-09-08 10:44:02,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:44:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129920 states. [2019-09-08 10:44:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129920 to 32307. [2019-09-08 10:44:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32307 states. [2019-09-08 10:44:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32307 states to 32307 states and 46594 transitions. [2019-09-08 10:44:06,975 INFO L78 Accepts]: Start accepts. Automaton has 32307 states and 46594 transitions. Word has length 72 [2019-09-08 10:44:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:06,976 INFO L475 AbstractCegarLoop]: Abstraction has 32307 states and 46594 transitions. [2019-09-08 10:44:06,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:44:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 32307 states and 46594 transitions. [2019-09-08 10:44:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:44:06,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:06,985 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:06,985 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:06,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:06,985 INFO L82 PathProgramCache]: Analyzing trace with hash 499783753, now seen corresponding path program 1 times [2019-09-08 10:44:06,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:06,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:06,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:06,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:06,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:07,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:07,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:44:07,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:44:07,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:44:07,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:44:07,199 INFO L87 Difference]: Start difference. First operand 32307 states and 46594 transitions. Second operand 8 states. [2019-09-08 10:44:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:25,824 INFO L93 Difference]: Finished difference Result 135218 states and 198418 transitions. [2019-09-08 10:44:25,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:44:25,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-09-08 10:44:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:25,974 INFO L225 Difference]: With dead ends: 135218 [2019-09-08 10:44:25,974 INFO L226 Difference]: Without dead ends: 107015 [2019-09-08 10:44:26,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:44:26,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107015 states. [2019-09-08 10:44:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107015 to 31715. [2019-09-08 10:44:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31715 states. [2019-09-08 10:44:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31715 states to 31715 states and 45822 transitions. [2019-09-08 10:44:30,856 INFO L78 Accepts]: Start accepts. Automaton has 31715 states and 45822 transitions. Word has length 72 [2019-09-08 10:44:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:30,856 INFO L475 AbstractCegarLoop]: Abstraction has 31715 states and 45822 transitions. [2019-09-08 10:44:30,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:44:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 31715 states and 45822 transitions. [2019-09-08 10:44:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:44:30,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:30,864 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:44:30,864 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:30,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:30,865 INFO L82 PathProgramCache]: Analyzing trace with hash -108281974, now seen corresponding path program 1 times [2019-09-08 10:44:30,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:30,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:30,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:30,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:30,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:44:31,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:31,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:44:31,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:44:31,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:44:31,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:44:31,451 INFO L87 Difference]: Start difference. First operand 31715 states and 45822 transitions. Second operand 12 states. [2019-09-08 10:45:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:06,552 INFO L93 Difference]: Finished difference Result 208495 states and 306916 transitions. [2019-09-08 10:45:06,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:45:06,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-08 10:45:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:06,825 INFO L225 Difference]: With dead ends: 208495 [2019-09-08 10:45:06,825 INFO L226 Difference]: Without dead ends: 181591 [2019-09-08 10:45:06,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:45:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181591 states. [2019-09-08 10:45:13,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181591 to 31638. [2019-09-08 10:45:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31638 states. [2019-09-08 10:45:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31638 states to 31638 states and 45711 transitions. [2019-09-08 10:45:13,345 INFO L78 Accepts]: Start accepts. Automaton has 31638 states and 45711 transitions. Word has length 73 [2019-09-08 10:45:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:13,346 INFO L475 AbstractCegarLoop]: Abstraction has 31638 states and 45711 transitions. [2019-09-08 10:45:13,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:45:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 31638 states and 45711 transitions. [2019-09-08 10:45:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:45:13,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:13,351 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:45:13,352 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:13,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:13,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1790307750, now seen corresponding path program 1 times [2019-09-08 10:45:13,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:13,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:13,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:13,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:13,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:13,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:13,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:45:13,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:45:13,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:45:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:45:13,801 INFO L87 Difference]: Start difference. First operand 31638 states and 45711 transitions. Second operand 11 states. [2019-09-08 10:45:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:45:48,710 INFO L93 Difference]: Finished difference Result 192176 states and 282194 transitions. [2019-09-08 10:45:48,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 10:45:48,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-09-08 10:45:48,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:45:48,959 INFO L225 Difference]: With dead ends: 192176 [2019-09-08 10:45:48,959 INFO L226 Difference]: Without dead ends: 164821 [2019-09-08 10:45:49,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-08 10:45:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164821 states. [2019-09-08 10:45:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164821 to 31173. [2019-09-08 10:45:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31173 states. [2019-09-08 10:45:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31173 states to 31173 states and 45075 transitions. [2019-09-08 10:45:58,991 INFO L78 Accepts]: Start accepts. Automaton has 31173 states and 45075 transitions. Word has length 73 [2019-09-08 10:45:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:58,992 INFO L475 AbstractCegarLoop]: Abstraction has 31173 states and 45075 transitions. [2019-09-08 10:45:58,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:45:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 31173 states and 45075 transitions. [2019-09-08 10:45:58,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:45:58,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:58,997 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:45:58,997 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:58,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:58,998 INFO L82 PathProgramCache]: Analyzing trace with hash 127087552, now seen corresponding path program 1 times [2019-09-08 10:45:58,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:58,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:58,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:58,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:58,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:45:59,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:59,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:45:59,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:45:59,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:45:59,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:45:59,481 INFO L87 Difference]: Start difference. First operand 31173 states and 45075 transitions. Second operand 12 states. [2019-09-08 10:46:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:42,411 INFO L93 Difference]: Finished difference Result 208911 states and 307283 transitions. [2019-09-08 10:46:42,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:46:42,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-08 10:46:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:42,697 INFO L225 Difference]: With dead ends: 208911 [2019-09-08 10:46:42,697 INFO L226 Difference]: Without dead ends: 181702 [2019-09-08 10:46:42,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:46:42,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181702 states. [2019-09-08 10:46:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181702 to 30777. [2019-09-08 10:46:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30777 states. [2019-09-08 10:46:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30777 states to 30777 states and 44576 transitions. [2019-09-08 10:46:50,319 INFO L78 Accepts]: Start accepts. Automaton has 30777 states and 44576 transitions. Word has length 73 [2019-09-08 10:46:50,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:50,320 INFO L475 AbstractCegarLoop]: Abstraction has 30777 states and 44576 transitions. [2019-09-08 10:46:50,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:46:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 30777 states and 44576 transitions. [2019-09-08 10:46:50,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:46:50,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:50,325 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:46:50,325 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:50,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:50,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1318862985, now seen corresponding path program 1 times [2019-09-08 10:46:50,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:50,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:50,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:50,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:50,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:46:50,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:50,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:46:50,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:46:50,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:46:50,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:46:50,418 INFO L87 Difference]: Start difference. First operand 30777 states and 44576 transitions. Second operand 3 states. [2019-09-08 10:46:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:58,692 INFO L93 Difference]: Finished difference Result 44839 states and 64942 transitions. [2019-09-08 10:46:58,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:46:58,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:46:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:58,731 INFO L225 Difference]: With dead ends: 44839 [2019-09-08 10:46:58,731 INFO L226 Difference]: Without dead ends: 30781 [2019-09-08 10:46:58,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:46:58,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30781 states. [2019-09-08 10:47:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30781 to 30777. [2019-09-08 10:47:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30777 states. [2019-09-08 10:47:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30777 states to 30777 states and 44060 transitions. [2019-09-08 10:47:05,354 INFO L78 Accepts]: Start accepts. Automaton has 30777 states and 44060 transitions. Word has length 74 [2019-09-08 10:47:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:05,354 INFO L475 AbstractCegarLoop]: Abstraction has 30777 states and 44060 transitions. [2019-09-08 10:47:05,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:47:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 30777 states and 44060 transitions. [2019-09-08 10:47:05,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:47:05,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:05,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:47:05,362 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:05,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:05,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2059949975, now seen corresponding path program 1 times [2019-09-08 10:47:05,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:05,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:05,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:05,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:05,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:05,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:47:05,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:47:05,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:47:05,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:47:05,440 INFO L87 Difference]: Start difference. First operand 30777 states and 44060 transitions. Second operand 3 states. [2019-09-08 10:47:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:16,136 INFO L93 Difference]: Finished difference Result 63499 states and 91415 transitions. [2019-09-08 10:47:16,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:47:16,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:47:16,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:16,199 INFO L225 Difference]: With dead ends: 63499 [2019-09-08 10:47:16,199 INFO L226 Difference]: Without dead ends: 45854 [2019-09-08 10:47:16,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:47:16,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45854 states. [2019-09-08 10:47:25,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45854 to 35882. [2019-09-08 10:47:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35882 states. [2019-09-08 10:47:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35882 states to 35882 states and 51667 transitions. [2019-09-08 10:47:25,701 INFO L78 Accepts]: Start accepts. Automaton has 35882 states and 51667 transitions. Word has length 75 [2019-09-08 10:47:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:25,701 INFO L475 AbstractCegarLoop]: Abstraction has 35882 states and 51667 transitions. [2019-09-08 10:47:25,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:47:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 35882 states and 51667 transitions. [2019-09-08 10:47:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:47:25,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:25,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:47:25,707 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:25,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:25,707 INFO L82 PathProgramCache]: Analyzing trace with hash 927142990, now seen corresponding path program 1 times [2019-09-08 10:47:25,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:25,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:25,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:25,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:25,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:25,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:25,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:47:25,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:47:25,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:47:25,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:47:25,782 INFO L87 Difference]: Start difference. First operand 35882 states and 51667 transitions. Second operand 3 states. [2019-09-08 10:47:36,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:36,436 INFO L93 Difference]: Finished difference Result 56219 states and 81133 transitions. [2019-09-08 10:47:36,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:47:36,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:47:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:36,488 INFO L225 Difference]: With dead ends: 56219 [2019-09-08 10:47:36,488 INFO L226 Difference]: Without dead ends: 38879 [2019-09-08 10:47:36,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:47:36,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38879 states. [2019-09-08 10:47:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38879 to 34652. [2019-09-08 10:47:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34652 states. [2019-09-08 10:47:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34652 states to 34652 states and 50008 transitions. [2019-09-08 10:47:45,521 INFO L78 Accepts]: Start accepts. Automaton has 34652 states and 50008 transitions. Word has length 75 [2019-09-08 10:47:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:45,521 INFO L475 AbstractCegarLoop]: Abstraction has 34652 states and 50008 transitions. [2019-09-08 10:47:45,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:47:45,521 INFO L276 IsEmpty]: Start isEmpty. Operand 34652 states and 50008 transitions. [2019-09-08 10:47:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:47:45,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:45,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:47:45,526 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:45,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:45,527 INFO L82 PathProgramCache]: Analyzing trace with hash 444387185, now seen corresponding path program 1 times [2019-09-08 10:47:45,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:45,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:45,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:45,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:45,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:45,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:45,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:47:45,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:47:45,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:47:45,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:47:45,732 INFO L87 Difference]: Start difference. First operand 34652 states and 50008 transitions. Second operand 9 states. [2019-09-08 10:48:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:23,047 INFO L93 Difference]: Finished difference Result 136721 states and 199350 transitions. [2019-09-08 10:48:23,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:48:23,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-09-08 10:48:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:23,291 INFO L225 Difference]: With dead ends: 136721 [2019-09-08 10:48:23,292 INFO L226 Difference]: Without dead ends: 120155 [2019-09-08 10:48:23,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:48:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120155 states. [2019-09-08 10:48:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120155 to 34580. [2019-09-08 10:48:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34580 states. [2019-09-08 10:48:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34580 states to 34580 states and 49910 transitions. [2019-09-08 10:48:33,959 INFO L78 Accepts]: Start accepts. Automaton has 34580 states and 49910 transitions. Word has length 76 [2019-09-08 10:48:33,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:33,959 INFO L475 AbstractCegarLoop]: Abstraction has 34580 states and 49910 transitions. [2019-09-08 10:48:33,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:48:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 34580 states and 49910 transitions. [2019-09-08 10:48:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:48:33,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:33,964 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:48:33,965 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:33,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:33,965 INFO L82 PathProgramCache]: Analyzing trace with hash -31713190, now seen corresponding path program 1 times [2019-09-08 10:48:33,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:33,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:33,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:33,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:33,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:34,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:34,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:48:34,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:48:34,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:48:34,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:34,045 INFO L87 Difference]: Start difference. First operand 34580 states and 49910 transitions. Second operand 3 states. [2019-09-08 10:48:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:43,736 INFO L93 Difference]: Finished difference Result 53703 states and 77499 transitions. [2019-09-08 10:48:43,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:48:43,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 10:48:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:43,771 INFO L225 Difference]: With dead ends: 53703 [2019-09-08 10:48:43,771 INFO L226 Difference]: Without dead ends: 34584 [2019-09-08 10:48:43,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34584 states. [2019-09-08 10:48:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34584 to 34580. [2019-09-08 10:48:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34580 states. [2019-09-08 10:48:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34580 states to 34580 states and 49387 transitions. [2019-09-08 10:48:52,931 INFO L78 Accepts]: Start accepts. Automaton has 34580 states and 49387 transitions. Word has length 77 [2019-09-08 10:48:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:52,931 INFO L475 AbstractCegarLoop]: Abstraction has 34580 states and 49387 transitions. [2019-09-08 10:48:52,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 34580 states and 49387 transitions. [2019-09-08 10:48:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:48:52,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:52,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:48:52,940 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:52,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:52,940 INFO L82 PathProgramCache]: Analyzing trace with hash 598552081, now seen corresponding path program 1 times [2019-09-08 10:48:52,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:52,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:52,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:53,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:53,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 10:48:53,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 10:48:53,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 10:48:53,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:48:53,812 INFO L87 Difference]: Start difference. First operand 34580 states and 49387 transitions. Second operand 17 states. [2019-09-08 10:48:54,539 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-08 10:48:54,838 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 10:49:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:12,252 INFO L93 Difference]: Finished difference Result 62661 states and 89986 transitions. [2019-09-08 10:49:12,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 10:49:12,253 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2019-09-08 10:49:12,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:12,322 INFO L225 Difference]: With dead ends: 62661 [2019-09-08 10:49:12,322 INFO L226 Difference]: Without dead ends: 55817 [2019-09-08 10:49:12,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:49:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55817 states. [2019-09-08 10:49:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55817 to 34516. [2019-09-08 10:49:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34516 states. [2019-09-08 10:49:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34516 states to 34516 states and 49307 transitions. [2019-09-08 10:49:22,038 INFO L78 Accepts]: Start accepts. Automaton has 34516 states and 49307 transitions. Word has length 79 [2019-09-08 10:49:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:22,038 INFO L475 AbstractCegarLoop]: Abstraction has 34516 states and 49307 transitions. [2019-09-08 10:49:22,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 10:49:22,039 INFO L276 IsEmpty]: Start isEmpty. Operand 34516 states and 49307 transitions. [2019-09-08 10:49:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:49:22,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:22,046 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:49:22,046 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:22,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:22,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1291163895, now seen corresponding path program 1 times [2019-09-08 10:49:22,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:22,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:22,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:22,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:22,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:49:22,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:22,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:49:22,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:49:22,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:49:22,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:49:22,140 INFO L87 Difference]: Start difference. First operand 34516 states and 49307 transitions. Second operand 3 states. [2019-09-08 10:49:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:38,487 INFO L93 Difference]: Finished difference Result 72646 states and 104403 transitions. [2019-09-08 10:49:38,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:49:38,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 10:49:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:38,558 INFO L225 Difference]: With dead ends: 72646 [2019-09-08 10:49:38,558 INFO L226 Difference]: Without dead ends: 52819 [2019-09-08 10:49:38,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:49:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52819 states. [2019-09-08 10:49:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52819 to 34379. [2019-09-08 10:49:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34379 states. [2019-09-08 10:49:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34379 states to 34379 states and 49019 transitions. [2019-09-08 10:49:50,046 INFO L78 Accepts]: Start accepts. Automaton has 34379 states and 49019 transitions. Word has length 79 [2019-09-08 10:49:50,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:50,046 INFO L475 AbstractCegarLoop]: Abstraction has 34379 states and 49019 transitions. [2019-09-08 10:49:50,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:49:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 34379 states and 49019 transitions. [2019-09-08 10:49:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:49:50,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:50,057 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:49:50,057 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:50,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1359737498, now seen corresponding path program 1 times [2019-09-08 10:49:50,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:50,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:50,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:50,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:50,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:49:50,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:50,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:49:50,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:49:50,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:49:50,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:49:50,457 INFO L87 Difference]: Start difference. First operand 34379 states and 49019 transitions. Second operand 11 states. [2019-09-08 10:50:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:25,690 INFO L93 Difference]: Finished difference Result 101993 states and 146923 transitions. [2019-09-08 10:50:25,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 10:50:25,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2019-09-08 10:50:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:25,813 INFO L225 Difference]: With dead ends: 101993 [2019-09-08 10:50:25,813 INFO L226 Difference]: Without dead ends: 95209 [2019-09-08 10:50:25,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:50:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95209 states. [2019-09-08 10:50:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95209 to 34373. [2019-09-08 10:50:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34373 states. [2019-09-08 10:50:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34373 states to 34373 states and 49010 transitions. [2019-09-08 10:50:38,223 INFO L78 Accepts]: Start accepts. Automaton has 34373 states and 49010 transitions. Word has length 80 [2019-09-08 10:50:38,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:38,224 INFO L475 AbstractCegarLoop]: Abstraction has 34373 states and 49010 transitions. [2019-09-08 10:50:38,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:50:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 34373 states and 49010 transitions. [2019-09-08 10:50:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 10:50:38,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:38,239 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:50:38,240 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:38,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:38,240 INFO L82 PathProgramCache]: Analyzing trace with hash 638116678, now seen corresponding path program 1 times [2019-09-08 10:50:38,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:38,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:38,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:38,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:38,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:38,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:38,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:50:38,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:50:38,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:50:38,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:50:38,372 INFO L87 Difference]: Start difference. First operand 34373 states and 49010 transitions. Second operand 7 states. [2019-09-08 10:52:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:09,892 INFO L93 Difference]: Finished difference Result 279851 states and 403157 transitions. [2019-09-08 10:52:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:52:09,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-08 10:52:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:10,333 INFO L225 Difference]: With dead ends: 279851 [2019-09-08 10:52:10,333 INFO L226 Difference]: Without dead ends: 248039 [2019-09-08 10:52:10,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:52:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248039 states. [2019-09-08 10:53:00,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248039 to 129503. [2019-09-08 10:53:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129503 states. [2019-09-08 10:53:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129503 states to 129503 states and 183940 transitions. [2019-09-08 10:53:00,483 INFO L78 Accepts]: Start accepts. Automaton has 129503 states and 183940 transitions. Word has length 88 [2019-09-08 10:53:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:00,483 INFO L475 AbstractCegarLoop]: Abstraction has 129503 states and 183940 transitions. [2019-09-08 10:53:00,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:53:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 129503 states and 183940 transitions. [2019-09-08 10:53:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 10:53:00,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:00,509 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:53:00,509 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:00,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:00,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1941368129, now seen corresponding path program 1 times [2019-09-08 10:53:00,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:00,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:00,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:00,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:00,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:00,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:00,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:53:00,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:53:00,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:53:00,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:53:00,685 INFO L87 Difference]: Start difference. First operand 129503 states and 183940 transitions. Second operand 6 states. [2019-09-08 10:53:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:50,235 INFO L93 Difference]: Finished difference Result 157869 states and 223282 transitions. [2019-09-08 10:53:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:53:50,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-08 10:53:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:50,425 INFO L225 Difference]: With dead ends: 157869 [2019-09-08 10:53:50,426 INFO L226 Difference]: Without dead ends: 135389 [2019-09-08 10:53:50,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:53:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135389 states. [2019-09-08 10:54:38,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135389 to 117546. [2019-09-08 10:54:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117546 states. [2019-09-08 10:54:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117546 states to 117546 states and 165764 transitions. [2019-09-08 10:54:38,283 INFO L78 Accepts]: Start accepts. Automaton has 117546 states and 165764 transitions. Word has length 89 [2019-09-08 10:54:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:38,284 INFO L475 AbstractCegarLoop]: Abstraction has 117546 states and 165764 transitions. [2019-09-08 10:54:38,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:54:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 117546 states and 165764 transitions. [2019-09-08 10:54:38,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 10:54:38,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:38,310 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:54:38,310 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:38,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:38,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1942450074, now seen corresponding path program 1 times [2019-09-08 10:54:38,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:38,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:38,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:38,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:38,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:54:38,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:38,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:54:38,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:54:38,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:54:38,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:54:38,441 INFO L87 Difference]: Start difference. First operand 117546 states and 165764 transitions. Second operand 6 states.