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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 15:05:12,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 15:05:12,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 15:05:12,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 15:05:12,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 15:05:12,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 15:05:12,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 15:05:12,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 15:05:12,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 15:05:12,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 15:05:12,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 15:05:12,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 15:05:12,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 15:05:12,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 15:05:12,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 15:05:12,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 15:05:12,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 15:05:12,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 15:05:12,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 15:05:12,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 15:05:12,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 15:05:12,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 15:05:12,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 15:05:12,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 15:05:12,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 15:05:12,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 15:05:12,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 15:05:12,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 15:05:12,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 15:05:12,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 15:05:12,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 15:05:12,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 15:05:12,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 15:05:12,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 15:05:12,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 15:05:12,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 15:05:12,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 15:05:12,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 15:05:12,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 15:05:12,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 15:05:12,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 15:05:12,798 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 15:05:12,818 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 15:05:12,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 15:05:12,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 15:05:12,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 15:05:12,821 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 15:05:12,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 15:05:12,822 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 15:05:12,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 15:05:12,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 15:05:12,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 15:05:12,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 15:05:12,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 15:05:12,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 15:05:12,824 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 15:05:12,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 15:05:12,825 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 15:05:12,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 15:05:12,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 15:05:12,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 15:05:12,825 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 15:05:12,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 15:05:12,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 15:05:12,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 15:05:12,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 15:05:12,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 15:05:12,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 15:05:12,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 15:05:12,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 15:05:12,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 15:05:12,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 15:05:12,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 15:05:12,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 15:05:12,907 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 15:05:12,907 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 15:05:12,908 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-02 15:05:12,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8d784d69/3521350e9448453b962d7a7f602ee97f/FLAG27cfd68b5 [2019-10-02 15:05:13,541 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 15:05:13,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-02 15:05:13,556 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8d784d69/3521350e9448453b962d7a7f602ee97f/FLAG27cfd68b5 [2019-10-02 15:05:13,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8d784d69/3521350e9448453b962d7a7f602ee97f [2019-10-02 15:05:13,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 15:05:13,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 15:05:13,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 15:05:13,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 15:05:13,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 15:05:13,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:05:13" (1/1) ... [2019-10-02 15:05:13,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7d090e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:05:13, skipping insertion in model container [2019-10-02 15:05:13,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:05:13" (1/1) ... [2019-10-02 15:05:13,773 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 15:05:13,850 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 15:05:14,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:05:14,510 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 15:05:14,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:05:14,959 INFO L192 MainTranslator]: Completed translation [2019-10-02 15:05:14,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:05:14 WrapperNode [2019-10-02 15:05:14,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 15:05:14,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 15:05:14,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 15:05:14,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 15:05:14,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:05:14" (1/1) ... [2019-10-02 15:05:14,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:05:14" (1/1) ... [2019-10-02 15:05:14,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:05:14" (1/1) ... [2019-10-02 15:05:14,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:05:14" (1/1) ... [2019-10-02 15:05:15,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:05:14" (1/1) ... [2019-10-02 15:05:15,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:05:14" (1/1) ... [2019-10-02 15:05:15,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:05:14" (1/1) ... [2019-10-02 15:05:15,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 15:05:15,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 15:05:15,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 15:05:15,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 15:05:15,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:05:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 15:05:15,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 15:05:15,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 15:05:15,152 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 15:05:15,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 15:05:15,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 15:05:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-02 15:05:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 15:05:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 15:05:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 15:05:15,154 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 15:05:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 15:05:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 15:05:15,155 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 15:05:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 15:05:15,156 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 15:05:15,157 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 15:05:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 15:05:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 15:05:15,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 15:05:16,798 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 15:05:16,799 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 15:05:16,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:05:16 BoogieIcfgContainer [2019-10-02 15:05:16,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 15:05:16,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 15:05:16,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 15:05:16,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 15:05:16,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 03:05:13" (1/3) ... [2019-10-02 15:05:16,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fb5a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:05:16, skipping insertion in model container [2019-10-02 15:05:16,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:05:14" (2/3) ... [2019-10-02 15:05:16,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fb5a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:05:16, skipping insertion in model container [2019-10-02 15:05:16,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:05:16" (3/3) ... [2019-10-02 15:05:16,812 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-02 15:05:16,823 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 15:05:16,832 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-02 15:05:16,852 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-02 15:05:16,909 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 15:05:16,910 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 15:05:16,910 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 15:05:16,911 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 15:05:16,911 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 15:05:16,911 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 15:05:16,911 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 15:05:16,911 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 15:05:16,911 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 15:05:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states. [2019-10-02 15:05:16,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 15:05:16,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:16,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:16,981 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:16,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:16,986 INFO L82 PathProgramCache]: Analyzing trace with hash 598173108, now seen corresponding path program 1 times [2019-10-02 15:05:16,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:16,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:17,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:17,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:17,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:17,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-10-02 15:05:17,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:17,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:05:17,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:05:17,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:05:17,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:05:17,977 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 4 states. [2019-10-02 15:05:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:18,282 INFO L93 Difference]: Finished difference Result 1245 states and 2212 transitions. [2019-10-02 15:05:18,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:05:18,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-02 15:05:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:18,315 INFO L225 Difference]: With dead ends: 1245 [2019-10-02 15:05:18,316 INFO L226 Difference]: Without dead ends: 821 [2019-10-02 15:05:18,327 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:05:18,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-10-02 15:05:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 794. [2019-10-02 15:05:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-10-02 15:05:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1136 transitions. [2019-10-02 15:05:18,452 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1136 transitions. Word has length 154 [2019-10-02 15:05:18,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:18,453 INFO L475 AbstractCegarLoop]: Abstraction has 794 states and 1136 transitions. [2019-10-02 15:05:18,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:05:18,453 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1136 transitions. [2019-10-02 15:05:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 15:05:18,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:18,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:18,460 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:18,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:18,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1172332246, now seen corresponding path program 1 times [2019-10-02 15:05:18,460 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:18,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:18,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:18,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:18,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:05:18,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:05:18,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:05:18,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:18,658 INFO L87 Difference]: Start difference. First operand 794 states and 1136 transitions. Second operand 3 states. [2019-10-02 15:05:18,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:18,741 INFO L93 Difference]: Finished difference Result 2336 states and 3338 transitions. [2019-10-02 15:05:18,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:05:18,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-02 15:05:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:18,753 INFO L225 Difference]: With dead ends: 2336 [2019-10-02 15:05:18,753 INFO L226 Difference]: Without dead ends: 1574 [2019-10-02 15:05:18,756 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2019-10-02 15:05:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 796. [2019-10-02 15:05:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-10-02 15:05:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1138 transitions. [2019-10-02 15:05:18,829 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1138 transitions. Word has length 155 [2019-10-02 15:05:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:18,831 INFO L475 AbstractCegarLoop]: Abstraction has 796 states and 1138 transitions. [2019-10-02 15:05:18,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:05:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1138 transitions. [2019-10-02 15:05:18,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 15:05:18,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:18,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:18,840 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:18,840 INFO L82 PathProgramCache]: Analyzing trace with hash 501625459, now seen corresponding path program 1 times [2019-10-02 15:05:18,841 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:18,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:18,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:18,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:18,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:19,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:19,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:05:19,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:05:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:05:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:19,026 INFO L87 Difference]: Start difference. First operand 796 states and 1138 transitions. Second operand 3 states. [2019-10-02 15:05:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:19,143 INFO L93 Difference]: Finished difference Result 2139 states and 3061 transitions. [2019-10-02 15:05:19,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:05:19,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-02 15:05:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:19,158 INFO L225 Difference]: With dead ends: 2139 [2019-10-02 15:05:19,158 INFO L226 Difference]: Without dead ends: 1540 [2019-10-02 15:05:19,160 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-10-02 15:05:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1513. [2019-10-02 15:05:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-10-02 15:05:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2153 transitions. [2019-10-02 15:05:19,243 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2153 transitions. Word has length 156 [2019-10-02 15:05:19,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:19,244 INFO L475 AbstractCegarLoop]: Abstraction has 1513 states and 2153 transitions. [2019-10-02 15:05:19,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:05:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2153 transitions. [2019-10-02 15:05:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 15:05:19,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:19,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:19,281 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash 104654224, now seen corresponding path program 1 times [2019-10-02 15:05:19,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:19,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:19,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:19,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:19,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:19,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:19,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:05:19,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:05:19,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:05:19,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:05:19,503 INFO L87 Difference]: Start difference. First operand 1513 states and 2153 transitions. Second operand 4 states. [2019-10-02 15:05:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:19,600 INFO L93 Difference]: Finished difference Result 2489 states and 3549 transitions. [2019-10-02 15:05:19,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:05:19,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-02 15:05:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:19,608 INFO L225 Difference]: With dead ends: 2489 [2019-10-02 15:05:19,608 INFO L226 Difference]: Without dead ends: 1161 [2019-10-02 15:05:19,611 INFO L640 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-10-02 15:05:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2019-10-02 15:05:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2019-10-02 15:05:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-10-02 15:05:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1645 transitions. [2019-10-02 15:05:19,663 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1645 transitions. Word has length 156 [2019-10-02 15:05:19,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:19,663 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1645 transitions. [2019-10-02 15:05:19,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:05:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1645 transitions. [2019-10-02 15:05:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 15:05:19,667 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:19,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:19,667 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:19,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1233167963, now seen corresponding path program 1 times [2019-10-02 15:05:19,668 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:19,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:19,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:19,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:19,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:19,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:19,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:05:19,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:05:19,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:05:19,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:19,765 INFO L87 Difference]: Start difference. First operand 1161 states and 1645 transitions. Second operand 3 states. [2019-10-02 15:05:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:19,884 INFO L93 Difference]: Finished difference Result 2522 states and 3657 transitions. [2019-10-02 15:05:19,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:05:19,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-02 15:05:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:19,893 INFO L225 Difference]: With dead ends: 2522 [2019-10-02 15:05:19,894 INFO L226 Difference]: Without dead ends: 1547 [2019-10-02 15:05:19,896 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2019-10-02 15:05:19,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1382. [2019-10-02 15:05:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-10-02 15:05:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2003 transitions. [2019-10-02 15:05:19,989 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2003 transitions. Word has length 158 [2019-10-02 15:05:19,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:19,991 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 2003 transitions. [2019-10-02 15:05:19,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:05:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2003 transitions. [2019-10-02 15:05:19,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 15:05:19,995 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:19,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:19,995 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:19,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:19,996 INFO L82 PathProgramCache]: Analyzing trace with hash -866694497, now seen corresponding path program 1 times [2019-10-02 15:05:19,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:19,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:19,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:19,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:20,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:20,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:20,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:05:20,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:05:20,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:05:20,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:20,137 INFO L87 Difference]: Start difference. First operand 1382 states and 2003 transitions. Second operand 3 states. [2019-10-02 15:05:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:20,297 INFO L93 Difference]: Finished difference Result 3110 states and 4621 transitions. [2019-10-02 15:05:20,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:05:20,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-10-02 15:05:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:20,310 INFO L225 Difference]: With dead ends: 3110 [2019-10-02 15:05:20,311 INFO L226 Difference]: Without dead ends: 1998 [2019-10-02 15:05:20,318 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-10-02 15:05:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1771. [2019-10-02 15:05:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-10-02 15:05:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2632 transitions. [2019-10-02 15:05:20,479 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2632 transitions. Word has length 160 [2019-10-02 15:05:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:20,480 INFO L475 AbstractCegarLoop]: Abstraction has 1771 states and 2632 transitions. [2019-10-02 15:05:20,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:05:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2632 transitions. [2019-10-02 15:05:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 15:05:20,487 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:20,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:20,488 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:20,492 INFO L82 PathProgramCache]: Analyzing trace with hash 753095009, now seen corresponding path program 1 times [2019-10-02 15:05:20,499 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:20,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:20,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:20,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:20,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:21,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:21,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 15:05:21,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 15:05:21,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 15:05:21,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-02 15:05:21,012 INFO L87 Difference]: Start difference. First operand 1771 states and 2632 transitions. Second operand 13 states. [2019-10-02 15:05:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:25,566 INFO L93 Difference]: Finished difference Result 14490 states and 22590 transitions. [2019-10-02 15:05:25,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 15:05:25,567 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 161 [2019-10-02 15:05:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:25,632 INFO L225 Difference]: With dead ends: 14490 [2019-10-02 15:05:25,633 INFO L226 Difference]: Without dead ends: 12938 [2019-10-02 15:05:25,641 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 15:05:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12938 states. [2019-10-02 15:05:26,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12938 to 7935. [2019-10-02 15:05:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7935 states. [2019-10-02 15:05:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 12108 transitions. [2019-10-02 15:05:26,301 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 12108 transitions. Word has length 161 [2019-10-02 15:05:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:26,302 INFO L475 AbstractCegarLoop]: Abstraction has 7935 states and 12108 transitions. [2019-10-02 15:05:26,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 15:05:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 12108 transitions. [2019-10-02 15:05:26,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 15:05:26,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:26,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:26,309 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:26,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:26,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1464453224, now seen corresponding path program 1 times [2019-10-02 15:05:26,310 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:26,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:26,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:26,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:26,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:26,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-10-02 15:05:26,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:26,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:05:26,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:05:26,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:05:26,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:05:26,581 INFO L87 Difference]: Start difference. First operand 7935 states and 12108 transitions. Second operand 9 states. [2019-10-02 15:05:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:27,620 INFO L93 Difference]: Finished difference Result 11115 states and 17157 transitions. [2019-10-02 15:05:27,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 15:05:27,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2019-10-02 15:05:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:27,639 INFO L225 Difference]: With dead ends: 11115 [2019-10-02 15:05:27,639 INFO L226 Difference]: Without dead ends: 3905 [2019-10-02 15:05:27,652 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 15:05:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2019-10-02 15:05:27,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 2924. [2019-10-02 15:05:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2924 states. [2019-10-02 15:05:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 4420 transitions. [2019-10-02 15:05:27,828 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 4420 transitions. Word has length 161 [2019-10-02 15:05:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:27,828 INFO L475 AbstractCegarLoop]: Abstraction has 2924 states and 4420 transitions. [2019-10-02 15:05:27,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:05:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 4420 transitions. [2019-10-02 15:05:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 15:05:27,832 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:27,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:27,833 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:27,833 INFO L82 PathProgramCache]: Analyzing trace with hash -217483962, now seen corresponding path program 1 times [2019-10-02 15:05:27,833 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:27,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:27,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:27,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:27,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:28,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:28,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:05:28,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:05:28,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:05:28,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:05:28,063 INFO L87 Difference]: Start difference. First operand 2924 states and 4420 transitions. Second operand 9 states. [2019-10-02 15:05:28,396 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-10-02 15:05:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:29,942 INFO L93 Difference]: Finished difference Result 14166 states and 21917 transitions. [2019-10-02 15:05:29,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 15:05:29,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2019-10-02 15:05:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:29,970 INFO L225 Difference]: With dead ends: 14166 [2019-10-02 15:05:29,970 INFO L226 Difference]: Without dead ends: 11461 [2019-10-02 15:05:29,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-10-02 15:05:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-10-02 15:05:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 7578. [2019-10-02 15:05:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7578 states. [2019-10-02 15:05:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 11480 transitions. [2019-10-02 15:05:30,441 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 11480 transitions. Word has length 161 [2019-10-02 15:05:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:30,441 INFO L475 AbstractCegarLoop]: Abstraction has 7578 states and 11480 transitions. [2019-10-02 15:05:30,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:05:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 11480 transitions. [2019-10-02 15:05:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 15:05:30,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:30,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:30,448 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:30,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1859935101, now seen corresponding path program 1 times [2019-10-02 15:05:30,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:30,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:30,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:30,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:30,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:30,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:30,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:05:30,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:05:30,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:05:30,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:05:30,606 INFO L87 Difference]: Start difference. First operand 7578 states and 11480 transitions. Second operand 4 states. [2019-10-02 15:05:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:31,755 INFO L93 Difference]: Finished difference Result 14483 states and 22537 transitions. [2019-10-02 15:05:31,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:05:31,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-02 15:05:31,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:31,777 INFO L225 Difference]: With dead ends: 14483 [2019-10-02 15:05:31,777 INFO L226 Difference]: Without dead ends: 9190 [2019-10-02 15:05:31,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:05:31,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9190 states. [2019-10-02 15:05:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9190 to 9188. [2019-10-02 15:05:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-10-02 15:05:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 14008 transitions. [2019-10-02 15:05:32,440 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 14008 transitions. Word has length 161 [2019-10-02 15:05:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:32,440 INFO L475 AbstractCegarLoop]: Abstraction has 9188 states and 14008 transitions. [2019-10-02 15:05:32,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:05:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 14008 transitions. [2019-10-02 15:05:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 15:05:32,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:32,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:32,447 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:32,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:32,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1831416783, now seen corresponding path program 1 times [2019-10-02 15:05:32,448 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:32,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:32,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:32,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:32,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:32,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:32,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:05:32,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:05:32,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:05:32,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:05:32,645 INFO L87 Difference]: Start difference. First operand 9188 states and 14008 transitions. Second operand 4 states. [2019-10-02 15:05:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:33,938 INFO L93 Difference]: Finished difference Result 24236 states and 36925 transitions. [2019-10-02 15:05:33,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:05:33,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-02 15:05:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:33,968 INFO L225 Difference]: With dead ends: 24236 [2019-10-02 15:05:33,968 INFO L226 Difference]: Without dead ends: 15071 [2019-10-02 15:05:33,986 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:05:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15071 states. [2019-10-02 15:05:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15071 to 15048. [2019-10-02 15:05:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15048 states. [2019-10-02 15:05:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15048 states to 15048 states and 22725 transitions. [2019-10-02 15:05:34,923 INFO L78 Accepts]: Start accepts. Automaton has 15048 states and 22725 transitions. Word has length 161 [2019-10-02 15:05:34,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:34,923 INFO L475 AbstractCegarLoop]: Abstraction has 15048 states and 22725 transitions. [2019-10-02 15:05:34,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:05:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 15048 states and 22725 transitions. [2019-10-02 15:05:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 15:05:34,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:34,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:34,932 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash 668472032, now seen corresponding path program 1 times [2019-10-02 15:05:34,932 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:34,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:34,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:34,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:34,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:35,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:35,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:05:35,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:05:35,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:05:35,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:35,032 INFO L87 Difference]: Start difference. First operand 15048 states and 22725 transitions. Second operand 3 states. [2019-10-02 15:05:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:36,544 INFO L93 Difference]: Finished difference Result 43634 states and 66065 transitions. [2019-10-02 15:05:36,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:05:36,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-02 15:05:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:36,596 INFO L225 Difference]: With dead ends: 43634 [2019-10-02 15:05:36,597 INFO L226 Difference]: Without dead ends: 28974 [2019-10-02 15:05:36,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28974 states. [2019-10-02 15:05:38,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28974 to 28953. [2019-10-02 15:05:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28953 states. [2019-10-02 15:05:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28953 states to 28953 states and 43506 transitions. [2019-10-02 15:05:38,220 INFO L78 Accepts]: Start accepts. Automaton has 28953 states and 43506 transitions. Word has length 163 [2019-10-02 15:05:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:38,221 INFO L475 AbstractCegarLoop]: Abstraction has 28953 states and 43506 transitions. [2019-10-02 15:05:38,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:05:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 28953 states and 43506 transitions. [2019-10-02 15:05:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 15:05:38,234 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:38,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:38,235 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1439315485, now seen corresponding path program 1 times [2019-10-02 15:05:38,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:38,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:38,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:38,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:38,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:38,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:38,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:05:38,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:05:38,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:05:38,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:05:38,381 INFO L87 Difference]: Start difference. First operand 28953 states and 43506 transitions. Second operand 4 states. [2019-10-02 15:05:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:39,631 INFO L93 Difference]: Finished difference Result 46825 states and 70222 transitions. [2019-10-02 15:05:39,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:05:39,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-10-02 15:05:39,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:39,674 INFO L225 Difference]: With dead ends: 46825 [2019-10-02 15:05:39,675 INFO L226 Difference]: Without dead ends: 23474 [2019-10-02 15:05:39,715 INFO L640 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-10-02 15:05:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23474 states. [2019-10-02 15:05:41,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23474 to 23474. [2019-10-02 15:05:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23474 states. [2019-10-02 15:05:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23474 states to 23474 states and 35144 transitions. [2019-10-02 15:05:41,696 INFO L78 Accepts]: Start accepts. Automaton has 23474 states and 35144 transitions. Word has length 163 [2019-10-02 15:05:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:41,696 INFO L475 AbstractCegarLoop]: Abstraction has 23474 states and 35144 transitions. [2019-10-02 15:05:41,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:05:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 23474 states and 35144 transitions. [2019-10-02 15:05:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 15:05:41,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:41,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:41,706 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:41,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1713355484, now seen corresponding path program 1 times [2019-10-02 15:05:41,707 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:41,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:41,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:41,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:41,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:41,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:41,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:41,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:05:41,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:05:41,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:05:41,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:41,788 INFO L87 Difference]: Start difference. First operand 23474 states and 35144 transitions. Second operand 3 states. [2019-10-02 15:05:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:43,834 INFO L93 Difference]: Finished difference Result 62336 states and 94477 transitions. [2019-10-02 15:05:43,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:05:43,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-02 15:05:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:43,889 INFO L225 Difference]: With dead ends: 62336 [2019-10-02 15:05:43,889 INFO L226 Difference]: Without dead ends: 39198 [2019-10-02 15:05:43,919 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:43,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39198 states. [2019-10-02 15:05:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39198 to 35602. [2019-10-02 15:05:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35602 states. [2019-10-02 15:05:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35602 states to 35602 states and 54441 transitions. [2019-10-02 15:05:45,982 INFO L78 Accepts]: Start accepts. Automaton has 35602 states and 54441 transitions. Word has length 167 [2019-10-02 15:05:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:45,983 INFO L475 AbstractCegarLoop]: Abstraction has 35602 states and 54441 transitions. [2019-10-02 15:05:45,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:05:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 35602 states and 54441 transitions. [2019-10-02 15:05:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 15:05:45,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:45,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:45,992 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:45,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:45,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2046979909, now seen corresponding path program 1 times [2019-10-02 15:05:45,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:45,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:45,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:45,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:45,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:46,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:46,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:05:46,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:05:46,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:05:46,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:05:46,144 INFO L87 Difference]: Start difference. First operand 35602 states and 54441 transitions. Second operand 4 states. [2019-10-02 15:05:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:50,055 INFO L93 Difference]: Finished difference Result 91626 states and 141514 transitions. [2019-10-02 15:05:50,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:05:50,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-10-02 15:05:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:50,130 INFO L225 Difference]: With dead ends: 91626 [2019-10-02 15:05:50,131 INFO L226 Difference]: Without dead ends: 61508 [2019-10-02 15:05:50,163 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:05:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61508 states. [2019-10-02 15:05:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61508 to 61506. [2019-10-02 15:05:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61506 states. [2019-10-02 15:05:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61506 states to 61506 states and 93776 transitions. [2019-10-02 15:05:53,644 INFO L78 Accepts]: Start accepts. Automaton has 61506 states and 93776 transitions. Word has length 168 [2019-10-02 15:05:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:53,645 INFO L475 AbstractCegarLoop]: Abstraction has 61506 states and 93776 transitions. [2019-10-02 15:05:53,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:05:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 61506 states and 93776 transitions. [2019-10-02 15:05:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 15:05:53,656 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:53,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:05:53,656 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:53,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:53,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1869790038, now seen corresponding path program 1 times [2019-10-02 15:05:53,657 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:53,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:53,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:53,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:05:53,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:53,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:05:53,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:05:53,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:05:53,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:05:53,858 INFO L87 Difference]: Start difference. First operand 61506 states and 93776 transitions. Second operand 4 states. [2019-10-02 15:06:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:01,073 INFO L93 Difference]: Finished difference Result 173627 states and 264401 transitions. [2019-10-02 15:06:01,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:06:01,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-10-02 15:06:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:01,219 INFO L225 Difference]: With dead ends: 173627 [2019-10-02 15:06:01,219 INFO L226 Difference]: Without dead ends: 112164 [2019-10-02 15:06:01,264 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:06:01,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112164 states. [2019-10-02 15:06:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112164 to 112112. [2019-10-02 15:06:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112112 states. [2019-10-02 15:06:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112112 states to 112112 states and 169267 transitions. [2019-10-02 15:06:09,493 INFO L78 Accepts]: Start accepts. Automaton has 112112 states and 169267 transitions. Word has length 168 [2019-10-02 15:06:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:06:09,493 INFO L475 AbstractCegarLoop]: Abstraction has 112112 states and 169267 transitions. [2019-10-02 15:06:09,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:06:09,493 INFO L276 IsEmpty]: Start isEmpty. Operand 112112 states and 169267 transitions. [2019-10-02 15:06:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 15:06:09,513 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:06:09,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:06:09,513 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:06:09,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:06:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash 479284410, now seen corresponding path program 1 times [2019-10-02 15:06:09,514 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:06:09,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:06:09,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:09,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:06:09,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:06:09,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-10-02 15:06:09,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:06:09,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:06:09,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:06:09,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:06:09,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:06:09,575 INFO L87 Difference]: Start difference. First operand 112112 states and 169267 transitions. Second operand 3 states. [2019-10-02 15:06:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:23,967 INFO L93 Difference]: Finished difference Result 336136 states and 507546 transitions. [2019-10-02 15:06:23,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:06:23,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-10-02 15:06:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:24,284 INFO L225 Difference]: With dead ends: 336136 [2019-10-02 15:06:24,284 INFO L226 Difference]: Without dead ends: 224133 [2019-10-02 15:06:24,375 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:06:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224133 states. [2019-10-02 15:06:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224133 to 112118. [2019-10-02 15:06:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112118 states. [2019-10-02 15:06:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112118 states to 112118 states and 169273 transitions. [2019-10-02 15:06:35,828 INFO L78 Accepts]: Start accepts. Automaton has 112118 states and 169273 transitions. Word has length 169 [2019-10-02 15:06:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:06:35,829 INFO L475 AbstractCegarLoop]: Abstraction has 112118 states and 169273 transitions. [2019-10-02 15:06:35,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:06:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 112118 states and 169273 transitions. [2019-10-02 15:06:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 15:06:35,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:06:35,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:06:35,846 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:06:35,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:06:35,846 INFO L82 PathProgramCache]: Analyzing trace with hash -980457449, now seen corresponding path program 1 times [2019-10-02 15:06:35,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:06:35,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:06:35,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:35,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:06:35,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:06:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:06:35,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:06:35,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:06:35,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:06:35,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:06:35,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:06:35,983 INFO L87 Difference]: Start difference. First operand 112118 states and 169273 transitions. Second operand 4 states. [2019-10-02 15:06:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:43,575 INFO L93 Difference]: Finished difference Result 224194 states and 338490 transitions. [2019-10-02 15:06:43,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:06:43,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-10-02 15:06:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:43,718 INFO L225 Difference]: With dead ends: 224194 [2019-10-02 15:06:43,718 INFO L226 Difference]: Without dead ends: 112112 [2019-10-02 15:06:43,783 INFO L640 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-10-02 15:06:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112112 states. [2019-10-02 15:06:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112112 to 112112. [2019-10-02 15:06:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112112 states. [2019-10-02 15:06:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112112 states to 112112 states and 169261 transitions. [2019-10-02 15:06:53,715 INFO L78 Accepts]: Start accepts. Automaton has 112112 states and 169261 transitions. Word has length 170 [2019-10-02 15:06:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:06:53,715 INFO L475 AbstractCegarLoop]: Abstraction has 112112 states and 169261 transitions. [2019-10-02 15:06:53,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:06:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 112112 states and 169261 transitions. [2019-10-02 15:06:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 15:06:53,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:06:53,729 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:06:53,730 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:06:53,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:06:53,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1785538233, now seen corresponding path program 1 times [2019-10-02 15:06:53,730 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:06:53,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:06:53,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:53,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:06:53,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:06:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:06:53,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:06:53,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:06:53,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:06:53,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:06:53,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:06:53,831 INFO L87 Difference]: Start difference. First operand 112112 states and 169261 transitions. Second operand 3 states. [2019-10-02 15:07:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:07:05,251 INFO L93 Difference]: Finished difference Result 272839 states and 411054 transitions. [2019-10-02 15:07:05,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:07:05,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-02 15:07:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:07:05,465 INFO L225 Difference]: With dead ends: 272839 [2019-10-02 15:07:05,465 INFO L226 Difference]: Without dead ends: 161471 [2019-10-02 15:07:05,556 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:07:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161471 states. [2019-10-02 15:07:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161471 to 161419. [2019-10-02 15:07:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161419 states. [2019-10-02 15:07:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161419 states to 161419 states and 239938 transitions. [2019-10-02 15:07:20,185 INFO L78 Accepts]: Start accepts. Automaton has 161419 states and 239938 transitions. Word has length 170 [2019-10-02 15:07:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:07:20,185 INFO L475 AbstractCegarLoop]: Abstraction has 161419 states and 239938 transitions. [2019-10-02 15:07:20,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:07:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 161419 states and 239938 transitions. [2019-10-02 15:07:20,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 15:07:20,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:07:20,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:07:20,213 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:07:20,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:07:20,213 INFO L82 PathProgramCache]: Analyzing trace with hash -50194899, now seen corresponding path program 1 times [2019-10-02 15:07:20,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:07:20,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:07:20,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:20,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:07:20,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:07:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:07:20,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:07:20,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 15:07:20,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:07:20,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:07:20,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:07:20,415 INFO L87 Difference]: Start difference. First operand 161419 states and 239938 transitions. Second operand 8 states. [2019-10-02 15:07:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:07:57,523 INFO L93 Difference]: Finished difference Result 572511 states and 852193 transitions. [2019-10-02 15:07:57,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 15:07:57,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 175 [2019-10-02 15:07:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:07:58,203 INFO L225 Difference]: With dead ends: 572511 [2019-10-02 15:07:58,204 INFO L226 Difference]: Without dead ends: 423989 [2019-10-02 15:07:58,350 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-10-02 15:07:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423989 states. [2019-10-02 15:08:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423989 to 191663. [2019-10-02 15:08:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191663 states. [2019-10-02 15:08:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191663 states to 191663 states and 284294 transitions. [2019-10-02 15:08:20,650 INFO L78 Accepts]: Start accepts. Automaton has 191663 states and 284294 transitions. Word has length 175 [2019-10-02 15:08:20,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:08:20,651 INFO L475 AbstractCegarLoop]: Abstraction has 191663 states and 284294 transitions. [2019-10-02 15:08:20,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:08:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 191663 states and 284294 transitions. [2019-10-02 15:08:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 15:08:20,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:08:20,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:08:20,680 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:08:20,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:08:20,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1921896108, now seen corresponding path program 1 times [2019-10-02 15:08:20,681 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:08:20,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:08:20,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:08:20,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:08:20,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:08:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:08:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:08:20,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:08:20,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:08:20,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:08:20,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:08:20,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:08:20,854 INFO L87 Difference]: Start difference. First operand 191663 states and 284294 transitions. Second operand 4 states. [2019-10-02 15:08:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:08:39,813 INFO L93 Difference]: Finished difference Result 369477 states and 548186 transitions. [2019-10-02 15:08:39,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:08:39,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-10-02 15:08:39,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:08:40,051 INFO L225 Difference]: With dead ends: 369477 [2019-10-02 15:08:40,051 INFO L226 Difference]: Without dead ends: 178125 [2019-10-02 15:08:40,156 INFO L640 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-10-02 15:08:40,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178125 states. [2019-10-02 15:08:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178125 to 178061. [2019-10-02 15:08:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178061 states. [2019-10-02 15:08:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178061 states to 178061 states and 264173 transitions. [2019-10-02 15:08:59,154 INFO L78 Accepts]: Start accepts. Automaton has 178061 states and 264173 transitions. Word has length 175 [2019-10-02 15:08:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:08:59,154 INFO L475 AbstractCegarLoop]: Abstraction has 178061 states and 264173 transitions. [2019-10-02 15:08:59,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:08:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 178061 states and 264173 transitions. [2019-10-02 15:08:59,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 15:08:59,177 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:08:59,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:08:59,178 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:08:59,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:08:59,178 INFO L82 PathProgramCache]: Analyzing trace with hash 599248830, now seen corresponding path program 1 times [2019-10-02 15:08:59,178 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:08:59,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:08:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:08:59,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:08:59,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:08:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:08:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:08:59,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:08:59,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:08:59,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:08:59,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:08:59,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:08:59,369 INFO L87 Difference]: Start difference. First operand 178061 states and 264173 transitions. Second operand 4 states. [2019-10-02 15:09:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:15,078 INFO L93 Difference]: Finished difference Result 356177 states and 528399 transitions. [2019-10-02 15:09:15,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:09:15,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-10-02 15:09:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:15,314 INFO L225 Difference]: With dead ends: 356177 [2019-10-02 15:09:15,314 INFO L226 Difference]: Without dead ends: 178275 [2019-10-02 15:09:15,423 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:09:15,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178275 states. [2019-10-02 15:09:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178275 to 178163. [2019-10-02 15:09:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178163 states. [2019-10-02 15:09:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178163 states to 178163 states and 264273 transitions. [2019-10-02 15:09:35,444 INFO L78 Accepts]: Start accepts. Automaton has 178163 states and 264273 transitions. Word has length 177 [2019-10-02 15:09:35,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:09:35,444 INFO L475 AbstractCegarLoop]: Abstraction has 178163 states and 264273 transitions. [2019-10-02 15:09:35,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:09:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 178163 states and 264273 transitions. [2019-10-02 15:09:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 15:09:35,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:09:35,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:09:35,467 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:09:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:09:35,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1715947558, now seen corresponding path program 1 times [2019-10-02 15:09:35,467 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:09:35,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:09:35,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:35,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:09:35,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:09:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:09:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:09:35,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:09:35,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:09:35,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:09:35,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:09:35,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:09:35,527 INFO L87 Difference]: Start difference. First operand 178163 states and 264273 transitions. Second operand 3 states. [2019-10-02 15:10:09,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:10:09,967 INFO L93 Difference]: Finished difference Result 496777 states and 736871 transitions. [2019-10-02 15:10:09,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:10:09,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-02 15:10:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:10:10,499 INFO L225 Difference]: With dead ends: 496777 [2019-10-02 15:10:10,499 INFO L226 Difference]: Without dead ends: 356115 [2019-10-02 15:10:10,619 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:10:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356115 states. [2019-10-02 15:10:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356115 to 178173. [2019-10-02 15:10:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178173 states. [2019-10-02 15:10:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178173 states to 178173 states and 264283 transitions. [2019-10-02 15:10:29,585 INFO L78 Accepts]: Start accepts. Automaton has 178173 states and 264283 transitions. Word has length 178 [2019-10-02 15:10:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:10:29,586 INFO L475 AbstractCegarLoop]: Abstraction has 178173 states and 264283 transitions. [2019-10-02 15:10:29,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:10:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 178173 states and 264283 transitions. [2019-10-02 15:10:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 15:10:29,611 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:10:29,611 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:10:29,611 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:10:29,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:10:29,612 INFO L82 PathProgramCache]: Analyzing trace with hash -971047, now seen corresponding path program 1 times [2019-10-02 15:10:29,612 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:10:29,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:10:29,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:29,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:10:29,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:10:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:10:29,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:10:29,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 15:10:29,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 15:10:29,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 15:10:29,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 15:10:29,916 INFO L87 Difference]: Start difference. First operand 178173 states and 264283 transitions. Second operand 11 states. [2019-10-02 15:11:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:11:12,267 INFO L93 Difference]: Finished difference Result 485685 states and 726046 transitions. [2019-10-02 15:11:12,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 15:11:12,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 179 [2019-10-02 15:11:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:11:13,039 INFO L225 Difference]: With dead ends: 485685 [2019-10-02 15:11:13,039 INFO L226 Difference]: Without dead ends: 355139 [2019-10-02 15:11:13,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=331, Unknown=0, NotChecked=0, Total=506 [2019-10-02 15:11:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355139 states. [2019-10-02 15:11:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355139 to 261537. [2019-10-02 15:11:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261537 states. [2019-10-02 15:11:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261537 states to 261537 states and 387799 transitions. [2019-10-02 15:11:46,436 INFO L78 Accepts]: Start accepts. Automaton has 261537 states and 387799 transitions. Word has length 179 [2019-10-02 15:11:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:11:46,437 INFO L475 AbstractCegarLoop]: Abstraction has 261537 states and 387799 transitions. [2019-10-02 15:11:46,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 15:11:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 261537 states and 387799 transitions. [2019-10-02 15:11:46,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 15:11:46,475 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:11:46,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:11:46,476 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:11:46,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:11:46,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1966026327, now seen corresponding path program 1 times [2019-10-02 15:11:46,476 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:11:46,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:11:46,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:46,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:11:46,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:11:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:11:46,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:11:46,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:11:46,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 15:11:46,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 15:11:46,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 15:11:46,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 15:11:46,724 INFO L87 Difference]: Start difference. First operand 261537 states and 387799 transitions. Second operand 11 states. [2019-10-02 15:12:57,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:12:57,410 INFO L93 Difference]: Finished difference Result 648245 states and 960808 transitions. [2019-10-02 15:12:57,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 15:12:57,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 179 [2019-10-02 15:12:57,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:12:58,427 INFO L225 Difference]: With dead ends: 648245 [2019-10-02 15:12:58,428 INFO L226 Difference]: Without dead ends: 589783 [2019-10-02 15:12:58,547 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=332, Unknown=0, NotChecked=0, Total=506 [2019-10-02 15:12:58,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589783 states. [2019-10-02 15:13:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589783 to 372106. [2019-10-02 15:13:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372106 states. [2019-10-02 15:13:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372106 states to 372106 states and 554170 transitions. [2019-10-02 15:13:48,962 INFO L78 Accepts]: Start accepts. Automaton has 372106 states and 554170 transitions. Word has length 179 [2019-10-02 15:13:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:13:48,962 INFO L475 AbstractCegarLoop]: Abstraction has 372106 states and 554170 transitions. [2019-10-02 15:13:48,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 15:13:48,963 INFO L276 IsEmpty]: Start isEmpty. Operand 372106 states and 554170 transitions. [2019-10-02 15:13:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 15:13:49,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:13:49,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:13:49,012 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:13:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:13:49,012 INFO L82 PathProgramCache]: Analyzing trace with hash 264449639, now seen corresponding path program 1 times [2019-10-02 15:13:49,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:13:49,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:13:49,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:13:49,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:13:49,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:13:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:13:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:13:49,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:13:49,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:13:49,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:13:49,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:13:49,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:13:49,194 INFO L87 Difference]: Start difference. First operand 372106 states and 554170 transitions. Second operand 5 states. [2019-10-02 15:14:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:14:24,726 INFO L93 Difference]: Finished difference Result 468102 states and 700805 transitions. [2019-10-02 15:14:24,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:14:24,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-10-02 15:14:24,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:14:25,187 INFO L225 Difference]: With dead ends: 468102 [2019-10-02 15:14:25,187 INFO L226 Difference]: Without dead ends: 279591 [2019-10-02 15:14:25,323 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 15:14:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279591 states. [2019-10-02 15:15:00,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279591 to 279589. [2019-10-02 15:15:00,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279589 states. [2019-10-02 15:15:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279589 states to 279589 states and 417842 transitions. [2019-10-02 15:15:00,690 INFO L78 Accepts]: Start accepts. Automaton has 279589 states and 417842 transitions. Word has length 179 [2019-10-02 15:15:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:15:00,691 INFO L475 AbstractCegarLoop]: Abstraction has 279589 states and 417842 transitions. [2019-10-02 15:15:00,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:15:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 279589 states and 417842 transitions. [2019-10-02 15:15:00,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 15:15:00,719 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:15:00,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:15:00,719 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:15:00,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:15:00,719 INFO L82 PathProgramCache]: Analyzing trace with hash 294652926, now seen corresponding path program 1 times [2019-10-02 15:15:00,720 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:15:00,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:15:00,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:15:00,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:15:00,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:15:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:15:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:15:00,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:15:00,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 15:15:00,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:15:00,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:15:00,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:15:00,937 INFO L87 Difference]: Start difference. First operand 279589 states and 417842 transitions. Second operand 8 states. [2019-10-02 15:16:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:16:22,779 INFO L93 Difference]: Finished difference Result 820531 states and 1219664 transitions. [2019-10-02 15:16:22,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 15:16:22,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2019-10-02 15:16:22,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:16:23,877 INFO L225 Difference]: With dead ends: 820531 [2019-10-02 15:16:23,878 INFO L226 Difference]: Without dead ends: 644116 [2019-10-02 15:16:24,087 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-10-02 15:16:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644116 states. [2019-10-02 15:16:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644116 to 202151. [2019-10-02 15:16:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202151 states. [2019-10-02 15:16:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202151 states to 202151 states and 299905 transitions. [2019-10-02 15:16:59,255 INFO L78 Accepts]: Start accepts. Automaton has 202151 states and 299905 transitions. Word has length 179 [2019-10-02 15:16:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:16:59,256 INFO L475 AbstractCegarLoop]: Abstraction has 202151 states and 299905 transitions. [2019-10-02 15:16:59,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:16:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 202151 states and 299905 transitions. [2019-10-02 15:16:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 15:16:59,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:16:59,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:16:59,282 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:16:59,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:16:59,282 INFO L82 PathProgramCache]: Analyzing trace with hash 560073612, now seen corresponding path program 1 times [2019-10-02 15:16:59,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:16:59,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:16:59,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:16:59,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:16:59,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:16:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:16:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:16:59,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:16:59,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:16:59,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:16:59,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:16:59,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:16:59,452 INFO L87 Difference]: Start difference. First operand 202151 states and 299905 transitions. Second operand 4 states.