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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:46:54,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:46:54,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:46:54,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:46:54,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:46:54,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:46:54,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:46:54,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:46:54,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:46:54,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:46:54,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:46:54,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:46:54,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:46:54,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:46:54,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:46:54,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:46:54,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:46:54,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:46:54,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:46:54,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:46:54,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:46:54,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:46:54,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:46:54,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:46:54,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:46:54,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:46:54,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:46:54,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:46:54,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:46:54,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:46:54,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:46:54,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:46:54,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:46:54,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:46:54,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:46:54,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:46:54,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:46:54,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:46:54,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:46:54,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:46:54,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:46:54,473 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 11:46:54,496 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:46:54,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:46:54,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:46:54,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:46:54,498 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:46:54,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:46:54,498 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:46:54,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:46:54,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:46:54,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:46:54,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:46:54,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:46:54,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:46:54,500 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:46:54,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:46:54,500 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:46:54,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:46:54,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:46:54,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:46:54,501 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:46:54,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:46:54,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:46:54,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:46:54,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:46:54,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:46:54,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:46:54,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:46:54,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:46:54,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:46:54,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:46:54,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:46:54,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:46:54,549 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:46:54,550 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:46:54,550 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 11:46:54,622 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c34146aa6/4c2f9685696b4b5fa578d525ea1a1137/FLAG84404c895 [2019-09-08 11:46:55,198 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:46:55,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 11:46:55,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c34146aa6/4c2f9685696b4b5fa578d525ea1a1137/FLAG84404c895 [2019-09-08 11:46:55,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c34146aa6/4c2f9685696b4b5fa578d525ea1a1137 [2019-09-08 11:46:55,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:46:55,469 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:46:55,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:46:55,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:46:55,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:46:55,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:46:55" (1/1) ... [2019-09-08 11:46:55,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45625c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:46:55, skipping insertion in model container [2019-09-08 11:46:55,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:46:55" (1/1) ... [2019-09-08 11:46:55,489 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:46:55,577 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:46:56,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:46:56,203 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:46:56,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:46:56,676 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:46:56,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:46:56 WrapperNode [2019-09-08 11:46:56,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:46:56,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:46:56,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:46:56,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:46:56,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:46:56" (1/1) ... [2019-09-08 11:46:56,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:46:56" (1/1) ... [2019-09-08 11:46:56,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:46:56" (1/1) ... [2019-09-08 11:46:56,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:46:56" (1/1) ... [2019-09-08 11:46:56,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:46:56" (1/1) ... [2019-09-08 11:46:56,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:46:56" (1/1) ... [2019-09-08 11:46:56,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:46:56" (1/1) ... [2019-09-08 11:46:56,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:46:56,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:46:56,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:46:56,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:46:56,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:46:56" (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 11:46:56,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:46:56,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:46:56,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:46:56,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:46:56,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:46:56,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:46:56,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:46:56,872 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:46:56,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:46:56,872 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:46:56,872 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:46:56,873 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:46:56,873 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:46:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:46:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:46:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:46:56,876 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:46:56,876 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:46:56,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:46:56,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:46:58,449 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:46:58,450 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:46:58,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:46:58 BoogieIcfgContainer [2019-09-08 11:46:58,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:46:58,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:46:58,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:46:58,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:46:58,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:46:55" (1/3) ... [2019-09-08 11:46:58,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d171d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:46:58, skipping insertion in model container [2019-09-08 11:46:58,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:46:56" (2/3) ... [2019-09-08 11:46:58,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d171d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:46:58, skipping insertion in model container [2019-09-08 11:46:58,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:46:58" (3/3) ... [2019-09-08 11:46:58,464 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 11:46:58,476 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:46:58,505 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-08 11:46:58,527 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-08 11:46:58,577 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:46:58,578 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:46:58,578 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:46:58,578 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:46:58,579 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:46:58,579 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:46:58,579 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:46:58,579 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:46:58,579 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:46:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states. [2019-09-08 11:46:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 11:46:58,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:46:58,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:46:58,633 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:46:58,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:46:58,639 INFO L82 PathProgramCache]: Analyzing trace with hash 941972639, now seen corresponding path program 1 times [2019-09-08 11:46:58,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:46:58,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:46:58,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:58,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:46:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:46:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:46:59,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:46:59,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:46:59,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:46:59,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:46:59,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:46:59,121 INFO L87 Difference]: Start difference. First operand 362 states. Second operand 5 states. [2019-09-08 11:46:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:46:59,770 INFO L93 Difference]: Finished difference Result 711 states and 1197 transitions. [2019-09-08 11:46:59,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:46:59,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-09-08 11:46:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:46:59,803 INFO L225 Difference]: With dead ends: 711 [2019-09-08 11:46:59,803 INFO L226 Difference]: Without dead ends: 431 [2019-09-08 11:46:59,815 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 11:46:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-09-08 11:46:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 389. [2019-09-08 11:46:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-09-08 11:46:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 513 transitions. [2019-09-08 11:46:59,893 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 513 transitions. Word has length 62 [2019-09-08 11:46:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:46:59,893 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 513 transitions. [2019-09-08 11:46:59,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:46:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 513 transitions. [2019-09-08 11:46:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 11:46:59,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:46:59,900 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:46:59,900 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:46:59,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:46:59,901 INFO L82 PathProgramCache]: Analyzing trace with hash 66564200, now seen corresponding path program 1 times [2019-09-08 11:46:59,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:46:59,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:46:59,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:59,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:46:59,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:46:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:00,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:00,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:47:00,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:47:00,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:47:00,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:47:00,133 INFO L87 Difference]: Start difference. First operand 389 states and 513 transitions. Second operand 5 states. [2019-09-08 11:47:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:00,445 INFO L93 Difference]: Finished difference Result 684 states and 925 transitions. [2019-09-08 11:47:00,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:47:00,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-08 11:47:00,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:00,449 INFO L225 Difference]: With dead ends: 684 [2019-09-08 11:47:00,449 INFO L226 Difference]: Without dead ends: 363 [2019-09-08 11:47:00,452 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 11:47:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-08 11:47:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2019-09-08 11:47:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-09-08 11:47:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 481 transitions. [2019-09-08 11:47:00,500 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 481 transitions. Word has length 63 [2019-09-08 11:47:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:00,501 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 481 transitions. [2019-09-08 11:47:00,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:47:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 481 transitions. [2019-09-08 11:47:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:47:00,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47: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] [2019-09-08 11:47:00,510 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:00,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:00,510 INFO L82 PathProgramCache]: Analyzing trace with hash 459645881, now seen corresponding path program 1 times [2019-09-08 11:47:00,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:00,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:00,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:00,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:00,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:00,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:00,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:47:00,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:47:00,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:47:00,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:47:00,715 INFO L87 Difference]: Start difference. First operand 363 states and 481 transitions. Second operand 6 states. [2019-09-08 11:47:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:01,044 INFO L93 Difference]: Finished difference Result 821 states and 1105 transitions. [2019-09-08 11:47:01,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:47:01,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-09-08 11:47:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:01,048 INFO L225 Difference]: With dead ends: 821 [2019-09-08 11:47:01,048 INFO L226 Difference]: Without dead ends: 516 [2019-09-08 11:47:01,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:47:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-09-08 11:47:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 476. [2019-09-08 11:47:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-09-08 11:47:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 648 transitions. [2019-09-08 11:47:01,078 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 648 transitions. Word has length 64 [2019-09-08 11:47:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:01,079 INFO L475 AbstractCegarLoop]: Abstraction has 476 states and 648 transitions. [2019-09-08 11:47:01,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:47:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 648 transitions. [2019-09-08 11:47:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:47:01,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:01,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:01,081 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:01,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:01,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1942655578, now seen corresponding path program 1 times [2019-09-08 11:47:01,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:01,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:01,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:01,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:01,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:01,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:01,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:47:01,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:47:01,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:47:01,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:47:01,166 INFO L87 Difference]: Start difference. First operand 476 states and 648 transitions. Second operand 5 states. [2019-09-08 11:47:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:01,393 INFO L93 Difference]: Finished difference Result 894 states and 1237 transitions. [2019-09-08 11:47:01,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:47:01,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-08 11:47:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:01,397 INFO L225 Difference]: With dead ends: 894 [2019-09-08 11:47:01,397 INFO L226 Difference]: Without dead ends: 465 [2019-09-08 11:47:01,400 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 11:47:01,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-08 11:47:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2019-09-08 11:47:01,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 11:47:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 632 transitions. [2019-09-08 11:47:01,428 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 632 transitions. Word has length 65 [2019-09-08 11:47:01,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:01,429 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 632 transitions. [2019-09-08 11:47:01,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:47:01,430 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 632 transitions. [2019-09-08 11:47:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:47:01,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:01,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:01,433 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:01,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:01,433 INFO L82 PathProgramCache]: Analyzing trace with hash -795955653, now seen corresponding path program 1 times [2019-09-08 11:47:01,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:01,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:01,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:01,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:01,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:01,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:01,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:47:01,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:47:01,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:47:01,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:47:01,680 INFO L87 Difference]: Start difference. First operand 465 states and 632 transitions. Second operand 9 states. [2019-09-08 11:47:02,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:02,805 INFO L93 Difference]: Finished difference Result 1485 states and 2119 transitions. [2019-09-08 11:47:02,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:47:02,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-09-08 11:47:02,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:02,815 INFO L225 Difference]: With dead ends: 1485 [2019-09-08 11:47:02,815 INFO L226 Difference]: Without dead ends: 1199 [2019-09-08 11:47:02,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:47:02,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-08 11:47:02,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 465. [2019-09-08 11:47:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 11:47:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 630 transitions. [2019-09-08 11:47:02,890 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 630 transitions. Word has length 66 [2019-09-08 11:47:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:02,890 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 630 transitions. [2019-09-08 11:47:02,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:47:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 630 transitions. [2019-09-08 11:47:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:47:02,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:02,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:02,893 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:02,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:02,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1601893614, now seen corresponding path program 1 times [2019-09-08 11:47:02,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:02,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:02,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:02,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:03,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:03,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:47:03,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:47:03,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:47:03,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:47:03,128 INFO L87 Difference]: Start difference. First operand 465 states and 630 transitions. Second operand 8 states. [2019-09-08 11:47:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:03,927 INFO L93 Difference]: Finished difference Result 1107 states and 1553 transitions. [2019-09-08 11:47:03,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:47:03,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-09-08 11:47:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:03,933 INFO L225 Difference]: With dead ends: 1107 [2019-09-08 11:47:03,933 INFO L226 Difference]: Without dead ends: 813 [2019-09-08 11:47:03,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:47:03,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2019-09-08 11:47:03,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 465. [2019-09-08 11:47:03,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 11:47:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 629 transitions. [2019-09-08 11:47:03,975 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 629 transitions. Word has length 66 [2019-09-08 11:47:03,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:03,976 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 629 transitions. [2019-09-08 11:47:03,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:47:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 629 transitions. [2019-09-08 11:47:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:47:03,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:03,979 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:03,979 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:03,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash -867057492, now seen corresponding path program 1 times [2019-09-08 11:47:03,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:03,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:03,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:03,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:03,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:04,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:04,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:47:04,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:47:04,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:47:04,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:47:04,188 INFO L87 Difference]: Start difference. First operand 465 states and 629 transitions. Second operand 9 states. [2019-09-08 11:47:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:05,359 INFO L93 Difference]: Finished difference Result 1252 states and 1806 transitions. [2019-09-08 11:47:05,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:47:05,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-09-08 11:47:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:05,365 INFO L225 Difference]: With dead ends: 1252 [2019-09-08 11:47:05,365 INFO L226 Difference]: Without dead ends: 1006 [2019-09-08 11:47:05,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:47:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-09-08 11:47:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 465. [2019-09-08 11:47:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 11:47:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 628 transitions. [2019-09-08 11:47:05,426 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 628 transitions. Word has length 66 [2019-09-08 11:47:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:05,427 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 628 transitions. [2019-09-08 11:47:05,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:47:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 628 transitions. [2019-09-08 11:47:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:47:05,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:05,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:05,429 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:05,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:05,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1942709412, now seen corresponding path program 1 times [2019-09-08 11:47:05,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:05,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:05,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:05,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:05,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:05,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:05,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:47:05,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:47:05,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:47:05,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:47:05,630 INFO L87 Difference]: Start difference. First operand 465 states and 628 transitions. Second operand 9 states. [2019-09-08 11:47:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:06,939 INFO L93 Difference]: Finished difference Result 1444 states and 2071 transitions. [2019-09-08 11:47:06,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:47:06,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-09-08 11:47:06,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:06,945 INFO L225 Difference]: With dead ends: 1444 [2019-09-08 11:47:06,945 INFO L226 Difference]: Without dead ends: 1224 [2019-09-08 11:47:06,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:47:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-09-08 11:47:06,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 465. [2019-09-08 11:47:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 11:47:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 627 transitions. [2019-09-08 11:47:06,993 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 627 transitions. Word has length 66 [2019-09-08 11:47:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:06,994 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 627 transitions. [2019-09-08 11:47:06,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:47:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 627 transitions. [2019-09-08 11:47:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:47:06,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:06,995 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:06,995 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:06,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:06,996 INFO L82 PathProgramCache]: Analyzing trace with hash 703847879, now seen corresponding path program 1 times [2019-09-08 11:47:06,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:06,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:06,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:06,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:06,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:07,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:07,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:47:07,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:47:07,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:47:07,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:47:07,131 INFO L87 Difference]: Start difference. First operand 465 states and 627 transitions. Second operand 9 states. [2019-09-08 11:47:08,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:08,264 INFO L93 Difference]: Finished difference Result 1205 states and 1703 transitions. [2019-09-08 11:47:08,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:47:08,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-08 11:47:08,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:08,272 INFO L225 Difference]: With dead ends: 1205 [2019-09-08 11:47:08,272 INFO L226 Difference]: Without dead ends: 1200 [2019-09-08 11:47:08,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:47:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-09-08 11:47:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 465. [2019-09-08 11:47:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 11:47:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 625 transitions. [2019-09-08 11:47:08,366 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 625 transitions. Word has length 68 [2019-09-08 11:47:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:08,367 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 625 transitions. [2019-09-08 11:47:08,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:47:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 625 transitions. [2019-09-08 11:47:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:47:08,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:08,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:08,369 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash 318799718, now seen corresponding path program 1 times [2019-09-08 11:47:08,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:08,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:08,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:08,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:08,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:08,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:08,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:47:08,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:47:08,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:47:08,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:47:08,522 INFO L87 Difference]: Start difference. First operand 465 states and 625 transitions. Second operand 9 states. [2019-09-08 11:47:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:09,651 INFO L93 Difference]: Finished difference Result 1241 states and 1755 transitions. [2019-09-08 11:47:09,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:47:09,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-08 11:47:09,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:09,660 INFO L225 Difference]: With dead ends: 1241 [2019-09-08 11:47:09,661 INFO L226 Difference]: Without dead ends: 1224 [2019-09-08 11:47:09,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:47:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-09-08 11:47:09,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 465. [2019-09-08 11:47:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 11:47:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 623 transitions. [2019-09-08 11:47:09,709 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 623 transitions. Word has length 68 [2019-09-08 11:47:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:09,709 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 623 transitions. [2019-09-08 11:47:09,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:47:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 623 transitions. [2019-09-08 11:47:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:47:09,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:09,711 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:09,711 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:09,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:09,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1611983614, now seen corresponding path program 1 times [2019-09-08 11:47:09,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:09,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:09,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:09,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:09,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:09,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:09,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:47:09,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:47:09,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:47:09,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:47:09,846 INFO L87 Difference]: Start difference. First operand 465 states and 623 transitions. Second operand 9 states. [2019-09-08 11:47:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:11,023 INFO L93 Difference]: Finished difference Result 1449 states and 2071 transitions. [2019-09-08 11:47:11,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:47:11,023 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-08 11:47:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:11,029 INFO L225 Difference]: With dead ends: 1449 [2019-09-08 11:47:11,029 INFO L226 Difference]: Without dead ends: 1224 [2019-09-08 11:47:11,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:47:11,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-09-08 11:47:11,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 465. [2019-09-08 11:47:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 11:47:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 622 transitions. [2019-09-08 11:47:11,082 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 622 transitions. Word has length 68 [2019-09-08 11:47:11,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:11,083 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 622 transitions. [2019-09-08 11:47:11,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:47:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 622 transitions. [2019-09-08 11:47:11,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:47:11,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:11,084 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:11,085 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:11,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:11,085 INFO L82 PathProgramCache]: Analyzing trace with hash -317172898, now seen corresponding path program 1 times [2019-09-08 11:47:11,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:11,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:11,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:11,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:11,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:11,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:11,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:47:11,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:47:11,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:47:11,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:47:11,235 INFO L87 Difference]: Start difference. First operand 465 states and 622 transitions. Second operand 9 states. [2019-09-08 11:47:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:12,387 INFO L93 Difference]: Finished difference Result 1413 states and 2016 transitions. [2019-09-08 11:47:12,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:47:12,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-08 11:47:12,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:12,394 INFO L225 Difference]: With dead ends: 1413 [2019-09-08 11:47:12,394 INFO L226 Difference]: Without dead ends: 1200 [2019-09-08 11:47:12,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:47:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-09-08 11:47:12,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 465. [2019-09-08 11:47:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 11:47:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 621 transitions. [2019-09-08 11:47:12,447 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 621 transitions. Word has length 68 [2019-09-08 11:47:12,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:12,448 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 621 transitions. [2019-09-08 11:47:12,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:47:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 621 transitions. [2019-09-08 11:47:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:47:12,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:12,449 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:12,450 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:12,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:12,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1479311023, now seen corresponding path program 1 times [2019-09-08 11:47:12,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:12,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:12,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:12,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:12,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:47:12,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:47:12,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:47:12,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:47:12,575 INFO L87 Difference]: Start difference. First operand 465 states and 621 transitions. Second operand 9 states. [2019-09-08 11:47:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:13,681 INFO L93 Difference]: Finished difference Result 1205 states and 1697 transitions. [2019-09-08 11:47:13,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:47:13,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-08 11:47:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:13,687 INFO L225 Difference]: With dead ends: 1205 [2019-09-08 11:47:13,687 INFO L226 Difference]: Without dead ends: 1200 [2019-09-08 11:47:13,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:47:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-09-08 11:47:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 465. [2019-09-08 11:47:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 11:47:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 620 transitions. [2019-09-08 11:47:13,747 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 620 transitions. Word has length 68 [2019-09-08 11:47:13,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:13,748 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 620 transitions. [2019-09-08 11:47:13,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:47:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 620 transitions. [2019-09-08 11:47:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:47:13,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:13,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:13,750 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:13,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:13,751 INFO L82 PathProgramCache]: Analyzing trace with hash -205437134, now seen corresponding path program 1 times [2019-09-08 11:47:13,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:13,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:13,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:13,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:13,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:13,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:13,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:47:13,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:47:13,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:47:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:47:13,953 INFO L87 Difference]: Start difference. First operand 465 states and 620 transitions. Second operand 9 states. [2019-09-08 11:47:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:15,235 INFO L93 Difference]: Finished difference Result 1410 states and 2010 transitions. [2019-09-08 11:47:15,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:47:15,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-08 11:47:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:15,240 INFO L225 Difference]: With dead ends: 1410 [2019-09-08 11:47:15,240 INFO L226 Difference]: Without dead ends: 1200 [2019-09-08 11:47:15,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:47:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-09-08 11:47:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 465. [2019-09-08 11:47:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 11:47:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 619 transitions. [2019-09-08 11:47:15,299 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 619 transitions. Word has length 68 [2019-09-08 11:47:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:15,299 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 619 transitions. [2019-09-08 11:47:15,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:47:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 619 transitions. [2019-09-08 11:47:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:47:15,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:15,301 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:15,301 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:15,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:15,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1850627413, now seen corresponding path program 1 times [2019-09-08 11:47:15,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:15,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:15,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:15,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:15,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:16,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:16,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:47:16,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:47:16,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:47:16,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:47:16,163 INFO L87 Difference]: Start difference. First operand 465 states and 619 transitions. Second operand 16 states. [2019-09-08 11:47:16,912 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 11:47:17,055 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 11:47:17,202 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 11:47:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:18,614 INFO L93 Difference]: Finished difference Result 1118 states and 1546 transitions. [2019-09-08 11:47:18,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:47:18,615 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 70 [2019-09-08 11:47:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:18,619 INFO L225 Difference]: With dead ends: 1118 [2019-09-08 11:47:18,619 INFO L226 Difference]: Without dead ends: 909 [2019-09-08 11:47:18,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:47:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-08 11:47:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 464. [2019-09-08 11:47:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 11:47:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 617 transitions. [2019-09-08 11:47:18,686 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 617 transitions. Word has length 70 [2019-09-08 11:47:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:18,687 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 617 transitions. [2019-09-08 11:47:18,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:47:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 617 transitions. [2019-09-08 11:47:18,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:47:18,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:18,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:18,689 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:18,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:18,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1999891916, now seen corresponding path program 1 times [2019-09-08 11:47:18,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:18,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:18,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:18,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:18,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:19,756 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 11:47:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:20,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:20,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:47:20,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:47:20,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:47:20,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:47:20,288 INFO L87 Difference]: Start difference. First operand 464 states and 617 transitions. Second operand 21 states. [2019-09-08 11:47:20,462 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-08 11:47:21,097 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-08 11:47:21,255 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-09-08 11:47:21,476 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-08 11:47:21,765 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 11:47:22,183 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-09-08 11:47:22,442 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:47:22,688 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:47:22,975 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-08 11:47:23,264 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-08 11:47:23,750 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 11:47:24,044 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:47:24,279 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 11:47:24,608 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 11:47:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:26,503 INFO L93 Difference]: Finished difference Result 963 states and 1296 transitions. [2019-09-08 11:47:26,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:47:26,504 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 70 [2019-09-08 11:47:26,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:26,507 INFO L225 Difference]: With dead ends: 963 [2019-09-08 11:47:26,507 INFO L226 Difference]: Without dead ends: 957 [2019-09-08 11:47:26,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=383, Invalid=1257, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 11:47:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-09-08 11:47:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 464. [2019-09-08 11:47:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-08 11:47:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 616 transitions. [2019-09-08 11:47:26,587 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 616 transitions. Word has length 70 [2019-09-08 11:47:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:26,588 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 616 transitions. [2019-09-08 11:47:26,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:47:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 616 transitions. [2019-09-08 11:47:26,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:47:26,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:26,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:26,590 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:26,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:26,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1089068483, now seen corresponding path program 1 times [2019-09-08 11:47:26,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:26,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:26,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:26,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:26,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:27,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:27,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:47:27,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:47:27,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:47:27,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:47:27,417 INFO L87 Difference]: Start difference. First operand 464 states and 616 transitions. Second operand 17 states. [2019-09-08 11:47:28,017 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 11:47:28,177 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 11:47:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:29,022 INFO L93 Difference]: Finished difference Result 840 states and 1162 transitions. [2019-09-08 11:47:29,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:47:29,022 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2019-09-08 11:47:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:29,025 INFO L225 Difference]: With dead ends: 840 [2019-09-08 11:47:29,026 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 11:47:29,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:47:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 11:47:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 445. [2019-09-08 11:47:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-09-08 11:47:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 592 transitions. [2019-09-08 11:47:29,132 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 592 transitions. Word has length 70 [2019-09-08 11:47:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:29,132 INFO L475 AbstractCegarLoop]: Abstraction has 445 states and 592 transitions. [2019-09-08 11:47:29,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:47:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 592 transitions. [2019-09-08 11:47:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:47:29,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:29,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:29,134 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:29,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:29,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1455333677, now seen corresponding path program 1 times [2019-09-08 11:47:29,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:29,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:29,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:29,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:29,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:30,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:30,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:47:30,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:47:30,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:47:30,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:47:30,601 INFO L87 Difference]: Start difference. First operand 445 states and 592 transitions. Second operand 21 states. [2019-09-08 11:47:30,735 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-08 11:47:31,228 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-08 11:47:31,364 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 11:47:31,568 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 11:47:31,770 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-08 11:47:32,050 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-08 11:47:32,269 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-08 11:47:32,458 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-08 11:47:32,685 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-08 11:47:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:34,308 INFO L93 Difference]: Finished difference Result 898 states and 1237 transitions. [2019-09-08 11:47:34,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 11:47:34,309 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 70 [2019-09-08 11:47:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:34,312 INFO L225 Difference]: With dead ends: 898 [2019-09-08 11:47:34,312 INFO L226 Difference]: Without dead ends: 686 [2019-09-08 11:47:34,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=241, Invalid=815, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 11:47:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-09-08 11:47:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 455. [2019-09-08 11:47:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-08 11:47:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 607 transitions. [2019-09-08 11:47:34,384 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 607 transitions. Word has length 70 [2019-09-08 11:47:34,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:34,384 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 607 transitions. [2019-09-08 11:47:34,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:47:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 607 transitions. [2019-09-08 11:47:34,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:47:34,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:34,386 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:34,387 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:34,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:34,387 INFO L82 PathProgramCache]: Analyzing trace with hash -836030750, now seen corresponding path program 1 times [2019-09-08 11:47:34,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:34,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:34,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:34,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:34,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:35,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:35,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:47:35,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:47:35,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:47:35,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:47:35,047 INFO L87 Difference]: Start difference. First operand 455 states and 607 transitions. Second operand 14 states. [2019-09-08 11:47:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:36,879 INFO L93 Difference]: Finished difference Result 1147 states and 1631 transitions. [2019-09-08 11:47:36,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:47:36,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-09-08 11:47:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:36,883 INFO L225 Difference]: With dead ends: 1147 [2019-09-08 11:47:36,883 INFO L226 Difference]: Without dead ends: 873 [2019-09-08 11:47:36,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:47:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2019-09-08 11:47:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 428. [2019-09-08 11:47:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-08 11:47:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 573 transitions. [2019-09-08 11:47:36,974 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 573 transitions. Word has length 70 [2019-09-08 11:47:36,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:36,974 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 573 transitions. [2019-09-08 11:47:36,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:47:36,974 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 573 transitions. [2019-09-08 11:47:36,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:47:36,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:36,976 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:36,976 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:36,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1658652679, now seen corresponding path program 1 times [2019-09-08 11:47:36,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:36,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:36,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:36,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:36,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:37,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:37,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:47:37,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:47:37,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:47:37,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:47:37,767 INFO L87 Difference]: Start difference. First operand 428 states and 573 transitions. Second operand 16 states. [2019-09-08 11:47:38,500 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 11:47:38,629 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 11:47:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:39,858 INFO L93 Difference]: Finished difference Result 1269 states and 1809 transitions. [2019-09-08 11:47:39,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:47:39,858 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2019-09-08 11:47:39,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:39,863 INFO L225 Difference]: With dead ends: 1269 [2019-09-08 11:47:39,863 INFO L226 Difference]: Without dead ends: 1039 [2019-09-08 11:47:39,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:47:39,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2019-09-08 11:47:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 428. [2019-09-08 11:47:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-08 11:47:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 570 transitions. [2019-09-08 11:47:39,949 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 570 transitions. Word has length 71 [2019-09-08 11:47:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:39,949 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 570 transitions. [2019-09-08 11:47:39,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:47:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 570 transitions. [2019-09-08 11:47:39,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:47:39,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:39,950 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:39,951 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:39,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:39,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1627558840, now seen corresponding path program 1 times [2019-09-08 11:47:39,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:39,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:39,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:39,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:39,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:40,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:40,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 11:47:40,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 11:47:40,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 11:47:40,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:47:40,700 INFO L87 Difference]: Start difference. First operand 428 states and 570 transitions. Second operand 15 states. [2019-09-08 11:47:41,260 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-09-08 11:47:41,407 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-09-08 11:47:41,599 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-08 11:47:41,771 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-09-08 11:47:41,944 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-09-08 11:47:42,164 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 11:47:42,404 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-08 11:47:42,656 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-09-08 11:47:43,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:43,283 INFO L93 Difference]: Finished difference Result 1006 states and 1411 transitions. [2019-09-08 11:47:43,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:47:43,284 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 71 [2019-09-08 11:47:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:43,288 INFO L225 Difference]: With dead ends: 1006 [2019-09-08 11:47:43,288 INFO L226 Difference]: Without dead ends: 1002 [2019-09-08 11:47:43,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2019-09-08 11:47:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-09-08 11:47:43,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 424. [2019-09-08 11:47:43,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-08 11:47:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 566 transitions. [2019-09-08 11:47:43,389 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 566 transitions. Word has length 71 [2019-09-08 11:47:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:43,389 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 566 transitions. [2019-09-08 11:47:43,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 11:47:43,389 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 566 transitions. [2019-09-08 11:47:43,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:47:43,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:43,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:43,391 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:43,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:43,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1111539522, now seen corresponding path program 1 times [2019-09-08 11:47:43,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:43,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:43,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:43,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:43,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:43,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:43,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:47:43,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:47:43,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:47:43,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:47:43,538 INFO L87 Difference]: Start difference. First operand 424 states and 566 transitions. Second operand 9 states. [2019-09-08 11:47:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:44,618 INFO L93 Difference]: Finished difference Result 1135 states and 1610 transitions. [2019-09-08 11:47:44,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:47:44,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-08 11:47:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:44,623 INFO L225 Difference]: With dead ends: 1135 [2019-09-08 11:47:44,623 INFO L226 Difference]: Without dead ends: 1128 [2019-09-08 11:47:44,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:47:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-09-08 11:47:44,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 424. [2019-09-08 11:47:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-08 11:47:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 564 transitions. [2019-09-08 11:47:44,701 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 564 transitions. Word has length 71 [2019-09-08 11:47:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:44,701 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 564 transitions. [2019-09-08 11:47:44,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:47:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 564 transitions. [2019-09-08 11:47:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:47:44,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:44,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:44,703 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:44,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:44,703 INFO L82 PathProgramCache]: Analyzing trace with hash 843086847, now seen corresponding path program 1 times [2019-09-08 11:47:44,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:44,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:44,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:44,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:44,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:44,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:44,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:47:44,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:47:44,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:47:44,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:47:44,815 INFO L87 Difference]: Start difference. First operand 424 states and 564 transitions. Second operand 9 states. [2019-09-08 11:47:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:45,886 INFO L93 Difference]: Finished difference Result 1362 states and 1948 transitions. [2019-09-08 11:47:45,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:47:45,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-08 11:47:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:45,890 INFO L225 Difference]: With dead ends: 1362 [2019-09-08 11:47:45,890 INFO L226 Difference]: Without dead ends: 1110 [2019-09-08 11:47:45,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:47:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-09-08 11:47:45,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 424. [2019-09-08 11:47:45,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-08 11:47:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 560 transitions. [2019-09-08 11:47:45,991 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 560 transitions. Word has length 71 [2019-09-08 11:47:45,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:45,991 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 560 transitions. [2019-09-08 11:47:45,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:47:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 560 transitions. [2019-09-08 11:47:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:47:45,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:45,993 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:45,993 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:45,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1610747723, now seen corresponding path program 1 times [2019-09-08 11:47:45,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:45,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:45,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:45,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:45,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:46,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:46,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:47:46,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:47:46,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:47:46,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:47:46,397 INFO L87 Difference]: Start difference. First operand 424 states and 560 transitions. Second operand 12 states. [2019-09-08 11:47:47,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:47,933 INFO L93 Difference]: Finished difference Result 1810 states and 2615 transitions. [2019-09-08 11:47:47,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:47:47,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-08 11:47:47,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:47,939 INFO L225 Difference]: With dead ends: 1810 [2019-09-08 11:47:47,939 INFO L226 Difference]: Without dead ends: 1582 [2019-09-08 11:47:47,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:47:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2019-09-08 11:47:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 392. [2019-09-08 11:47:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-08 11:47:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 522 transitions. [2019-09-08 11:47:48,033 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 522 transitions. Word has length 71 [2019-09-08 11:47:48,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:48,034 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 522 transitions. [2019-09-08 11:47:48,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:47:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 522 transitions. [2019-09-08 11:47:48,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:47:48,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:48,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:48,035 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1217335281, now seen corresponding path program 1 times [2019-09-08 11:47:48,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:48,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:48,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:48,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:48,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:47:48,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:47:48,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:47:48,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:47:48,581 INFO L87 Difference]: Start difference. First operand 392 states and 522 transitions. Second operand 12 states. [2019-09-08 11:47:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:50,101 INFO L93 Difference]: Finished difference Result 2340 states and 3460 transitions. [2019-09-08 11:47:50,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:47:50,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-08 11:47:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:50,109 INFO L225 Difference]: With dead ends: 2340 [2019-09-08 11:47:50,109 INFO L226 Difference]: Without dead ends: 2117 [2019-09-08 11:47:50,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:47:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2019-09-08 11:47:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 377. [2019-09-08 11:47:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-09-08 11:47:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 503 transitions. [2019-09-08 11:47:50,220 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 503 transitions. Word has length 71 [2019-09-08 11:47:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:50,220 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 503 transitions. [2019-09-08 11:47:50,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:47:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 503 transitions. [2019-09-08 11:47:50,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:47:50,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:50,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:50,222 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1510879078, now seen corresponding path program 1 times [2019-09-08 11:47:50,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:50,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:50,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:50,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:50,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:50,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:50,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:47:50,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:47:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:47:50,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:47:50,670 INFO L87 Difference]: Start difference. First operand 377 states and 503 transitions. Second operand 12 states. [2019-09-08 11:47:51,157 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 11:47:51,313 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 11:47:51,531 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-08 11:47:51,760 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-09-08 11:47:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:52,023 INFO L93 Difference]: Finished difference Result 869 states and 1218 transitions. [2019-09-08 11:47:52,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:47:52,023 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-08 11:47:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:52,025 INFO L225 Difference]: With dead ends: 869 [2019-09-08 11:47:52,026 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 11:47:52,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:47:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 11:47:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 373. [2019-09-08 11:47:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-08 11:47:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 498 transitions. [2019-09-08 11:47:52,107 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 498 transitions. Word has length 71 [2019-09-08 11:47:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:52,108 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 498 transitions. [2019-09-08 11:47:52,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:47:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 498 transitions. [2019-09-08 11:47:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:47:52,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:52,109 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:52,109 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:52,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1268048671, now seen corresponding path program 1 times [2019-09-08 11:47:52,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:52,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:52,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:52,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:52,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:52,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:52,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:47:52,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:47:52,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:47:52,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:47:52,216 INFO L87 Difference]: Start difference. First operand 373 states and 498 transitions. Second operand 9 states. [2019-09-08 11:47:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:52,917 INFO L93 Difference]: Finished difference Result 656 states and 895 transitions. [2019-09-08 11:47:52,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 11:47:52,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 11:47:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:52,919 INFO L225 Difference]: With dead ends: 656 [2019-09-08 11:47:52,919 INFO L226 Difference]: Without dead ends: 649 [2019-09-08 11:47:52,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:47:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-09-08 11:47:53,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 373. [2019-09-08 11:47:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-08 11:47:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 497 transitions. [2019-09-08 11:47:53,012 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 497 transitions. Word has length 72 [2019-09-08 11:47:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:53,012 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 497 transitions. [2019-09-08 11:47:53,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:47:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 497 transitions. [2019-09-08 11:47:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:47:53,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:53,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:53,014 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:53,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:53,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1461520139, now seen corresponding path program 1 times [2019-09-08 11:47:53,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:53,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:53,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:53,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:53,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:53,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:53,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:47:53,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:47:53,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:47:53,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:47:53,134 INFO L87 Difference]: Start difference. First operand 373 states and 497 transitions. Second operand 9 states. [2019-09-08 11:47:53,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:47:53,927 INFO L93 Difference]: Finished difference Result 656 states and 894 transitions. [2019-09-08 11:47:53,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:47:53,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 11:47:53,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:47:53,929 INFO L225 Difference]: With dead ends: 656 [2019-09-08 11:47:53,929 INFO L226 Difference]: Without dead ends: 649 [2019-09-08 11:47:53,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:47:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-09-08 11:47:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 373. [2019-09-08 11:47:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-08 11:47:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 496 transitions. [2019-09-08 11:47:54,013 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 496 transitions. Word has length 72 [2019-09-08 11:47:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:47:54,013 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 496 transitions. [2019-09-08 11:47:54,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:47:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 496 transitions. [2019-09-08 11:47:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:47:54,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:47:54,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:47:54,014 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:47:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:47:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1549803195, now seen corresponding path program 1 times [2019-09-08 11:47:54,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:47:54,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:47:54,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:54,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:47:54,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:47:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:47:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:47:54,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:47:54,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 11:47:54,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 11:47:54,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 11:47:54,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:47:54,754 INFO L87 Difference]: Start difference. First operand 373 states and 496 transitions. Second operand 23 states. [2019-09-08 11:47:54,998 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-08 11:47:55,413 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-08 11:47:55,544 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-08 11:47:55,676 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-09-08 11:47:55,903 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 11:47:56,092 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 11:47:56,315 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-08 11:47:56,526 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-08 11:47:56,700 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-08 11:47:57,514 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-08 11:47:59,166 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-08 11:48:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:00,461 INFO L93 Difference]: Finished difference Result 2733 states and 4056 transitions. [2019-09-08 11:48:00,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 11:48:00,461 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2019-09-08 11:48:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:00,467 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 11:48:00,467 INFO L226 Difference]: Without dead ends: 2727 [2019-09-08 11:48:00,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=391, Invalid=1865, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 11:48:00,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2019-09-08 11:48:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 384. [2019-09-08 11:48:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-08 11:48:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 510 transitions. [2019-09-08 11:48:00,587 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 510 transitions. Word has length 73 [2019-09-08 11:48:00,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:00,587 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 510 transitions. [2019-09-08 11:48:00,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 11:48:00,587 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 510 transitions. [2019-09-08 11:48:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:48:00,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:00,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:00,588 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:00,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:00,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1572662879, now seen corresponding path program 1 times [2019-09-08 11:48:00,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:00,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:00,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:00,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:00,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:01,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:01,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:48:01,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:48:01,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:48:01,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:48:01,373 INFO L87 Difference]: Start difference. First operand 384 states and 510 transitions. Second operand 16 states. [2019-09-08 11:48:02,101 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 11:48:02,236 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 11:48:02,363 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 11:48:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:04,392 INFO L93 Difference]: Finished difference Result 1841 states and 2676 transitions. [2019-09-08 11:48:04,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:48:04,397 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-09-08 11:48:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:04,400 INFO L225 Difference]: With dead ends: 1841 [2019-09-08 11:48:04,400 INFO L226 Difference]: Without dead ends: 1835 [2019-09-08 11:48:04,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2019-09-08 11:48:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-09-08 11:48:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 373. [2019-09-08 11:48:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-08 11:48:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 495 transitions. [2019-09-08 11:48:04,503 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 495 transitions. Word has length 74 [2019-09-08 11:48:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:04,504 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 495 transitions. [2019-09-08 11:48:04,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:48:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 495 transitions. [2019-09-08 11:48:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:48:04,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:04,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:04,505 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:04,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1304108329, now seen corresponding path program 1 times [2019-09-08 11:48:04,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:04,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:04,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:04,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:04,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:48:04,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:48:04,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:48:04,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:48:04,944 INFO L87 Difference]: Start difference. First operand 373 states and 495 transitions. Second operand 13 states. [2019-09-08 11:48:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:06,171 INFO L93 Difference]: Finished difference Result 847 states and 1193 transitions. [2019-09-08 11:48:06,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:48:06,171 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2019-09-08 11:48:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:06,173 INFO L225 Difference]: With dead ends: 847 [2019-09-08 11:48:06,173 INFO L226 Difference]: Without dead ends: 829 [2019-09-08 11:48:06,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:48:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-09-08 11:48:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 355. [2019-09-08 11:48:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-08 11:48:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 475 transitions. [2019-09-08 11:48:06,336 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 475 transitions. Word has length 74 [2019-09-08 11:48:06,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:06,337 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 475 transitions. [2019-09-08 11:48:06,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:48:06,337 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 475 transitions. [2019-09-08 11:48:06,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:48:06,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:06,338 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:06,339 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:06,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:06,339 INFO L82 PathProgramCache]: Analyzing trace with hash 988299827, now seen corresponding path program 1 times [2019-09-08 11:48:06,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:06,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:06,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:06,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:06,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:48:06,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:48:06,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:48:06,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:48:06,751 INFO L87 Difference]: Start difference. First operand 355 states and 475 transitions. Second operand 12 states. [2019-09-08 11:48:07,240 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 11:48:07,398 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-08 11:48:07,591 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-08 11:48:07,773 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-09-08 11:48:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:08,332 INFO L93 Difference]: Finished difference Result 1057 states and 1509 transitions. [2019-09-08 11:48:08,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:48:08,332 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-08 11:48:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:08,334 INFO L225 Difference]: With dead ends: 1057 [2019-09-08 11:48:08,335 INFO L226 Difference]: Without dead ends: 1051 [2019-09-08 11:48:08,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:48:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-09-08 11:48:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 349. [2019-09-08 11:48:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-08 11:48:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 469 transitions. [2019-09-08 11:48:08,494 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 469 transitions. Word has length 74 [2019-09-08 11:48:08,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:08,496 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 469 transitions. [2019-09-08 11:48:08,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:48:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 469 transitions. [2019-09-08 11:48:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:48:08,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:08,497 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:08,498 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:08,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:08,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1612741772, now seen corresponding path program 1 times [2019-09-08 11:48:08,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:08,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:08,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:08,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:08,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:10,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:10,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 11:48:10,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 11:48:10,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 11:48:10,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:48:10,091 INFO L87 Difference]: Start difference. First operand 349 states and 469 transitions. Second operand 23 states. [2019-09-08 11:48:10,248 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 11:48:10,768 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 11:48:10,945 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-08 11:48:11,194 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-08 11:48:11,498 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-08 11:48:11,803 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-08 11:48:12,172 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-08 11:48:12,475 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 11:48:12,760 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 11:48:13,043 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-08 11:48:13,399 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-08 11:48:13,643 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 11:48:13,917 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 11:48:14,209 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-08 11:48:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:15,690 INFO L93 Difference]: Finished difference Result 587 states and 814 transitions. [2019-09-08 11:48:15,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:48:15,691 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2019-09-08 11:48:15,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:15,692 INFO L225 Difference]: With dead ends: 587 [2019-09-08 11:48:15,692 INFO L226 Difference]: Without dead ends: 579 [2019-09-08 11:48:15,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=363, Invalid=1277, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 11:48:15,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-08 11:48:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 354. [2019-09-08 11:48:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-08 11:48:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 474 transitions. [2019-09-08 11:48:15,841 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 474 transitions. Word has length 74 [2019-09-08 11:48:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:15,841 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 474 transitions. [2019-09-08 11:48:15,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 11:48:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 474 transitions. [2019-09-08 11:48:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:48:15,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:15,843 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:15,843 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:15,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:15,843 INFO L82 PathProgramCache]: Analyzing trace with hash -688715173, now seen corresponding path program 1 times [2019-09-08 11:48:15,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:15,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:15,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:15,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:15,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:16,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:16,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:48:16,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:48:16,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:48:16,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:48:16,317 INFO L87 Difference]: Start difference. First operand 354 states and 474 transitions. Second operand 11 states. [2019-09-08 11:48:16,962 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 11:48:17,131 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 11:48:17,372 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-09-08 11:48:17,518 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-09-08 11:48:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:18,553 INFO L93 Difference]: Finished difference Result 1244 states and 1826 transitions. [2019-09-08 11:48:18,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:48:18,553 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-09-08 11:48:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:18,556 INFO L225 Difference]: With dead ends: 1244 [2019-09-08 11:48:18,556 INFO L226 Difference]: Without dead ends: 1215 [2019-09-08 11:48:18,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:48:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-09-08 11:48:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 325. [2019-09-08 11:48:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-08 11:48:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 443 transitions. [2019-09-08 11:48:18,736 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 443 transitions. Word has length 75 [2019-09-08 11:48:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:18,736 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 443 transitions. [2019-09-08 11:48:18,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:48:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 443 transitions. [2019-09-08 11:48:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 11:48:18,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:18,738 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:18,738 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:18,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1982800984, now seen corresponding path program 1 times [2019-09-08 11:48:18,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:18,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:18,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:18,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:18,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:18,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:18,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:48:18,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:48:18,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:48:18,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:48:18,796 INFO L87 Difference]: Start difference. First operand 325 states and 443 transitions. Second operand 3 states. [2019-09-08 11:48:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:19,056 INFO L93 Difference]: Finished difference Result 725 states and 1045 transitions. [2019-09-08 11:48:19,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:48:19,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-08 11:48:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:19,060 INFO L225 Difference]: With dead ends: 725 [2019-09-08 11:48:19,060 INFO L226 Difference]: Without dead ends: 517 [2019-09-08 11:48:19,061 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 11:48:19,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-08 11:48:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 515. [2019-09-08 11:48:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-09-08 11:48:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 723 transitions. [2019-09-08 11:48:19,361 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 723 transitions. Word has length 96 [2019-09-08 11:48:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:19,361 INFO L475 AbstractCegarLoop]: Abstraction has 515 states and 723 transitions. [2019-09-08 11:48:19,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:48:19,362 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 723 transitions. [2019-09-08 11:48:19,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:48:19,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:19,363 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:19,363 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:19,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:19,363 INFO L82 PathProgramCache]: Analyzing trace with hash -76698584, now seen corresponding path program 1 times [2019-09-08 11:48:19,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:19,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:19,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:19,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:19,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:19,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:19,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:48:19,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:48:19,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:48:19,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:48:19,425 INFO L87 Difference]: Start difference. First operand 515 states and 723 transitions. Second operand 5 states. [2019-09-08 11:48:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:20,538 INFO L93 Difference]: Finished difference Result 2419 states and 3551 transitions. [2019-09-08 11:48:20,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:48:20,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 11:48:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:20,542 INFO L225 Difference]: With dead ends: 2419 [2019-09-08 11:48:20,542 INFO L226 Difference]: Without dead ends: 2021 [2019-09-08 11:48:20,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:48:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2019-09-08 11:48:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 951. [2019-09-08 11:48:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-09-08 11:48:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1359 transitions. [2019-09-08 11:48:21,009 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1359 transitions. Word has length 98 [2019-09-08 11:48:21,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:21,009 INFO L475 AbstractCegarLoop]: Abstraction has 951 states and 1359 transitions. [2019-09-08 11:48:21,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:48:21,009 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1359 transitions. [2019-09-08 11:48:21,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:48:21,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:21,011 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:21,012 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:21,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:21,012 INFO L82 PathProgramCache]: Analyzing trace with hash 506415028, now seen corresponding path program 1 times [2019-09-08 11:48:21,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:21,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:21,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:21,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:21,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:21,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:21,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:48:21,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:48:21,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:48:21,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:48:21,075 INFO L87 Difference]: Start difference. First operand 951 states and 1359 transitions. Second operand 5 states. [2019-09-08 11:48:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:22,678 INFO L93 Difference]: Finished difference Result 4255 states and 6195 transitions. [2019-09-08 11:48:22,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:48:22,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 11:48:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:22,683 INFO L225 Difference]: With dead ends: 4255 [2019-09-08 11:48:22,683 INFO L226 Difference]: Without dead ends: 3421 [2019-09-08 11:48:22,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:48:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2019-09-08 11:48:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 1847. [2019-09-08 11:48:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2019-09-08 11:48:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2655 transitions. [2019-09-08 11:48:23,441 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2655 transitions. Word has length 98 [2019-09-08 11:48:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:23,442 INFO L475 AbstractCegarLoop]: Abstraction has 1847 states and 2655 transitions. [2019-09-08 11:48:23,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:48:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2655 transitions. [2019-09-08 11:48:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:48:23,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:23,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:23,445 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:23,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1917954603, now seen corresponding path program 1 times [2019-09-08 11:48:23,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:23,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:23,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:23,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:23,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:23,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:23,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:48:23,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:48:23,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:48:23,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:48:23,505 INFO L87 Difference]: Start difference. First operand 1847 states and 2655 transitions. Second operand 3 states. [2019-09-08 11:48:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:24,599 INFO L93 Difference]: Finished difference Result 4475 states and 6505 transitions. [2019-09-08 11:48:24,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:48:24,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 11:48:24,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:24,603 INFO L225 Difference]: With dead ends: 4475 [2019-09-08 11:48:24,603 INFO L226 Difference]: Without dead ends: 2745 [2019-09-08 11:48:24,607 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 11:48:24,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-09-08 11:48:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2743. [2019-09-08 11:48:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2743 states. [2019-09-08 11:48:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 3943 transitions. [2019-09-08 11:48:25,772 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 3943 transitions. Word has length 98 [2019-09-08 11:48:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:25,772 INFO L475 AbstractCegarLoop]: Abstraction has 2743 states and 3943 transitions. [2019-09-08 11:48:25,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:48:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 3943 transitions. [2019-09-08 11:48:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:48:25,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:25,774 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:25,774 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:25,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1207766954, now seen corresponding path program 1 times [2019-09-08 11:48:25,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:25,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:25,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:25,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:25,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:25,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:48:25,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:48:25,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:48:25,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:48:25,826 INFO L87 Difference]: Start difference. First operand 2743 states and 3943 transitions. Second operand 3 states. [2019-09-08 11:48:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:27,502 INFO L93 Difference]: Finished difference Result 6707 states and 9653 transitions. [2019-09-08 11:48:27,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:48:27,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 11:48:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:27,509 INFO L225 Difference]: With dead ends: 6707 [2019-09-08 11:48:27,509 INFO L226 Difference]: Without dead ends: 4081 [2019-09-08 11:48:27,512 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 11:48:27,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2019-09-08 11:48:29,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 4031. [2019-09-08 11:48:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-09-08 11:48:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 5715 transitions. [2019-09-08 11:48:29,176 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 5715 transitions. Word has length 98 [2019-09-08 11:48:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:29,176 INFO L475 AbstractCegarLoop]: Abstraction has 4031 states and 5715 transitions. [2019-09-08 11:48:29,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:48:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 5715 transitions. [2019-09-08 11:48:29,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:48:29,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:29,178 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:29,179 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:29,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1496995374, now seen corresponding path program 1 times [2019-09-08 11:48:29,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:29,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:29,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:29,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:29,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:29,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:29,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:48:29,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:48:29,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:48:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:48:29,236 INFO L87 Difference]: Start difference. First operand 4031 states and 5715 transitions. Second operand 5 states. [2019-09-08 11:48:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:35,026 INFO L93 Difference]: Finished difference Result 17035 states and 24175 transitions. [2019-09-08 11:48:35,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:48:35,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 11:48:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:35,038 INFO L225 Difference]: With dead ends: 17035 [2019-09-08 11:48:35,038 INFO L226 Difference]: Without dead ends: 13121 [2019-09-08 11:48:35,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:48:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13121 states. [2019-09-08 11:48:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13121 to 8231. [2019-09-08 11:48:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8231 states. [2019-09-08 11:48:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8231 states to 8231 states and 11591 transitions. [2019-09-08 11:48:38,494 INFO L78 Accepts]: Start accepts. Automaton has 8231 states and 11591 transitions. Word has length 98 [2019-09-08 11:48:38,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:38,495 INFO L475 AbstractCegarLoop]: Abstraction has 8231 states and 11591 transitions. [2019-09-08 11:48:38,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:48:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 8231 states and 11591 transitions. [2019-09-08 11:48:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:48:38,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:38,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:38,498 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:38,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:38,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1555516846, now seen corresponding path program 1 times [2019-09-08 11:48:38,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:38,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:38,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:38,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:38,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:38,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:38,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:48:38,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:48:38,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:48:38,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:48:38,548 INFO L87 Difference]: Start difference. First operand 8231 states and 11591 transitions. Second operand 3 states. [2019-09-08 11:48:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:42,388 INFO L93 Difference]: Finished difference Result 17179 states and 24217 transitions. [2019-09-08 11:48:42,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:48:42,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:48:42,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:42,398 INFO L225 Difference]: With dead ends: 17179 [2019-09-08 11:48:42,398 INFO L226 Difference]: Without dead ends: 9065 [2019-09-08 11:48:42,408 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 11:48:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9065 states. [2019-09-08 11:48:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 8967. [2019-09-08 11:48:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8967 states. [2019-09-08 11:48:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8967 states to 8967 states and 12543 transitions. [2019-09-08 11:48:46,172 INFO L78 Accepts]: Start accepts. Automaton has 8967 states and 12543 transitions. Word has length 99 [2019-09-08 11:48:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:46,173 INFO L475 AbstractCegarLoop]: Abstraction has 8967 states and 12543 transitions. [2019-09-08 11:48:46,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:48:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 8967 states and 12543 transitions. [2019-09-08 11:48:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:48:46,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:46,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:46,176 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:46,176 INFO L82 PathProgramCache]: Analyzing trace with hash 143060042, now seen corresponding path program 1 times [2019-09-08 11:48:46,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:46,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:46,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:46,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:46,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:46,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:46,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:48:46,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:48:46,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:48:46,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:48:46,229 INFO L87 Difference]: Start difference. First operand 8967 states and 12543 transitions. Second operand 5 states. [2019-09-08 11:48:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:48:55,067 INFO L93 Difference]: Finished difference Result 27759 states and 38595 transitions. [2019-09-08 11:48:55,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:48:55,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:48:55,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:48:55,085 INFO L225 Difference]: With dead ends: 27759 [2019-09-08 11:48:55,085 INFO L226 Difference]: Without dead ends: 18909 [2019-09-08 11:48:55,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:48:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18909 states. [2019-09-08 11:48:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18909 to 11031. [2019-09-08 11:48:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11031 states. [2019-09-08 11:48:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11031 states to 11031 states and 15183 transitions. [2019-09-08 11:48:59,747 INFO L78 Accepts]: Start accepts. Automaton has 11031 states and 15183 transitions. Word has length 99 [2019-09-08 11:48:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:48:59,747 INFO L475 AbstractCegarLoop]: Abstraction has 11031 states and 15183 transitions. [2019-09-08 11:48:59,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:48:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11031 states and 15183 transitions. [2019-09-08 11:48:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:48:59,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:48:59,750 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:48:59,750 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:48:59,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:48:59,751 INFO L82 PathProgramCache]: Analyzing trace with hash -732117008, now seen corresponding path program 1 times [2019-09-08 11:48:59,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:48:59,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:48:59,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:59,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:48:59,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:48:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:48:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:48:59,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:48:59,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:48:59,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:48:59,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:48:59,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:48:59,835 INFO L87 Difference]: Start difference. First operand 11031 states and 15183 transitions. Second operand 6 states. [2019-09-08 11:49:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:07,942 INFO L93 Difference]: Finished difference Result 17591 states and 23732 transitions. [2019-09-08 11:49:07,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:49:07,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-08 11:49:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:07,957 INFO L225 Difference]: With dead ends: 17591 [2019-09-08 11:49:07,957 INFO L226 Difference]: Without dead ends: 17589 [2019-09-08 11:49:07,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17589 states. [2019-09-08 11:49:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17589 to 11223. [2019-09-08 11:49:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11223 states. [2019-09-08 11:49:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11223 states to 11223 states and 15311 transitions. [2019-09-08 11:49:13,036 INFO L78 Accepts]: Start accepts. Automaton has 11223 states and 15311 transitions. Word has length 99 [2019-09-08 11:49:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:13,036 INFO L475 AbstractCegarLoop]: Abstraction has 11223 states and 15311 transitions. [2019-09-08 11:49:13,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:49:13,036 INFO L276 IsEmpty]: Start isEmpty. Operand 11223 states and 15311 transitions. [2019-09-08 11:49:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:49:13,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:13,039 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:49:13,039 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:13,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:13,040 INFO L82 PathProgramCache]: Analyzing trace with hash -589488884, now seen corresponding path program 1 times [2019-09-08 11:49:13,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:13,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:13,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:13,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:13,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:49:13,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:13,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:49:13,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:49:13,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:49:13,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:49:13,094 INFO L87 Difference]: Start difference. First operand 11223 states and 15311 transitions. Second operand 3 states. [2019-09-08 11:49:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:18,048 INFO L93 Difference]: Finished difference Result 21691 states and 29537 transitions. [2019-09-08 11:49:18,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:49:18,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 11:49:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:18,060 INFO L225 Difference]: With dead ends: 21691 [2019-09-08 11:49:18,060 INFO L226 Difference]: Without dead ends: 10585 [2019-09-08 11:49:18,073 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 11:49:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10585 states. [2019-09-08 11:49:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10585 to 8047. [2019-09-08 11:49:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8047 states. [2019-09-08 11:49:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8047 states to 8047 states and 10755 transitions. [2019-09-08 11:49:21,812 INFO L78 Accepts]: Start accepts. Automaton has 8047 states and 10755 transitions. Word has length 100 [2019-09-08 11:49:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:21,812 INFO L475 AbstractCegarLoop]: Abstraction has 8047 states and 10755 transitions. [2019-09-08 11:49:21,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:49:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 8047 states and 10755 transitions. [2019-09-08 11:49:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:49:21,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:21,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:49:21,814 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:21,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:21,814 INFO L82 PathProgramCache]: Analyzing trace with hash 446049293, now seen corresponding path program 1 times [2019-09-08 11:49:21,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:21,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:21,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:21,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:21,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:49:21,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:21,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:49:21,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:49:21,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:49:21,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:49:21,867 INFO L87 Difference]: Start difference. First operand 8047 states and 10755 transitions. Second operand 3 states. [2019-09-08 11:49:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:25,482 INFO L93 Difference]: Finished difference Result 15499 states and 20689 transitions. [2019-09-08 11:49:25,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:49:25,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 11:49:25,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:25,489 INFO L225 Difference]: With dead ends: 15499 [2019-09-08 11:49:25,490 INFO L226 Difference]: Without dead ends: 7569 [2019-09-08 11:49:25,497 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 11:49:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7569 states. [2019-09-08 11:49:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7569 to 7015. [2019-09-08 11:49:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7015 states. [2019-09-08 11:49:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7015 states to 7015 states and 9279 transitions. [2019-09-08 11:49:28,641 INFO L78 Accepts]: Start accepts. Automaton has 7015 states and 9279 transitions. Word has length 101 [2019-09-08 11:49:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:28,641 INFO L475 AbstractCegarLoop]: Abstraction has 7015 states and 9279 transitions. [2019-09-08 11:49:28,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:49:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 7015 states and 9279 transitions. [2019-09-08 11:49:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 11:49:28,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:28,644 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:49:28,644 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:28,645 INFO L82 PathProgramCache]: Analyzing trace with hash -385409352, now seen corresponding path program 1 times [2019-09-08 11:49:28,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:28,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:28,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:28,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:28,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:49:28,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:28,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:49:28,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:49:28,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:49:28,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:49:28,706 INFO L87 Difference]: Start difference. First operand 7015 states and 9279 transitions. Second operand 3 states. [2019-09-08 11:49:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:31,514 INFO L93 Difference]: Finished difference Result 12569 states and 16517 transitions. [2019-09-08 11:49:31,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:49:31,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-08 11:49:31,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:31,519 INFO L225 Difference]: With dead ends: 12569 [2019-09-08 11:49:31,519 INFO L226 Difference]: Without dead ends: 5671 [2019-09-08 11:49:31,526 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 11:49:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5671 states. [2019-09-08 11:49:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5671 to 5589. [2019-09-08 11:49:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5589 states. [2019-09-08 11:49:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5589 states to 5589 states and 7115 transitions. [2019-09-08 11:49:34,086 INFO L78 Accepts]: Start accepts. Automaton has 5589 states and 7115 transitions. Word has length 125 [2019-09-08 11:49:34,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:34,087 INFO L475 AbstractCegarLoop]: Abstraction has 5589 states and 7115 transitions. [2019-09-08 11:49:34,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:49:34,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5589 states and 7115 transitions. [2019-09-08 11:49:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:49:34,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:34,089 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:49:34,089 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:34,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:34,090 INFO L82 PathProgramCache]: Analyzing trace with hash 474885696, now seen corresponding path program 1 times [2019-09-08 11:49:34,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:34,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:34,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:34,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:34,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 11:49:34,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:34,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:49:34,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:49:34,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:49:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:49:34,209 INFO L87 Difference]: Start difference. First operand 5589 states and 7115 transitions. Second operand 6 states. [2019-09-08 11:49:44,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:44,913 INFO L93 Difference]: Finished difference Result 27865 states and 35406 transitions. [2019-09-08 11:49:44,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:49:44,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-08 11:49:44,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:44,933 INFO L225 Difference]: With dead ends: 27865 [2019-09-08 11:49:44,933 INFO L226 Difference]: Without dead ends: 22393 [2019-09-08 11:49:44,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:49:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22393 states. [2019-09-08 11:49:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22393 to 9621. [2019-09-08 11:49:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9621 states. [2019-09-08 11:49:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9621 states to 9621 states and 12179 transitions. [2019-09-08 11:49:49,634 INFO L78 Accepts]: Start accepts. Automaton has 9621 states and 12179 transitions. Word has length 126 [2019-09-08 11:49:49,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:49:49,635 INFO L475 AbstractCegarLoop]: Abstraction has 9621 states and 12179 transitions. [2019-09-08 11:49:49,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:49:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 9621 states and 12179 transitions. [2019-09-08 11:49:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 11:49:49,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:49:49,637 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:49:49,637 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:49:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:49:49,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1057999308, now seen corresponding path program 1 times [2019-09-08 11:49:49,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:49:49,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:49:49,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:49,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:49:49,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:49:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:49:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:49:49,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:49:49,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:49:49,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:49:49,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:49:49,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:49:49,696 INFO L87 Difference]: Start difference. First operand 9621 states and 12179 transitions. Second operand 3 states. [2019-09-08 11:49:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:49:55,537 INFO L93 Difference]: Finished difference Result 21529 states and 27341 transitions. [2019-09-08 11:49:55,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:49:55,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-08 11:49:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:49:55,549 INFO L225 Difference]: With dead ends: 21529 [2019-09-08 11:49:55,549 INFO L226 Difference]: Without dead ends: 12025 [2019-09-08 11:49:55,560 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 11:49:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12025 states. [2019-09-08 11:50:01,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12025 to 11855. [2019-09-08 11:50:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11855 states. [2019-09-08 11:50:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11855 states to 11855 states and 15007 transitions. [2019-09-08 11:50:01,365 INFO L78 Accepts]: Start accepts. Automaton has 11855 states and 15007 transitions. Word has length 126 [2019-09-08 11:50:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:01,366 INFO L475 AbstractCegarLoop]: Abstraction has 11855 states and 15007 transitions. [2019-09-08 11:50:01,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:50:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 11855 states and 15007 transitions. [2019-09-08 11:50:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 11:50:01,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:01,369 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:01,369 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:01,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:01,369 INFO L82 PathProgramCache]: Analyzing trace with hash -396378024, now seen corresponding path program 1 times [2019-09-08 11:50:01,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:01,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:01,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:01,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:01,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:01,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:01,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:50:01,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:50:01,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:50:01,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:50:01,429 INFO L87 Difference]: Start difference. First operand 11855 states and 15007 transitions. Second operand 3 states. [2019-09-08 11:50:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:11,110 INFO L93 Difference]: Finished difference Result 29955 states and 37785 transitions. [2019-09-08 11:50:11,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:50:11,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-08 11:50:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:11,127 INFO L225 Difference]: With dead ends: 29955 [2019-09-08 11:50:11,128 INFO L226 Difference]: Without dead ends: 18217 [2019-09-08 11:50:11,136 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 11:50:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18217 states. [2019-09-08 11:50:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18217 to 16935. [2019-09-08 11:50:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16935 states. [2019-09-08 11:50:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16935 states to 16935 states and 21151 transitions. [2019-09-08 11:50:19,555 INFO L78 Accepts]: Start accepts. Automaton has 16935 states and 21151 transitions. Word has length 127 [2019-09-08 11:50:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:19,556 INFO L475 AbstractCegarLoop]: Abstraction has 16935 states and 21151 transitions. [2019-09-08 11:50:19,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:50:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 16935 states and 21151 transitions. [2019-09-08 11:50:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:50:19,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:19,558 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:19,558 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash -827219872, now seen corresponding path program 1 times [2019-09-08 11:50:19,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:19,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:19,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:19,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:19,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 11:50:19,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:19,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:50:19,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:50:19,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:50:19,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:50:19,654 INFO L87 Difference]: Start difference. First operand 16935 states and 21151 transitions. Second operand 6 states. [2019-09-08 11:50:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:36,672 INFO L93 Difference]: Finished difference Result 43519 states and 54459 transitions. [2019-09-08 11:50:36,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:50:36,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-08 11:50:36,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:36,705 INFO L225 Difference]: With dead ends: 43519 [2019-09-08 11:50:36,705 INFO L226 Difference]: Without dead ends: 33837 [2019-09-08 11:50:36,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:50:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33837 states. [2019-09-08 11:50:55,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33837 to 33639. [2019-09-08 11:50:55,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33639 states. [2019-09-08 11:50:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33639 states to 33639 states and 42039 transitions. [2019-09-08 11:50:55,544 INFO L78 Accepts]: Start accepts. Automaton has 33639 states and 42039 transitions. Word has length 128 [2019-09-08 11:50:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:55,544 INFO L475 AbstractCegarLoop]: Abstraction has 33639 states and 42039 transitions. [2019-09-08 11:50:55,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:50:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 33639 states and 42039 transitions. [2019-09-08 11:50:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:50:55,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:55,548 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:55,548 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:55,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:55,548 INFO L82 PathProgramCache]: Analyzing trace with hash 163360474, now seen corresponding path program 1 times [2019-09-08 11:50:55,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:55,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:55,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:55,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 11:50:55,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:55,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:50:55,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:50:55,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:50:55,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:50:55,697 INFO L87 Difference]: Start difference. First operand 33639 states and 42039 transitions. Second operand 6 states. [2019-09-08 11:51:33,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:33,625 INFO L93 Difference]: Finished difference Result 99833 states and 124952 transitions. [2019-09-08 11:51:33,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:51:33,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-08 11:51:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:33,709 INFO L225 Difference]: With dead ends: 99833 [2019-09-08 11:51:33,709 INFO L226 Difference]: Without dead ends: 73447 [2019-09-08 11:51:33,742 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 11:51:33,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73447 states. [2019-09-08 11:51:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73447 to 44279. [2019-09-08 11:51:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44279 states. [2019-09-08 11:51:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44279 states to 44279 states and 55151 transitions. [2019-09-08 11:51:58,268 INFO L78 Accepts]: Start accepts. Automaton has 44279 states and 55151 transitions. Word has length 128 [2019-09-08 11:51:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:58,268 INFO L475 AbstractCegarLoop]: Abstraction has 44279 states and 55151 transitions. [2019-09-08 11:51:58,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:51:58,268 INFO L276 IsEmpty]: Start isEmpty. Operand 44279 states and 55151 transitions. [2019-09-08 11:51:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 11:51:58,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:58,273 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:58,273 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:58,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:58,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1572708942, now seen corresponding path program 1 times [2019-09-08 11:51:58,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:58,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:58,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:58,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:58,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:51:58,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:51:58,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:58,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 11:51:58,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:51:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:51:58,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:51:58,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2019-09-08 11:51:58,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:51:58,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:51:58,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:51:58,915 INFO L87 Difference]: Start difference. First operand 44279 states and 55151 transitions. Second operand 16 states. [2019-09-08 11:52:00,694 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 11:52:01,971 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 11:52:02,354 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-08 11:52:02,935 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 11:52:03,097 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 11:52:03,749 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 11:52:04,170 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-08 11:52:04,482 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 11:52:05,242 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-08 11:52:05,617 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-08 11:52:05,821 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-08 11:52:06,518 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-08 11:52:06,670 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-08 11:52:07,494 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-08 11:52:25,747 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-08 11:52:27,188 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-08 11:52:27,334 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-08 11:52:27,765 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 11:52:27,945 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 11:52:28,296 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 11:52:28,499 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-08 11:52:29,493 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-08 11:52:29,901 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-08 11:55:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:02,152 INFO L93 Difference]: Finished difference Result 344093 states and 423611 transitions. [2019-09-08 11:55:02,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-08 11:55:02,152 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 128 [2019-09-08 11:55:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:03,102 INFO L225 Difference]: With dead ends: 344093 [2019-09-08 11:55:03,103 INFO L226 Difference]: Without dead ends: 299931 [2019-09-08 11:55:03,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4815 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2748, Invalid=9908, Unknown=0, NotChecked=0, Total=12656 [2019-09-08 11:55:03,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299931 states. [2019-09-08 11:56:06,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299931 to 104127. [2019-09-08 11:56:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104127 states. [2019-09-08 11:56:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104127 states to 104127 states and 128915 transitions. [2019-09-08 11:56:06,780 INFO L78 Accepts]: Start accepts. Automaton has 104127 states and 128915 transitions. Word has length 128 [2019-09-08 11:56:06,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:06,781 INFO L475 AbstractCegarLoop]: Abstraction has 104127 states and 128915 transitions. [2019-09-08 11:56:06,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:56:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 104127 states and 128915 transitions. [2019-09-08 11:56:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 11:56:06,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:06,793 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:56:06,794 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:06,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:06,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1152589737, now seen corresponding path program 1 times [2019-09-08 11:56:06,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:06,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:06,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:06,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 11:56:06,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:06,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:56:06,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:56:06,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:56:06,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:56:06,946 INFO L87 Difference]: Start difference. First operand 104127 states and 128915 transitions. Second operand 9 states. [2019-09-08 11:57:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:35,011 INFO L93 Difference]: Finished difference Result 259419 states and 321557 transitions. [2019-09-08 11:57:35,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:57:35,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-08 11:57:35,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:35,295 INFO L225 Difference]: With dead ends: 259419 [2019-09-08 11:57:35,296 INFO L226 Difference]: Without dead ends: 155425 [2019-09-08 11:57:35,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:57:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155425 states. [2019-09-08 11:58:37,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155425 to 104127. [2019-09-08 11:58:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104127 states. [2019-09-08 11:58:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104127 states to 104127 states and 128911 transitions. [2019-09-08 11:58:37,444 INFO L78 Accepts]: Start accepts. Automaton has 104127 states and 128911 transitions. Word has length 130 [2019-09-08 11:58:37,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:37,444 INFO L475 AbstractCegarLoop]: Abstraction has 104127 states and 128911 transitions. [2019-09-08 11:58:37,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:58:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 104127 states and 128911 transitions. [2019-09-08 11:58:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:58:37,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:37,454 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:58:37,454 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:37,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1244488833, now seen corresponding path program 1 times [2019-09-08 11:58:37,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:37,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:37,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:37,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:37,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 11:58:37,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:37,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:58:37,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:58:37,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:58:37,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:58:37,529 INFO L87 Difference]: Start difference. First operand 104127 states and 128911 transitions. Second operand 4 states. [2019-09-08 11:59:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:37,316 INFO L93 Difference]: Finished difference Result 208173 states and 257737 transitions. [2019-09-08 11:59:37,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:59:37,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-09-08 11:59:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:37,522 INFO L225 Difference]: With dead ends: 208173 [2019-09-08 11:59:37,523 INFO L226 Difference]: Without dead ends: 104203 [2019-09-08 11:59:37,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:59:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104203 states.