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.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:14:50,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:14:50,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:14:50,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:14:50,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:14:50,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:14:50,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:14:50,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:14:50,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:14:50,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:14:50,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:14:50,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:14:50,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:14:50,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:14:50,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:14:50,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:14:50,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:14:50,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:14:50,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:14:50,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:14:50,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:14:50,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:14:50,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:14:50,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:14:50,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:14:50,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:14:50,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:14:50,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:14:50,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:14:50,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:14:50,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:14:50,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:14:50,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:14:50,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:14:50,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:14:50,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:14:50,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:14:50,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:14:50,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:14:50,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:14:50,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:14:50,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:14:51,015 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:14:51,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:14:51,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:14:51,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:14:51,019 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:14:51,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:14:51,019 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:14:51,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:14:51,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:14:51,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:14:51,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:14:51,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:14:51,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:14:51,022 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:14:51,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:14:51,022 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:14:51,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:14:51,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:14:51,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:14:51,023 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:14:51,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:14:51,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:14:51,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:14:51,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:14:51,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:14:51,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:14:51,025 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:14:51,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:14:51,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:14:51,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:14:51,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:14:51,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:14:51,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:14:51,103 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:14:51,104 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.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:14:51,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d13a027/33e33a3ee5044a4e92b27d448f0a8d14/FLAG79a860d2c [2019-09-08 13:14:51,823 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:14:51,824 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:14:51,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d13a027/33e33a3ee5044a4e92b27d448f0a8d14/FLAG79a860d2c [2019-09-08 13:14:52,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d13a027/33e33a3ee5044a4e92b27d448f0a8d14 [2019-09-08 13:14:52,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:14:52,023 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:14:52,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:14:52,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:14:52,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:14:52,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:14:52" (1/1) ... [2019-09-08 13:14:52,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1332b692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:52, skipping insertion in model container [2019-09-08 13:14:52,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:14:52" (1/1) ... [2019-09-08 13:14:52,038 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:14:52,139 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:14:52,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:14:52,993 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:14:53,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:14:53,432 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:14:53,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:53 WrapperNode [2019-09-08 13:14:53,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:14:53,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:14:53,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:14:53,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:14:53,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:53" (1/1) ... [2019-09-08 13:14:53,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:53" (1/1) ... [2019-09-08 13:14:53,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:53" (1/1) ... [2019-09-08 13:14:53,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:53" (1/1) ... [2019-09-08 13:14:53,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:53" (1/1) ... [2019-09-08 13:14:53,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:53" (1/1) ... [2019-09-08 13:14:53,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:53" (1/1) ... [2019-09-08 13:14:53,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:14:53,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:14:53,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:14:53,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:14:53,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:53" (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:14:53,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:14:53,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:14:53,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:14:53,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:14:53,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:14:53,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:14:53,664 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:14:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:14:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:14:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:14:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:14:53,665 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:14:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:14:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:14:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:14:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:14:53,666 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:14:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:14:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:14:56,154 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:14:56,155 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:14:56,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:14:56 BoogieIcfgContainer [2019-09-08 13:14:56,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:14:56,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:14:56,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:14:56,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:14:56,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:14:52" (1/3) ... [2019-09-08 13:14:56,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cfa903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:14:56, skipping insertion in model container [2019-09-08 13:14:56,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:53" (2/3) ... [2019-09-08 13:14:56,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cfa903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:14:56, skipping insertion in model container [2019-09-08 13:14:56,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:14:56" (3/3) ... [2019-09-08 13:14:56,165 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 13:14:56,175 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:14:56,184 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:14:56,201 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:14:56,239 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:14:56,240 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:14:56,240 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:14:56,240 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:14:56,240 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:14:56,240 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:14:56,241 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:14:56,241 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:14:56,241 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:14:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states. [2019-09-08 13:14:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 13:14:56,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:56,302 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:56,304 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:56,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:56,310 INFO L82 PathProgramCache]: Analyzing trace with hash 927124790, now seen corresponding path program 1 times [2019-09-08 13:14:56,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:56,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:56,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:56,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:56,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:57,686 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:14:57,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:57,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:14:57,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:14:57,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:14:57,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:14:57,712 INFO L87 Difference]: Start difference. First operand 641 states. Second operand 4 states. [2019-09-08 13:14:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:58,099 INFO L93 Difference]: Finished difference Result 1877 states and 3338 transitions. [2019-09-08 13:14:58,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:14:58,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2019-09-08 13:14:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:58,182 INFO L225 Difference]: With dead ends: 1877 [2019-09-08 13:14:58,182 INFO L226 Difference]: Without dead ends: 1243 [2019-09-08 13:14:58,191 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:14:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2019-09-08 13:14:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1241. [2019-09-08 13:14:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-09-08 13:14:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1945 transitions. [2019-09-08 13:14:58,320 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1945 transitions. Word has length 250 [2019-09-08 13:14:58,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:58,321 INFO L475 AbstractCegarLoop]: Abstraction has 1241 states and 1945 transitions. [2019-09-08 13:14:58,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:14:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1945 transitions. [2019-09-08 13:14:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 13:14:58,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:58,330 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] [2019-09-08 13:14:58,330 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:58,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:58,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1671693487, now seen corresponding path program 1 times [2019-09-08 13:14:58,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:58,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:58,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:58,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:58,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:58,508 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:14:58,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:58,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:58,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:58,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:58,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:58,520 INFO L87 Difference]: Start difference. First operand 1241 states and 1945 transitions. Second operand 3 states. [2019-09-08 13:14:58,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:58,652 INFO L93 Difference]: Finished difference Result 3678 states and 5764 transitions. [2019-09-08 13:14:58,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:14:58,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-09-08 13:14:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:58,668 INFO L225 Difference]: With dead ends: 3678 [2019-09-08 13:14:58,668 INFO L226 Difference]: Without dead ends: 2462 [2019-09-08 13:14:58,673 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:14:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2019-09-08 13:14:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 1254. [2019-09-08 13:14:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2019-09-08 13:14:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1964 transitions. [2019-09-08 13:14:58,771 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1964 transitions. Word has length 252 [2019-09-08 13:14:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:58,771 INFO L475 AbstractCegarLoop]: Abstraction has 1254 states and 1964 transitions. [2019-09-08 13:14:58,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:14:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1964 transitions. [2019-09-08 13:14:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 13:14:58,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:58,777 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] [2019-09-08 13:14:58,778 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:58,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:58,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1734716020, now seen corresponding path program 1 times [2019-09-08 13:14:58,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:58,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:58,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:58,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:59,108 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:14:59,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:59,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:59,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:59,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:59,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:59,110 INFO L87 Difference]: Start difference. First operand 1254 states and 1964 transitions. Second operand 3 states. [2019-09-08 13:14:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:59,278 INFO L93 Difference]: Finished difference Result 3563 states and 5555 transitions. [2019-09-08 13:14:59,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:14:59,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-09-08 13:14:59,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:59,292 INFO L225 Difference]: With dead ends: 3563 [2019-09-08 13:14:59,292 INFO L226 Difference]: Without dead ends: 2451 [2019-09-08 13:14:59,296 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:14:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2019-09-08 13:14:59,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2449. [2019-09-08 13:14:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2449 states. [2019-09-08 13:14:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 3819 transitions. [2019-09-08 13:14:59,409 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 3819 transitions. Word has length 252 [2019-09-08 13:14:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:59,410 INFO L475 AbstractCegarLoop]: Abstraction has 2449 states and 3819 transitions. [2019-09-08 13:14:59,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:14:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3819 transitions. [2019-09-08 13:14:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 13:14:59,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:59,418 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] [2019-09-08 13:14:59,418 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:59,419 INFO L82 PathProgramCache]: Analyzing trace with hash -479626916, now seen corresponding path program 1 times [2019-09-08 13:14:59,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:59,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:59,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:59,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:59,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:59,588 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:14:59,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:59,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:59,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:59,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:59,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:59,591 INFO L87 Difference]: Start difference. First operand 2449 states and 3819 transitions. Second operand 3 states. [2019-09-08 13:14:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:59,802 INFO L93 Difference]: Finished difference Result 7234 states and 11270 transitions. [2019-09-08 13:14:59,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:14:59,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-08 13:14:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:59,829 INFO L225 Difference]: With dead ends: 7234 [2019-09-08 13:14:59,829 INFO L226 Difference]: Without dead ends: 4845 [2019-09-08 13:14:59,836 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:14:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4845 states. [2019-09-08 13:14:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4845 to 2467. [2019-09-08 13:14:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2019-09-08 13:15:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3840 transitions. [2019-09-08 13:15:00,010 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3840 transitions. Word has length 253 [2019-09-08 13:15:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:00,011 INFO L475 AbstractCegarLoop]: Abstraction has 2467 states and 3840 transitions. [2019-09-08 13:15:00,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3840 transitions. [2019-09-08 13:15:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 13:15:00,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:00,020 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] [2019-09-08 13:15:00,021 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1925243986, now seen corresponding path program 1 times [2019-09-08 13:15:00,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:00,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:00,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:00,167 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:15:00,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:00,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:00,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:00,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:00,170 INFO L87 Difference]: Start difference. First operand 2467 states and 3840 transitions. Second operand 3 states. [2019-09-08 13:15:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:00,499 INFO L93 Difference]: Finished difference Result 4959 states and 7762 transitions. [2019-09-08 13:15:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:00,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-08 13:15:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:00,521 INFO L225 Difference]: With dead ends: 4959 [2019-09-08 13:15:00,521 INFO L226 Difference]: Without dead ends: 3315 [2019-09-08 13:15:00,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2019-09-08 13:15:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 2955. [2019-09-08 13:15:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2955 states. [2019-09-08 13:15:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 4646 transitions. [2019-09-08 13:15:00,773 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 4646 transitions. Word has length 254 [2019-09-08 13:15:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:00,774 INFO L475 AbstractCegarLoop]: Abstraction has 2955 states and 4646 transitions. [2019-09-08 13:15:00,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4646 transitions. [2019-09-08 13:15:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 13:15:00,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:00,782 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] [2019-09-08 13:15:00,782 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:00,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:00,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2048251047, now seen corresponding path program 1 times [2019-09-08 13:15:00,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:00,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:00,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:00,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:00,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:01,117 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:15:01,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:01,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:01,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:01,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:01,120 INFO L87 Difference]: Start difference. First operand 2955 states and 4646 transitions. Second operand 3 states. [2019-09-08 13:15:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:01,535 INFO L93 Difference]: Finished difference Result 8406 states and 13163 transitions. [2019-09-08 13:15:01,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:01,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-08 13:15:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:01,567 INFO L225 Difference]: With dead ends: 8406 [2019-09-08 13:15:01,567 INFO L226 Difference]: Without dead ends: 5696 [2019-09-08 13:15:01,577 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:15:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5696 states. [2019-09-08 13:15:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5696 to 5694. [2019-09-08 13:15:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5694 states. [2019-09-08 13:15:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 8892 transitions. [2019-09-08 13:15:01,937 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 8892 transitions. Word has length 254 [2019-09-08 13:15:01,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:01,940 INFO L475 AbstractCegarLoop]: Abstraction has 5694 states and 8892 transitions. [2019-09-08 13:15:01,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 8892 transitions. [2019-09-08 13:15:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 13:15:01,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:01,957 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] [2019-09-08 13:15:01,957 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:01,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:01,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1535732676, now seen corresponding path program 1 times [2019-09-08 13:15:01,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:01,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:01,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:01,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:01,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:02,292 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:15:02,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:02,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:15:02,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:15:02,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:15:02,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:15:02,296 INFO L87 Difference]: Start difference. First operand 5694 states and 8892 transitions. Second operand 4 states. [2019-09-08 13:15:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:03,065 INFO L93 Difference]: Finished difference Result 15558 states and 24141 transitions. [2019-09-08 13:15:03,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:15:03,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-09-08 13:15:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:03,125 INFO L225 Difference]: With dead ends: 15558 [2019-09-08 13:15:03,126 INFO L226 Difference]: Without dead ends: 10404 [2019-09-08 13:15:03,140 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:15:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10404 states. [2019-09-08 13:15:03,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10404 to 5929. [2019-09-08 13:15:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5929 states. [2019-09-08 13:15:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5929 states to 5929 states and 9280 transitions. [2019-09-08 13:15:03,564 INFO L78 Accepts]: Start accepts. Automaton has 5929 states and 9280 transitions. Word has length 254 [2019-09-08 13:15:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:03,565 INFO L475 AbstractCegarLoop]: Abstraction has 5929 states and 9280 transitions. [2019-09-08 13:15:03,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:15:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5929 states and 9280 transitions. [2019-09-08 13:15:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 13:15:03,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:03,578 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] [2019-09-08 13:15:03,578 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:03,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:03,579 INFO L82 PathProgramCache]: Analyzing trace with hash 602759059, now seen corresponding path program 1 times [2019-09-08 13:15:03,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:03,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:03,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:03,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:03,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:03,783 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:15:03,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:03,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:03,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:03,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:03,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:03,785 INFO L87 Difference]: Start difference. First operand 5929 states and 9280 transitions. Second operand 3 states. [2019-09-08 13:15:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:04,263 INFO L93 Difference]: Finished difference Result 12093 states and 19118 transitions. [2019-09-08 13:15:04,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:04,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-08 13:15:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:04,287 INFO L225 Difference]: With dead ends: 12093 [2019-09-08 13:15:04,287 INFO L226 Difference]: Without dead ends: 8239 [2019-09-08 13:15:04,298 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:15:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8239 states. [2019-09-08 13:15:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8239 to 7653. [2019-09-08 13:15:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7653 states. [2019-09-08 13:15:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7653 states to 7653 states and 12112 transitions. [2019-09-08 13:15:04,876 INFO L78 Accepts]: Start accepts. Automaton has 7653 states and 12112 transitions. Word has length 256 [2019-09-08 13:15:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:04,877 INFO L475 AbstractCegarLoop]: Abstraction has 7653 states and 12112 transitions. [2019-09-08 13:15:04,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 7653 states and 12112 transitions. [2019-09-08 13:15:04,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 13:15:04,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:04,898 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] [2019-09-08 13:15:04,898 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:04,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:04,899 INFO L82 PathProgramCache]: Analyzing trace with hash -774787013, now seen corresponding path program 1 times [2019-09-08 13:15:04,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:04,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:04,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:04,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:04,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:05,108 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:15:05,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:05,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:05,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:05,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:05,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:05,110 INFO L87 Difference]: Start difference. First operand 7653 states and 12112 transitions. Second operand 3 states. [2019-09-08 13:15:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:05,860 INFO L93 Difference]: Finished difference Result 21389 states and 33617 transitions. [2019-09-08 13:15:05,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:05,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-08 13:15:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:05,906 INFO L225 Difference]: With dead ends: 21389 [2019-09-08 13:15:05,907 INFO L226 Difference]: Without dead ends: 14539 [2019-09-08 13:15:05,928 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:15:05,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14539 states. [2019-09-08 13:15:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14539 to 7757. [2019-09-08 13:15:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7757 states. [2019-09-08 13:15:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7757 states to 7757 states and 12255 transitions. [2019-09-08 13:15:06,607 INFO L78 Accepts]: Start accepts. Automaton has 7757 states and 12255 transitions. Word has length 256 [2019-09-08 13:15:06,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:06,607 INFO L475 AbstractCegarLoop]: Abstraction has 7757 states and 12255 transitions. [2019-09-08 13:15:06,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:06,607 INFO L276 IsEmpty]: Start isEmpty. Operand 7757 states and 12255 transitions. [2019-09-08 13:15:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 13:15:06,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:06,621 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] [2019-09-08 13:15:06,622 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:06,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:06,622 INFO L82 PathProgramCache]: Analyzing trace with hash -638003002, now seen corresponding path program 1 times [2019-09-08 13:15:06,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:06,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:06,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:06,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:06,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:07,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:15:07,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:07,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:15:07,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:15:07,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:15:07,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:15:07,141 INFO L87 Difference]: Start difference. First operand 7757 states and 12255 transitions. Second operand 4 states. [2019-09-08 13:15:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:08,292 INFO L93 Difference]: Finished difference Result 22667 states and 35788 transitions. [2019-09-08 13:15:08,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:15:08,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2019-09-08 13:15:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:08,335 INFO L225 Difference]: With dead ends: 22667 [2019-09-08 13:15:08,335 INFO L226 Difference]: Without dead ends: 14982 [2019-09-08 13:15:08,356 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:15:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14982 states. [2019-09-08 13:15:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14982 to 14980. [2019-09-08 13:15:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14980 states. [2019-09-08 13:15:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14980 states to 14980 states and 23513 transitions. [2019-09-08 13:15:09,211 INFO L78 Accepts]: Start accepts. Automaton has 14980 states and 23513 transitions. Word has length 257 [2019-09-08 13:15:09,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:09,212 INFO L475 AbstractCegarLoop]: Abstraction has 14980 states and 23513 transitions. [2019-09-08 13:15:09,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:15:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 14980 states and 23513 transitions. [2019-09-08 13:15:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 13:15:09,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:09,234 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] [2019-09-08 13:15:09,235 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:09,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:09,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1476557971, now seen corresponding path program 1 times [2019-09-08 13:15:09,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:09,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:09,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:09,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:09,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:09,942 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:15:09,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:09,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:09,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:09,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:09,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:09,944 INFO L87 Difference]: Start difference. First operand 14980 states and 23513 transitions. Second operand 3 states. [2019-09-08 13:15:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:11,453 INFO L93 Difference]: Finished difference Result 42428 states and 66267 transitions. [2019-09-08 13:15:11,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:11,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-09-08 13:15:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:11,511 INFO L225 Difference]: With dead ends: 42428 [2019-09-08 13:15:11,512 INFO L226 Difference]: Without dead ends: 28845 [2019-09-08 13:15:11,540 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:15:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28845 states. [2019-09-08 13:15:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28845 to 28843. [2019-09-08 13:15:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28843 states. [2019-09-08 13:15:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28843 states to 28843 states and 44934 transitions. [2019-09-08 13:15:12,946 INFO L78 Accepts]: Start accepts. Automaton has 28843 states and 44934 transitions. Word has length 259 [2019-09-08 13:15:12,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:12,946 INFO L475 AbstractCegarLoop]: Abstraction has 28843 states and 44934 transitions. [2019-09-08 13:15:12,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 28843 states and 44934 transitions. [2019-09-08 13:15:12,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 13:15:12,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:12,976 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:12,976 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:12,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:12,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1551866172, now seen corresponding path program 1 times [2019-09-08 13:15:12,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:12,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:12,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:12,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:12,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:13,101 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:15:13,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:13,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:13,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:13,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:13,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:13,103 INFO L87 Difference]: Start difference. First operand 28843 states and 44934 transitions. Second operand 3 states. [2019-09-08 13:15:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:15,885 INFO L93 Difference]: Finished difference Result 81895 states and 127067 transitions. [2019-09-08 13:15:15,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:15,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-09-08 13:15:15,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:15,987 INFO L225 Difference]: With dead ends: 81895 [2019-09-08 13:15:15,987 INFO L226 Difference]: Without dead ends: 55467 [2019-09-08 13:15:16,042 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:15:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55467 states. [2019-09-08 13:15:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55467 to 29329. [2019-09-08 13:15:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29329 states. [2019-09-08 13:15:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29329 states to 29329 states and 45487 transitions. [2019-09-08 13:15:17,583 INFO L78 Accepts]: Start accepts. Automaton has 29329 states and 45487 transitions. Word has length 259 [2019-09-08 13:15:17,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:17,583 INFO L475 AbstractCegarLoop]: Abstraction has 29329 states and 45487 transitions. [2019-09-08 13:15:17,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 29329 states and 45487 transitions. [2019-09-08 13:15:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 13:15:17,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:17,613 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] [2019-09-08 13:15:17,613 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:17,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:17,614 INFO L82 PathProgramCache]: Analyzing trace with hash -981358940, now seen corresponding path program 1 times [2019-09-08 13:15:17,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:17,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:17,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:17,965 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:15:17,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:17,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:17,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:17,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:17,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:17,967 INFO L87 Difference]: Start difference. First operand 29329 states and 45487 transitions. Second operand 3 states. [2019-09-08 13:15:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:20,540 INFO L93 Difference]: Finished difference Result 64493 states and 102009 transitions. [2019-09-08 13:15:20,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:20,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-08 13:15:20,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:20,599 INFO L225 Difference]: With dead ends: 64493 [2019-09-08 13:15:20,599 INFO L226 Difference]: Without dead ends: 43603 [2019-09-08 13:15:20,627 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:15:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43603 states. [2019-09-08 13:15:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43603 to 41153. [2019-09-08 13:15:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41153 states. [2019-09-08 13:15:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41153 states to 41153 states and 64671 transitions. [2019-09-08 13:15:22,752 INFO L78 Accepts]: Start accepts. Automaton has 41153 states and 64671 transitions. Word has length 260 [2019-09-08 13:15:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:22,753 INFO L475 AbstractCegarLoop]: Abstraction has 41153 states and 64671 transitions. [2019-09-08 13:15:22,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 41153 states and 64671 transitions. [2019-09-08 13:15:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 13:15:22,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:22,769 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] [2019-09-08 13:15:22,769 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:22,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:22,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1027308604, now seen corresponding path program 1 times [2019-09-08 13:15:22,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:22,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:22,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:22,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:22,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:22,982 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:15:22,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:22,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:22,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:22,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:22,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:22,984 INFO L87 Difference]: Start difference. First operand 41153 states and 64671 transitions. Second operand 3 states. [2019-09-08 13:15:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:27,730 INFO L93 Difference]: Finished difference Result 120250 states and 188853 transitions. [2019-09-08 13:15:27,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:27,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-08 13:15:27,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:27,826 INFO L225 Difference]: With dead ends: 120250 [2019-09-08 13:15:27,826 INFO L226 Difference]: Without dead ends: 80592 [2019-09-08 13:15:27,871 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:15:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80592 states. [2019-09-08 13:15:31,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80592 to 80590. [2019-09-08 13:15:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80590 states. [2019-09-08 13:15:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80590 states to 80590 states and 125989 transitions. [2019-09-08 13:15:31,647 INFO L78 Accepts]: Start accepts. Automaton has 80590 states and 125989 transitions. Word has length 260 [2019-09-08 13:15:31,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:31,647 INFO L475 AbstractCegarLoop]: Abstraction has 80590 states and 125989 transitions. [2019-09-08 13:15:31,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 80590 states and 125989 transitions. [2019-09-08 13:15:31,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 13:15:31,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:31,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:31,676 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:31,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:31,676 INFO L82 PathProgramCache]: Analyzing trace with hash 363775905, now seen corresponding path program 1 times [2019-09-08 13:15:31,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:31,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:31,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:31,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:31,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:31,924 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:15:31,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:31,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:15:31,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:15:31,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:15:31,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:15:31,926 INFO L87 Difference]: Start difference. First operand 80590 states and 125989 transitions. Second operand 4 states. [2019-09-08 13:15:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:37,277 INFO L93 Difference]: Finished difference Result 147172 states and 229818 transitions. [2019-09-08 13:15:37,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:15:37,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 260 [2019-09-08 13:15:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:37,368 INFO L225 Difference]: With dead ends: 147172 [2019-09-08 13:15:37,368 INFO L226 Difference]: Without dead ends: 70734 [2019-09-08 13:15:37,424 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:15:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70734 states. [2019-09-08 13:15:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70734 to 70582. [2019-09-08 13:15:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70582 states. [2019-09-08 13:15:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70582 states to 70582 states and 110311 transitions. [2019-09-08 13:15:40,898 INFO L78 Accepts]: Start accepts. Automaton has 70582 states and 110311 transitions. Word has length 260 [2019-09-08 13:15:40,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:40,899 INFO L475 AbstractCegarLoop]: Abstraction has 70582 states and 110311 transitions. [2019-09-08 13:15:40,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:15:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 70582 states and 110311 transitions. [2019-09-08 13:15:40,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 13:15:40,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:40,929 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] [2019-09-08 13:15:40,929 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:40,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:40,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1448354597, now seen corresponding path program 1 times [2019-09-08 13:15:40,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:40,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:40,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:40,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:40,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:41,168 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:15:41,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:41,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:15:41,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:15:41,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:15:41,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:15:41,170 INFO L87 Difference]: Start difference. First operand 70582 states and 110311 transitions. Second operand 4 states. [2019-09-08 13:15:48,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:48,695 INFO L93 Difference]: Finished difference Result 184901 states and 288258 transitions. [2019-09-08 13:15:48,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:15:48,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-09-08 13:15:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:48,871 INFO L225 Difference]: With dead ends: 184901 [2019-09-08 13:15:48,871 INFO L226 Difference]: Without dead ends: 117611 [2019-09-08 13:15:48,940 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:15:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117611 states. [2019-09-08 13:15:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117611 to 68793. [2019-09-08 13:15:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68793 states. [2019-09-08 13:15:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68793 states to 68793 states and 107473 transitions. [2019-09-08 13:15:52,910 INFO L78 Accepts]: Start accepts. Automaton has 68793 states and 107473 transitions. Word has length 261 [2019-09-08 13:15:52,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:52,910 INFO L475 AbstractCegarLoop]: Abstraction has 68793 states and 107473 transitions. [2019-09-08 13:15:52,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:15:52,910 INFO L276 IsEmpty]: Start isEmpty. Operand 68793 states and 107473 transitions. [2019-09-08 13:15:52,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 13:15:52,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:52,935 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] [2019-09-08 13:15:52,936 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:52,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:52,936 INFO L82 PathProgramCache]: Analyzing trace with hash -706426212, now seen corresponding path program 1 times [2019-09-08 13:15:52,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:52,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:52,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:52,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:52,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:53,401 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:15:53,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:53,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:53,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:53,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:53,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:53,403 INFO L87 Difference]: Start difference. First operand 68793 states and 107473 transitions. Second operand 3 states. [2019-09-08 13:16:00,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:16:00,617 INFO L93 Difference]: Finished difference Result 167654 states and 265600 transitions. [2019-09-08 13:16:00,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:16:00,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-09-08 13:16:00,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:16:00,760 INFO L225 Difference]: With dead ends: 167654 [2019-09-08 13:16:00,760 INFO L226 Difference]: Without dead ends: 110914 [2019-09-08 13:16:00,814 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:16:00,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110914 states. [2019-09-08 13:16:06,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110914 to 104450. [2019-09-08 13:16:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104450 states. [2019-09-08 13:16:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104450 states to 104450 states and 165276 transitions. [2019-09-08 13:16:06,887 INFO L78 Accepts]: Start accepts. Automaton has 104450 states and 165276 transitions. Word has length 263 [2019-09-08 13:16:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:06,888 INFO L475 AbstractCegarLoop]: Abstraction has 104450 states and 165276 transitions. [2019-09-08 13:16:06,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:16:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 104450 states and 165276 transitions. [2019-09-08 13:16:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 13:16:06,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:06,909 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] [2019-09-08 13:16:06,910 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:06,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:06,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1843984235, now seen corresponding path program 1 times [2019-09-08 13:16:06,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:06,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:06,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:06,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:06,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:07,033 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:16:07,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:07,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:16:07,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:16:07,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:16:07,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:16:07,035 INFO L87 Difference]: Start difference. First operand 104450 states and 165276 transitions. Second operand 3 states. [2019-09-08 13:16:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:16:19,305 INFO L93 Difference]: Finished difference Result 281005 states and 444199 transitions. [2019-09-08 13:16:19,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:16:19,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-09-08 13:16:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:16:19,581 INFO L225 Difference]: With dead ends: 281005 [2019-09-08 13:16:19,581 INFO L226 Difference]: Without dead ends: 184731 [2019-09-08 13:16:19,660 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:16:19,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184731 states. [2019-09-08 13:16:26,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184731 to 104931. [2019-09-08 13:16:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104931 states. [2019-09-08 13:16:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104931 states to 104931 states and 165874 transitions. [2019-09-08 13:16:26,837 INFO L78 Accepts]: Start accepts. Automaton has 104931 states and 165874 transitions. Word has length 264 [2019-09-08 13:16:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:26,837 INFO L475 AbstractCegarLoop]: Abstraction has 104931 states and 165874 transitions. [2019-09-08 13:16:26,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:16:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 104931 states and 165874 transitions. [2019-09-08 13:16:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 13:16:26,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:26,861 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] [2019-09-08 13:16:26,861 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:26,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:26,862 INFO L82 PathProgramCache]: Analyzing trace with hash 443412495, now seen corresponding path program 1 times [2019-09-08 13:16:26,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:26,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:26,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:26,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:26,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:27,001 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:16:27,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:27,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:16:27,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:16:27,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:16:27,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:16:27,004 INFO L87 Difference]: Start difference. First operand 104931 states and 165874 transitions. Second operand 3 states. [2019-09-08 13:16:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:16:41,767 INFO L93 Difference]: Finished difference Result 289049 states and 459149 transitions. [2019-09-08 13:16:41,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:16:41,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-09-08 13:16:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:16:42,077 INFO L225 Difference]: With dead ends: 289049 [2019-09-08 13:16:42,077 INFO L226 Difference]: Without dead ends: 197212 [2019-09-08 13:16:42,173 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:16:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197212 states. [2019-09-08 13:16:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197212 to 197210. [2019-09-08 13:16:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197210 states. [2019-09-08 13:16:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197210 states to 197210 states and 311397 transitions. [2019-09-08 13:16:57,959 INFO L78 Accepts]: Start accepts. Automaton has 197210 states and 311397 transitions. Word has length 264 [2019-09-08 13:16:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:57,959 INFO L475 AbstractCegarLoop]: Abstraction has 197210 states and 311397 transitions. [2019-09-08 13:16:57,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:16:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 197210 states and 311397 transitions. [2019-09-08 13:16:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 13:16:57,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:57,994 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] [2019-09-08 13:16:57,994 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:57,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:57,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2128014934, now seen corresponding path program 1 times [2019-09-08 13:16:57,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:57,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:57,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:57,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:57,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:58,469 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:16:58,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:58,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:16:58,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:16:58,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:16:58,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:16:58,471 INFO L87 Difference]: Start difference. First operand 197210 states and 311397 transitions. Second operand 4 states. [2019-09-08 13:17:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:25,262 INFO L93 Difference]: Finished difference Result 558197 states and 881364 transitions. [2019-09-08 13:17:25,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:17:25,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2019-09-08 13:17:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:25,888 INFO L225 Difference]: With dead ends: 558197 [2019-09-08 13:17:25,888 INFO L226 Difference]: Without dead ends: 361205 [2019-09-08 13:17:26,054 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:17:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361205 states. [2019-09-08 13:17:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361205 to 361203. [2019-09-08 13:17:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361203 states. [2019-09-08 13:17:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361203 states to 361203 states and 566999 transitions. [2019-09-08 13:17:56,983 INFO L78 Accepts]: Start accepts. Automaton has 361203 states and 566999 transitions. Word has length 264 [2019-09-08 13:17:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:56,983 INFO L475 AbstractCegarLoop]: Abstraction has 361203 states and 566999 transitions. [2019-09-08 13:17:56,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:17:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 361203 states and 566999 transitions. [2019-09-08 13:17:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 13:17:57,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:57,045 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] [2019-09-08 13:17:57,045 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:57,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1484801400, now seen corresponding path program 1 times [2019-09-08 13:17:57,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:57,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:57,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:57,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:57,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:57,265 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:17:57,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:57,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:17:57,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:17:57,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:17:57,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:57,267 INFO L87 Difference]: Start difference. First operand 361203 states and 566999 transitions. Second operand 3 states. [2019-09-08 13:18:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:54,724 INFO L93 Difference]: Finished difference Result 1063022 states and 1668382 transitions. [2019-09-08 13:18:54,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:54,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2019-09-08 13:18:54,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:55,955 INFO L225 Difference]: With dead ends: 1063022 [2019-09-08 13:18:55,955 INFO L226 Difference]: Without dead ends: 707294 [2019-09-08 13:18:56,272 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:18:56,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707294 states. [2019-09-08 13:20:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707294 to 706988. [2019-09-08 13:20:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706988 states. [2019-09-08 13:20:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706988 states to 706988 states and 1103639 transitions. [2019-09-08 13:20:07,864 INFO L78 Accepts]: Start accepts. Automaton has 706988 states and 1103639 transitions. Word has length 266 [2019-09-08 13:20:07,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:07,864 INFO L475 AbstractCegarLoop]: Abstraction has 706988 states and 1103639 transitions. [2019-09-08 13:20:07,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:20:07,864 INFO L276 IsEmpty]: Start isEmpty. Operand 706988 states and 1103639 transitions. [2019-09-08 13:20:07,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 13:20:07,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:07,980 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] [2019-09-08 13:20:07,980 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:07,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:07,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1322469474, now seen corresponding path program 1 times [2019-09-08 13:20:07,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:07,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:07,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:07,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:07,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:08,254 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:20:08,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:08,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:20:08,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:20:08,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:20:08,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:20:08,256 INFO L87 Difference]: Start difference. First operand 706988 states and 1103639 transitions. Second operand 4 states. [2019-09-08 13:21:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:52,663 INFO L93 Difference]: Finished difference Result 1878036 states and 2928997 transitions. [2019-09-08 13:21:52,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:21:52,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-09-08 13:21:52,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:55,024 INFO L225 Difference]: With dead ends: 1878036 [2019-09-08 13:21:55,024 INFO L226 Difference]: Without dead ends: 1196612 [2019-09-08 13:22:05,437 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:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196612 states. [2019-09-08 13:23:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196612 to 695350. [2019-09-08 13:23:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695350 states. [2019-09-08 13:23:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695350 states to 695350 states and 1085037 transitions. [2019-09-08 13:23:21,950 INFO L78 Accepts]: Start accepts. Automaton has 695350 states and 1085037 transitions. Word has length 267 [2019-09-08 13:23:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:23:21,951 INFO L475 AbstractCegarLoop]: Abstraction has 695350 states and 1085037 transitions. [2019-09-08 13:23:21,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:23:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 695350 states and 1085037 transitions. [2019-09-08 13:23:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 13:23:22,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:23:22,086 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] [2019-09-08 13:23:22,086 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:23:22,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:23:22,087 INFO L82 PathProgramCache]: Analyzing trace with hash 390277077, now seen corresponding path program 1 times [2019-09-08 13:23:22,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:23:22,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:23:22,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:23:22,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:23:22,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:23:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:23:23,466 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:23,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:23:23,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:23:23,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:23:23,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:23:23,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:23:23,468 INFO L87 Difference]: Start difference. First operand 695350 states and 1085037 transitions. Second operand 3 states. [2019-09-08 13:25:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:25:29,911 INFO L93 Difference]: Finished difference Result 2009721 states and 3135764 transitions. [2019-09-08 13:25:29,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:25:29,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-09-08 13:25:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:25:32,553 INFO L225 Difference]: With dead ends: 2009721 [2019-09-08 13:25:32,553 INFO L226 Difference]: Without dead ends: 1332453 [2019-09-08 13:25:33,137 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:25:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332453 states.