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.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:21:37,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:21:37,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:21:37,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:21:37,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:21:37,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:21:37,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:21:37,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:21:37,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:21:37,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:21:37,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:21:37,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:21:37,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:21:37,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:21:37,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:21:37,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:21:37,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:21:37,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:21:37,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:21:37,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:21:37,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:21:37,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:21:37,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:21:37,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:21:37,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:21:37,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:21:37,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:21:37,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:21:37,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:21:37,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:21:37,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:21:37,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:21:37,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:21:37,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:21:37,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:21:37,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:21:37,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:21:37,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:21:37,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:21:37,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:21:37,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:21:37,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:21:38,015 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:21:38,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:21:38,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:21:38,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:21:38,019 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:21:38,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:21:38,019 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:21:38,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:21:38,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:21:38,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:21:38,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:21:38,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:21:38,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:21:38,022 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:21:38,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:21:38,023 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:21:38,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:21:38,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:21:38,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:21:38,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:21:38,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:21:38,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:21:38,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:21:38,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:21:38,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:21:38,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:21:38,026 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:21:38,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:21:38,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:21:38,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:21:38,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:21:38,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:21:38,105 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:21:38,105 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:21:38,106 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.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:21:38,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e44097a1/414ff50491114356b82c9b975edb30fe/FLAG5cf053a79 [2019-09-08 13:21:38,848 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:21:38,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:21:38,875 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e44097a1/414ff50491114356b82c9b975edb30fe/FLAG5cf053a79 [2019-09-08 13:21:39,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e44097a1/414ff50491114356b82c9b975edb30fe [2019-09-08 13:21:39,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:21:39,091 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:21:39,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:21:39,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:21:39,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:21:39,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:21:39" (1/1) ... [2019-09-08 13:21:39,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ffce86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:39, skipping insertion in model container [2019-09-08 13:21:39,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:21:39" (1/1) ... [2019-09-08 13:21:39,106 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:21:39,233 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:21:40,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:21:40,269 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:21:40,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:21:40,700 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:21:40,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:40 WrapperNode [2019-09-08 13:21:40,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:21:40,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:21:40,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:21:40,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:21:40,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:40" (1/1) ... [2019-09-08 13:21:40,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:40" (1/1) ... [2019-09-08 13:21:40,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:40" (1/1) ... [2019-09-08 13:21:40,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:40" (1/1) ... [2019-09-08 13:21:40,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:40" (1/1) ... [2019-09-08 13:21:40,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:40" (1/1) ... [2019-09-08 13:21:40,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:40" (1/1) ... [2019-09-08 13:21:40,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:21:40,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:21:40,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:21:40,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:21:40,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:21:41,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:21:41,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:21:41,009 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:21:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:21:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:21:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:21:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:21:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:21:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:21:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:21:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:21:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:21:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:21:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:21:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:21:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:21:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:21:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:21:41,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:21:43,535 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:21:43,536 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:21:43,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:21:43 BoogieIcfgContainer [2019-09-08 13:21:43,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:21:43,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:21:43,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:21:43,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:21:43,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:21:39" (1/3) ... [2019-09-08 13:21:43,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed3d420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:21:43, skipping insertion in model container [2019-09-08 13:21:43,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:21:40" (2/3) ... [2019-09-08 13:21:43,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed3d420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:21:43, skipping insertion in model container [2019-09-08 13:21:43,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:21:43" (3/3) ... [2019-09-08 13:21:43,545 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:21:43,555 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:21:43,564 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:21:43,581 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:21:43,627 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:21:43,627 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:21:43,627 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:21:43,628 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:21:43,628 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:21:43,628 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:21:43,628 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:21:43,628 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:21:43,628 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:21:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states. [2019-09-08 13:21:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:21:43,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:43,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:43,696 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:43,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:43,701 INFO L82 PathProgramCache]: Analyzing trace with hash -990658724, now seen corresponding path program 1 times [2019-09-08 13:21:43,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:43,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:43,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:43,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:43,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:21:45,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:45,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:21:45,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:21:45,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:21:45,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:21:45,387 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 4 states. [2019-09-08 13:21:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:45,771 INFO L93 Difference]: Finished difference Result 2281 states and 4062 transitions. [2019-09-08 13:21:45,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:21:45,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-08 13:21:45,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:45,807 INFO L225 Difference]: With dead ends: 2281 [2019-09-08 13:21:45,807 INFO L226 Difference]: Without dead ends: 1512 [2019-09-08 13:21:45,821 INFO L628 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-09-08 13:21:45,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2019-09-08 13:21:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1510. [2019-09-08 13:21:45,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2019-09-08 13:21:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2348 transitions. [2019-09-08 13:21:45,976 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2348 transitions. Word has length 320 [2019-09-08 13:21:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:45,977 INFO L475 AbstractCegarLoop]: Abstraction has 1510 states and 2348 transitions. [2019-09-08 13:21:45,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:21:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2348 transitions. [2019-09-08 13:21:45,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:21:45,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:45,988 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:45,989 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:45,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2068718213, now seen corresponding path program 1 times [2019-09-08 13:21:45,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:45,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:45,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:45,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:45,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:21:46,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:46,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:46,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:46,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:46,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:46,347 INFO L87 Difference]: Start difference. First operand 1510 states and 2348 transitions. Second operand 3 states. [2019-09-08 13:21:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:46,589 INFO L93 Difference]: Finished difference Result 4339 states and 6716 transitions. [2019-09-08 13:21:46,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:46,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 13:21:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:46,607 INFO L225 Difference]: With dead ends: 4339 [2019-09-08 13:21:46,608 INFO L226 Difference]: Without dead ends: 2958 [2019-09-08 13:21:46,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:46,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2019-09-08 13:21:46,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2956. [2019-09-08 13:21:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2956 states. [2019-09-08 13:21:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 4573 transitions. [2019-09-08 13:21:46,745 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 4573 transitions. Word has length 322 [2019-09-08 13:21:46,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:46,746 INFO L475 AbstractCegarLoop]: Abstraction has 2956 states and 4573 transitions. [2019-09-08 13:21:46,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:46,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 4573 transitions. [2019-09-08 13:21:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:21:46,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:46,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:46,757 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:46,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:46,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1725739904, now seen corresponding path program 1 times [2019-09-08 13:21:46,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:46,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:46,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:46,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:46,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:21:46,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:46,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:46,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:46,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:46,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:46,922 INFO L87 Difference]: Start difference. First operand 2956 states and 4573 transitions. Second operand 3 states. [2019-09-08 13:21:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:47,217 INFO L93 Difference]: Finished difference Result 8793 states and 13595 transitions. [2019-09-08 13:21:47,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:47,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 13:21:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:47,263 INFO L225 Difference]: With dead ends: 8793 [2019-09-08 13:21:47,263 INFO L226 Difference]: Without dead ends: 5879 [2019-09-08 13:21:47,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5879 states. [2019-09-08 13:21:47,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5879 to 2975. [2019-09-08 13:21:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-09-08 13:21:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4601 transitions. [2019-09-08 13:21:47,534 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4601 transitions. Word has length 322 [2019-09-08 13:21:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:47,534 INFO L475 AbstractCegarLoop]: Abstraction has 2975 states and 4601 transitions. [2019-09-08 13:21:47,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4601 transitions. [2019-09-08 13:21:47,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 13:21:47,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:47,547 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:47,547 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:47,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:47,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1344265648, now seen corresponding path program 1 times [2019-09-08 13:21:47,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:47,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:47,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:47,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:47,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:21:47,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:47,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:47,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:47,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:47,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:47,738 INFO L87 Difference]: Start difference. First operand 2975 states and 4601 transitions. Second operand 3 states. [2019-09-08 13:21:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:48,037 INFO L93 Difference]: Finished difference Result 8812 states and 13616 transitions. [2019-09-08 13:21:48,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:48,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-08 13:21:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:48,066 INFO L225 Difference]: With dead ends: 8812 [2019-09-08 13:21:48,066 INFO L226 Difference]: Without dead ends: 5897 [2019-09-08 13:21:48,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5897 states. [2019-09-08 13:21:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5897 to 2993. [2019-09-08 13:21:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2993 states. [2019-09-08 13:21:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 4622 transitions. [2019-09-08 13:21:48,281 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 4622 transitions. Word has length 323 [2019-09-08 13:21:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:48,282 INFO L475 AbstractCegarLoop]: Abstraction has 2993 states and 4622 transitions. [2019-09-08 13:21:48,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:48,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4622 transitions. [2019-09-08 13:21:48,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:21:48,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:48,293 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:48,293 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:48,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:48,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1125276426, now seen corresponding path program 1 times [2019-09-08 13:21:48,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:48,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:48,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:48,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:48,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:21:48,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:48,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:48,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:48,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:48,656 INFO L87 Difference]: Start difference. First operand 2993 states and 4622 transitions. Second operand 3 states. [2019-09-08 13:21:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:48,970 INFO L93 Difference]: Finished difference Result 8520 states and 13091 transitions. [2019-09-08 13:21:48,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:48,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:21:48,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:48,999 INFO L225 Difference]: With dead ends: 8520 [2019-09-08 13:21:48,999 INFO L226 Difference]: Without dead ends: 5772 [2019-09-08 13:21:49,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:49,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5772 states. [2019-09-08 13:21:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5772 to 5770. [2019-09-08 13:21:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5770 states. [2019-09-08 13:21:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 8844 transitions. [2019-09-08 13:21:49,292 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 8844 transitions. Word has length 324 [2019-09-08 13:21:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:49,292 INFO L475 AbstractCegarLoop]: Abstraction has 5770 states and 8844 transitions. [2019-09-08 13:21:49,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 8844 transitions. [2019-09-08 13:21:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:21:49,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:49,311 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:49,311 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:49,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:49,312 INFO L82 PathProgramCache]: Analyzing trace with hash -422622637, now seen corresponding path program 1 times [2019-09-08 13:21:49,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:49,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:49,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:49,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:49,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:21:49,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:49,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:21:49,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:21:49,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:21:49,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:21:49,812 INFO L87 Difference]: Start difference. First operand 5770 states and 8844 transitions. Second operand 4 states. [2019-09-08 13:21:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:50,261 INFO L93 Difference]: Finished difference Result 15775 states and 24002 transitions. [2019-09-08 13:21:50,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:21:50,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-08 13:21:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:50,300 INFO L225 Difference]: With dead ends: 15775 [2019-09-08 13:21:50,300 INFO L226 Difference]: Without dead ends: 10545 [2019-09-08 13:21:50,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:21:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10545 states. [2019-09-08 13:21:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10545 to 6005. [2019-09-08 13:21:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6005 states. [2019-09-08 13:21:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6005 states to 6005 states and 9232 transitions. [2019-09-08 13:21:50,748 INFO L78 Accepts]: Start accepts. Automaton has 6005 states and 9232 transitions. Word has length 324 [2019-09-08 13:21:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:50,748 INFO L475 AbstractCegarLoop]: Abstraction has 6005 states and 9232 transitions. [2019-09-08 13:21:50,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:21:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6005 states and 9232 transitions. [2019-09-08 13:21:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 13:21:50,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:50,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:50,766 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:50,766 INFO L82 PathProgramCache]: Analyzing trace with hash -835402189, now seen corresponding path program 1 times [2019-09-08 13:21:50,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:50,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:50,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:21:50,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:50,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:50,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:50,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:50,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:50,940 INFO L87 Difference]: Start difference. First operand 6005 states and 9232 transitions. Second operand 3 states. [2019-09-08 13:21:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:51,333 INFO L93 Difference]: Finished difference Result 11897 states and 18362 transitions. [2019-09-08 13:21:51,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:51,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-08 13:21:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:51,352 INFO L225 Difference]: With dead ends: 11897 [2019-09-08 13:21:51,352 INFO L226 Difference]: Without dead ends: 7655 [2019-09-08 13:21:51,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7655 states. [2019-09-08 13:21:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7655 to 6957. [2019-09-08 13:21:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6957 states. [2019-09-08 13:21:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6957 states to 6957 states and 10796 transitions. [2019-09-08 13:21:51,779 INFO L78 Accepts]: Start accepts. Automaton has 6957 states and 10796 transitions. Word has length 325 [2019-09-08 13:21:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:51,779 INFO L475 AbstractCegarLoop]: Abstraction has 6957 states and 10796 transitions. [2019-09-08 13:21:51,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 6957 states and 10796 transitions. [2019-09-08 13:21:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:21:51,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:51,798 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:51,799 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:51,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:51,799 INFO L82 PathProgramCache]: Analyzing trace with hash -803015533, now seen corresponding path program 1 times [2019-09-08 13:21:51,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:51,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:51,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:51,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:51,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:21:52,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:52,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:52,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:52,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:52,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:52,401 INFO L87 Difference]: Start difference. First operand 6957 states and 10796 transitions. Second operand 3 states. [2019-09-08 13:21:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:52,955 INFO L93 Difference]: Finished difference Result 19301 states and 29669 transitions. [2019-09-08 13:21:52,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:52,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:21:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:52,991 INFO L225 Difference]: With dead ends: 19301 [2019-09-08 13:21:52,992 INFO L226 Difference]: Without dead ends: 13147 [2019-09-08 13:21:53,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13147 states. [2019-09-08 13:21:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13147 to 7061. [2019-09-08 13:21:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7061 states. [2019-09-08 13:21:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7061 states to 7061 states and 10939 transitions. [2019-09-08 13:21:53,499 INFO L78 Accepts]: Start accepts. Automaton has 7061 states and 10939 transitions. Word has length 326 [2019-09-08 13:21:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:53,500 INFO L475 AbstractCegarLoop]: Abstraction has 7061 states and 10939 transitions. [2019-09-08 13:21:53,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 7061 states and 10939 transitions. [2019-09-08 13:21:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:21:53,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:53,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:53,516 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:53,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:53,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1034080261, now seen corresponding path program 1 times [2019-09-08 13:21:53,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:53,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:53,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:53,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:53,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:21:53,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:53,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:53,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:53,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:53,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:53,666 INFO L87 Difference]: Start difference. First operand 7061 states and 10939 transitions. Second operand 3 states. [2019-09-08 13:21:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:54,289 INFO L93 Difference]: Finished difference Result 19433 states and 29835 transitions. [2019-09-08 13:21:54,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:54,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-08 13:21:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:54,327 INFO L225 Difference]: With dead ends: 19433 [2019-09-08 13:21:54,327 INFO L226 Difference]: Without dead ends: 13272 [2019-09-08 13:21:54,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13272 states. [2019-09-08 13:21:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13272 to 7186. [2019-09-08 13:21:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7186 states. [2019-09-08 13:21:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7186 states to 7186 states and 11085 transitions. [2019-09-08 13:21:54,871 INFO L78 Accepts]: Start accepts. Automaton has 7186 states and 11085 transitions. Word has length 327 [2019-09-08 13:21:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:54,872 INFO L475 AbstractCegarLoop]: Abstraction has 7186 states and 11085 transitions. [2019-09-08 13:21:54,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 7186 states and 11085 transitions. [2019-09-08 13:21:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:21:54,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:54,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:54,890 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash -896780408, now seen corresponding path program 1 times [2019-09-08 13:21:54,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:54,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:54,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:54,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:54,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:55,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:21:55,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:55,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:55,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:55,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:55,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:55,140 INFO L87 Difference]: Start difference. First operand 7186 states and 11085 transitions. Second operand 3 states. [2019-09-08 13:21:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:55,586 INFO L93 Difference]: Finished difference Result 14878 states and 23171 transitions. [2019-09-08 13:21:55,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:55,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-08 13:21:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:55,613 INFO L225 Difference]: With dead ends: 14878 [2019-09-08 13:21:55,613 INFO L226 Difference]: Without dead ends: 9996 [2019-09-08 13:21:55,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2019-09-08 13:21:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 8938. [2019-09-08 13:21:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8938 states. [2019-09-08 13:21:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8938 states to 8938 states and 13957 transitions. [2019-09-08 13:21:56,110 INFO L78 Accepts]: Start accepts. Automaton has 8938 states and 13957 transitions. Word has length 328 [2019-09-08 13:21:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:56,110 INFO L475 AbstractCegarLoop]: Abstraction has 8938 states and 13957 transitions. [2019-09-08 13:21:56,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 8938 states and 13957 transitions. [2019-09-08 13:21:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:21:56,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:56,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:56,122 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:56,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:56,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2095929178, now seen corresponding path program 1 times [2019-09-08 13:21:56,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:56,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:56,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:56,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:56,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:21:56,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:56,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:21:56,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:21:56,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:21:56,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:21:56,514 INFO L87 Difference]: Start difference. First operand 8938 states and 13957 transitions. Second operand 4 states. [2019-09-08 13:21:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:56,848 INFO L93 Difference]: Finished difference Result 15950 states and 24818 transitions. [2019-09-08 13:21:56,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:21:56,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-08 13:21:56,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:56,867 INFO L225 Difference]: With dead ends: 15950 [2019-09-08 13:21:56,868 INFO L226 Difference]: Without dead ends: 7875 [2019-09-08 13:21:56,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:21:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7875 states. [2019-09-08 13:21:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7875 to 7855. [2019-09-08 13:21:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7855 states. [2019-09-08 13:21:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7855 states to 7855 states and 12278 transitions. [2019-09-08 13:21:57,303 INFO L78 Accepts]: Start accepts. Automaton has 7855 states and 12278 transitions. Word has length 328 [2019-09-08 13:21:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:57,304 INFO L475 AbstractCegarLoop]: Abstraction has 7855 states and 12278 transitions. [2019-09-08 13:21:57,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:21:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 7855 states and 12278 transitions. [2019-09-08 13:21:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:21:57,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:57,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:57,314 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:57,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:57,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1451184865, now seen corresponding path program 1 times [2019-09-08 13:21:57,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:57,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:57,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:57,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:57,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:21:57,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:57,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:21:57,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:21:57,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:21:57,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:21:57,675 INFO L87 Difference]: Start difference. First operand 7855 states and 12278 transitions. Second operand 5 states. [2019-09-08 13:21:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:59,341 INFO L93 Difference]: Finished difference Result 19539 states and 30669 transitions. [2019-09-08 13:21:59,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:21:59,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 328 [2019-09-08 13:21:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:59,361 INFO L225 Difference]: With dead ends: 19539 [2019-09-08 13:21:59,361 INFO L226 Difference]: Without dead ends: 13392 [2019-09-08 13:21:59,376 INFO L628 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-09-08 13:21:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2019-09-08 13:22:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 13390. [2019-09-08 13:22:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13390 states. [2019-09-08 13:22:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13390 states to 13390 states and 20947 transitions. [2019-09-08 13:22:00,205 INFO L78 Accepts]: Start accepts. Automaton has 13390 states and 20947 transitions. Word has length 328 [2019-09-08 13:22:00,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:00,205 INFO L475 AbstractCegarLoop]: Abstraction has 13390 states and 20947 transitions. [2019-09-08 13:22:00,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:22:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 13390 states and 20947 transitions. [2019-09-08 13:22:00,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:22:00,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:00,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:22:00,221 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:00,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:00,222 INFO L82 PathProgramCache]: Analyzing trace with hash 165110372, now seen corresponding path program 1 times [2019-09-08 13:22:00,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:00,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:00,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:00,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:00,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:22:00,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:00,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:22:00,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:22:00,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:22:00,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:22:00,745 INFO L87 Difference]: Start difference. First operand 13390 states and 20947 transitions. Second operand 8 states. [2019-09-08 13:22:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:22:06,403 INFO L93 Difference]: Finished difference Result 69705 states and 111332 transitions. [2019-09-08 13:22:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 13:22:06,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 328 [2019-09-08 13:22:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:22:06,489 INFO L225 Difference]: With dead ends: 69705 [2019-09-08 13:22:06,489 INFO L226 Difference]: Without dead ends: 62647 [2019-09-08 13:22:06,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-09-08 13:22:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62647 states. [2019-09-08 13:22:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62647 to 31409. [2019-09-08 13:22:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31409 states. [2019-09-08 13:22:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31409 states to 31409 states and 49097 transitions. [2019-09-08 13:22:08,610 INFO L78 Accepts]: Start accepts. Automaton has 31409 states and 49097 transitions. Word has length 328 [2019-09-08 13:22:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:08,611 INFO L475 AbstractCegarLoop]: Abstraction has 31409 states and 49097 transitions. [2019-09-08 13:22:08,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:22:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 31409 states and 49097 transitions. [2019-09-08 13:22:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:22:08,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:08,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:22:08,636 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:08,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:08,637 INFO L82 PathProgramCache]: Analyzing trace with hash 979470509, now seen corresponding path program 1 times [2019-09-08 13:22:08,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:08,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:08,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:09,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:22:09,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:09,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:22:09,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:22:09,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:22:09,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:22:09,297 INFO L87 Difference]: Start difference. First operand 31409 states and 49097 transitions. Second operand 9 states. [2019-09-08 13:22:13,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:22:13,063 INFO L93 Difference]: Finished difference Result 58733 states and 92776 transitions. [2019-09-08 13:22:13,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:22:13,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 328 [2019-09-08 13:22:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:22:13,091 INFO L225 Difference]: With dead ends: 58733 [2019-09-08 13:22:13,091 INFO L226 Difference]: Without dead ends: 29782 [2019-09-08 13:22:13,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:22:13,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29782 states. [2019-09-08 13:22:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29782 to 16624. [2019-09-08 13:22:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16624 states. [2019-09-08 13:22:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16624 states to 16624 states and 25588 transitions. [2019-09-08 13:22:14,082 INFO L78 Accepts]: Start accepts. Automaton has 16624 states and 25588 transitions. Word has length 328 [2019-09-08 13:22:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:14,083 INFO L475 AbstractCegarLoop]: Abstraction has 16624 states and 25588 transitions. [2019-09-08 13:22:14,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:22:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 16624 states and 25588 transitions. [2019-09-08 13:22:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:22:14,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:14,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:22:14,090 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:14,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:14,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1113342249, now seen corresponding path program 1 times [2019-09-08 13:22:14,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:14,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:14,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:14,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:14,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:22:14,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:14,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:22:14,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:22:14,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:22:14,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:22:14,662 INFO L87 Difference]: Start difference. First operand 16624 states and 25588 transitions. Second operand 4 states. [2019-09-08 13:22:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:22:16,680 INFO L93 Difference]: Finished difference Result 48895 states and 75260 transitions. [2019-09-08 13:22:16,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:22:16,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-08 13:22:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:22:16,722 INFO L225 Difference]: With dead ends: 48895 [2019-09-08 13:22:16,723 INFO L226 Difference]: Without dead ends: 32343 [2019-09-08 13:22:16,747 INFO L628 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-09-08 13:22:16,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32343 states. [2019-09-08 13:22:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32343 to 32341. [2019-09-08 13:22:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32341 states. [2019-09-08 13:22:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32341 states to 32341 states and 49559 transitions. [2019-09-08 13:22:18,802 INFO L78 Accepts]: Start accepts. Automaton has 32341 states and 49559 transitions. Word has length 328 [2019-09-08 13:22:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:18,803 INFO L475 AbstractCegarLoop]: Abstraction has 32341 states and 49559 transitions. [2019-09-08 13:22:18,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:22:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 32341 states and 49559 transitions. [2019-09-08 13:22:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:22:18,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:18,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:22:18,816 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:18,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:18,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1102800965, now seen corresponding path program 1 times [2019-09-08 13:22:18,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:18,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:18,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:18,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:18,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:22:19,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:19,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:22:19,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:22:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:22:19,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:19,044 INFO L87 Difference]: Start difference. First operand 32341 states and 49559 transitions. Second operand 3 states. [2019-09-08 13:22:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:22:23,261 INFO L93 Difference]: Finished difference Result 93897 states and 143655 transitions. [2019-09-08 13:22:23,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:22:23,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:22:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:22:23,336 INFO L225 Difference]: With dead ends: 93897 [2019-09-08 13:22:23,336 INFO L226 Difference]: Without dead ends: 62805 [2019-09-08 13:22:23,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62805 states. [2019-09-08 13:22:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62805 to 62803. [2019-09-08 13:22:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62803 states. [2019-09-08 13:22:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62803 states to 62803 states and 95776 transitions. [2019-09-08 13:22:27,375 INFO L78 Accepts]: Start accepts. Automaton has 62803 states and 95776 transitions. Word has length 330 [2019-09-08 13:22:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:27,375 INFO L475 AbstractCegarLoop]: Abstraction has 62803 states and 95776 transitions. [2019-09-08 13:22:27,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:22:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 62803 states and 95776 transitions. [2019-09-08 13:22:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:22:27,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:27,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:22:27,406 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:27,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:27,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1097536706, now seen corresponding path program 1 times [2019-09-08 13:22:27,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:27,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:27,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:27,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:27,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:22:27,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:27,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:22:27,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:22:27,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:22:27,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:27,627 INFO L87 Difference]: Start difference. First operand 62803 states and 95776 transitions. Second operand 3 states. [2019-09-08 13:22:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:22:34,879 INFO L93 Difference]: Finished difference Result 155971 states and 240220 transitions. [2019-09-08 13:22:34,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:22:34,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 13:22:34,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:22:35,023 INFO L225 Difference]: With dead ends: 155971 [2019-09-08 13:22:35,023 INFO L226 Difference]: Without dead ends: 100357 [2019-09-08 13:22:35,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100357 states. [2019-09-08 13:22:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100357 to 91939. [2019-09-08 13:22:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91939 states. [2019-09-08 13:22:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91939 states to 91939 states and 141396 transitions. [2019-09-08 13:22:42,906 INFO L78 Accepts]: Start accepts. Automaton has 91939 states and 141396 transitions. Word has length 332 [2019-09-08 13:22:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:42,907 INFO L475 AbstractCegarLoop]: Abstraction has 91939 states and 141396 transitions. [2019-09-08 13:22:42,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:22:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 91939 states and 141396 transitions. [2019-09-08 13:22:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:22:42,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:42,940 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:22:42,940 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:42,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:42,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1777906688, now seen corresponding path program 1 times [2019-09-08 13:22:42,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:42,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:42,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:22:43,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:43,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:22:43,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:22:43,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:22:43,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:43,202 INFO L87 Difference]: Start difference. First operand 91939 states and 141396 transitions. Second operand 3 states. [2019-09-08 13:22:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:22:56,864 INFO L93 Difference]: Finished difference Result 270880 states and 416288 transitions. [2019-09-08 13:22:56,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:22:56,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 13:22:56,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:22:57,103 INFO L225 Difference]: With dead ends: 270880 [2019-09-08 13:22:57,103 INFO L226 Difference]: Without dead ends: 180288 [2019-09-08 13:22:57,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180288 states. [2019-09-08 13:23:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180288 to 180286. [2019-09-08 13:23:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180286 states. [2019-09-08 13:23:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180286 states to 180286 states and 275699 transitions. [2019-09-08 13:23:12,752 INFO L78 Accepts]: Start accepts. Automaton has 180286 states and 275699 transitions. Word has length 332 [2019-09-08 13:23:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:23:12,752 INFO L475 AbstractCegarLoop]: Abstraction has 180286 states and 275699 transitions. [2019-09-08 13:23:12,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:23:12,752 INFO L276 IsEmpty]: Start isEmpty. Operand 180286 states and 275699 transitions. [2019-09-08 13:23:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:23:12,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:23:12,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:23:12,800 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:23:12,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:23:12,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2098323555, now seen corresponding path program 1 times [2019-09-08 13:23:12,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:23:12,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:23:12,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:23:12,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:23:12,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:23:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:23:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:23:13,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:23:13,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:23:13,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:23:13,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:23:13,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:23:13,077 INFO L87 Difference]: Start difference. First operand 180286 states and 275699 transitions. Second operand 4 states. [2019-09-08 13:23:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:23:38,362 INFO L93 Difference]: Finished difference Result 487846 states and 744502 transitions. [2019-09-08 13:23:38,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:23:38,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-08 13:23:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:23:38,754 INFO L225 Difference]: With dead ends: 487846 [2019-09-08 13:23:38,754 INFO L226 Difference]: Without dead ends: 310852 [2019-09-08 13:23:38,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:23:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310852 states. [2019-09-08 13:23:58,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310852 to 176156. [2019-09-08 13:23:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176156 states. [2019-09-08 13:23:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176156 states to 176156 states and 269271 transitions. [2019-09-08 13:23:58,384 INFO L78 Accepts]: Start accepts. Automaton has 176156 states and 269271 transitions. Word has length 332 [2019-09-08 13:23:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:23:58,384 INFO L475 AbstractCegarLoop]: Abstraction has 176156 states and 269271 transitions. [2019-09-08 13:23:58,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:23:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 176156 states and 269271 transitions. [2019-09-08 13:23:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-08 13:23:58,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:23:58,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:23:58,428 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:23:58,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:23:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash 46844777, now seen corresponding path program 1 times [2019-09-08 13:23:58,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:23:58,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:23:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:23:58,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:23:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:23:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:23:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:23:58,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:23:58,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:23:58,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:23:58,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:23:58,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:23:58,565 INFO L87 Difference]: Start difference. First operand 176156 states and 269271 transitions. Second operand 3 states. [2019-09-08 13:24:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:24:24,832 INFO L93 Difference]: Finished difference Result 477997 states and 729555 transitions. [2019-09-08 13:24:24,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:24:24,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-08 13:24:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:24:25,307 INFO L225 Difference]: With dead ends: 477997 [2019-09-08 13:24:25,307 INFO L226 Difference]: Without dead ends: 311175 [2019-09-08 13:24:25,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:24:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311175 states. [2019-09-08 13:24:46,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311175 to 176637. [2019-09-08 13:24:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176637 states. [2019-09-08 13:24:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176637 states to 176637 states and 269869 transitions. [2019-09-08 13:24:47,614 INFO L78 Accepts]: Start accepts. Automaton has 176637 states and 269869 transitions. Word has length 335 [2019-09-08 13:24:47,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:24:47,614 INFO L475 AbstractCegarLoop]: Abstraction has 176637 states and 269869 transitions. [2019-09-08 13:24:47,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:24:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 176637 states and 269869 transitions. [2019-09-08 13:24:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 13:24:47,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:24:47,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:24:47,655 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:24:47,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:24:47,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1969439735, now seen corresponding path program 1 times [2019-09-08 13:24:47,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:24:47,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:24:47,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:47,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:24:47,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:24:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:24:48,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:24:48,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:24:48,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:24:48,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:24:48,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:24:48,279 INFO L87 Difference]: Start difference. First operand 176637 states and 269869 transitions. Second operand 4 states. [2019-09-08 13:25:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:25:18,313 INFO L93 Difference]: Finished difference Result 510599 states and 779964 transitions. [2019-09-08 13:25:18,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:25:18,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2019-09-08 13:25:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:25:18,760 INFO L225 Difference]: With dead ends: 510599 [2019-09-08 13:25:18,761 INFO L226 Difference]: Without dead ends: 334180 [2019-09-08 13:25:18,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:25:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334180 states. [2019-09-08 13:25:53,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334180 to 334178. [2019-09-08 13:25:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334178 states. [2019-09-08 13:25:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334178 states to 334178 states and 507815 transitions. [2019-09-08 13:25:54,402 INFO L78 Accepts]: Start accepts. Automaton has 334178 states and 507815 transitions. Word has length 336 [2019-09-08 13:25:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:25:54,402 INFO L475 AbstractCegarLoop]: Abstraction has 334178 states and 507815 transitions. [2019-09-08 13:25:54,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:25:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 334178 states and 507815 transitions. [2019-09-08 13:25:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-08 13:25:54,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:25:54,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:25:54,498 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:25:54,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:25:54,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2134112359, now seen corresponding path program 1 times [2019-09-08 13:25:54,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:25:54,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:25:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:54,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:25:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:25:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:25:54,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:25:54,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:25:54,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:25:54,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:25:54,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:25:54,762 INFO L87 Difference]: Start difference. First operand 334178 states and 507815 transitions. Second operand 3 states. [2019-09-08 13:27:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:01,823 INFO L93 Difference]: Finished difference Result 980081 states and 1489480 transitions. [2019-09-08 13:27:01,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:01,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-09-08 13:27:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:03,193 INFO L225 Difference]: With dead ends: 980081 [2019-09-08 13:27:03,194 INFO L226 Difference]: Without dead ends: 651378 [2019-09-08 13:27:03,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:03,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651378 states. [2019-09-08 13:28:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651378 to 651072. [2019-09-08 13:28:19,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651072 states. [2019-09-08 13:28:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651072 states to 651072 states and 985231 transitions. [2019-09-08 13:28:20,240 INFO L78 Accepts]: Start accepts. Automaton has 651072 states and 985231 transitions. Word has length 337 [2019-09-08 13:28:20,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:20,240 INFO L475 AbstractCegarLoop]: Abstraction has 651072 states and 985231 transitions. [2019-09-08 13:28:20,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 651072 states and 985231 transitions. [2019-09-08 13:28:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-08 13:28:20,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:20,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:28:20,451 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:20,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:20,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1690616902, now seen corresponding path program 1 times [2019-09-08 13:28:20,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:20,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:20,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:20,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:20,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:28:20,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:20,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:28:20,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:28:20,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:28:20,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:28:20,735 INFO L87 Difference]: Start difference. First operand 651072 states and 985231 transitions. Second operand 4 states. [2019-09-08 13:29:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:29,923 INFO L93 Difference]: Finished difference Result 1210820 states and 1830254 transitions. [2019-09-08 13:29:29,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:29,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 338 [2019-09-08 13:29:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:30,816 INFO L225 Difference]: With dead ends: 1210820 [2019-09-08 13:29:30,816 INFO L226 Difference]: Without dead ends: 576237 [2019-09-08 13:29:31,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:29:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576237 states. [2019-09-08 13:30:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576237 to 575019. [2019-09-08 13:30:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575019 states. [2019-09-08 13:30:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575019 states to 575019 states and 868880 transitions. [2019-09-08 13:30:34,331 INFO L78 Accepts]: Start accepts. Automaton has 575019 states and 868880 transitions. Word has length 338 [2019-09-08 13:30:34,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:34,331 INFO L475 AbstractCegarLoop]: Abstraction has 575019 states and 868880 transitions. [2019-09-08 13:30:34,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:30:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 575019 states and 868880 transitions. [2019-09-08 13:30:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 13:30:34,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:34,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:34,488 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:34,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1208576600, now seen corresponding path program 1 times [2019-09-08 13:30:34,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:34,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:34,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:34,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:30:34,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:34,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:34,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:34,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:34,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:34,642 INFO L87 Difference]: Start difference. First operand 575019 states and 868880 transitions. Second operand 3 states. [2019-09-08 13:32:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:27,849 INFO L93 Difference]: Finished difference Result 1535527 states and 2345386 transitions. [2019-09-08 13:32:27,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:32:27,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-09-08 13:32:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:29,547 INFO L225 Difference]: With dead ends: 1535527 [2019-09-08 13:32:29,547 INFO L226 Difference]: Without dead ends: 998541 [2019-09-08 13:32:29,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:32:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998541 states.