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_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:54:01,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:54:01,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:54:01,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:54:01,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:54:01,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:54:01,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:54:01,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:54:01,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:54:01,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:54:01,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:54:01,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:54:01,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:54:01,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:54:01,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:54:01,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:54:01,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:54:01,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:54:01,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:54:01,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:54:01,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:54:01,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:54:01,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:54:01,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:54:01,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:54:01,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:54:01,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:54:02,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:54:02,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:54:02,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:54:02,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:54:02,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:54:02,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:54:02,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:54:02,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:54:02,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:54:02,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:54:02,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:54:02,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:54:02,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:54:02,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:54:02,008 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 09:54:02,023 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:54:02,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:54:02,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:54:02,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:54:02,025 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:54:02,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:54:02,026 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:54:02,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:54:02,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:54:02,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:54:02,027 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:54:02,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:54:02,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:54:02,027 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:54:02,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:54:02,028 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:54:02,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:54:02,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:54:02,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:54:02,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:54:02,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:54:02,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:54:02,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:54:02,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:54:02,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:54:02,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:54:02,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:54:02,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:54:02,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:54:02,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:54:02,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:54:02,081 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:54:02,082 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:54:02,083 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:54:02,084 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:54:02,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96687ef7a/2fa540c3767a415ebade59e50a8aa7ea/FLAGd03a2349c [2019-09-08 09:54:02,751 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:54:02,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:54:02,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96687ef7a/2fa540c3767a415ebade59e50a8aa7ea/FLAGd03a2349c [2019-09-08 09:54:03,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96687ef7a/2fa540c3767a415ebade59e50a8aa7ea [2019-09-08 09:54:03,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:54:03,045 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:54:03,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:54:03,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:54:03,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:54:03,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:54:03" (1/1) ... [2019-09-08 09:54:03,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f32035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:03, skipping insertion in model container [2019-09-08 09:54:03,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:54:03" (1/1) ... [2019-09-08 09:54:03,062 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:54:03,170 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:54:04,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:54:04,123 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:54:04,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:54:04,601 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:54:04,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:04 WrapperNode [2019-09-08 09:54:04,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:54:04,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:54:04,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:54:04,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:54:04,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:04" (1/1) ... [2019-09-08 09:54:04,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:04" (1/1) ... [2019-09-08 09:54:04,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:04" (1/1) ... [2019-09-08 09:54:04,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:04" (1/1) ... [2019-09-08 09:54:04,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:04" (1/1) ... [2019-09-08 09:54:04,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:04" (1/1) ... [2019-09-08 09:54:04,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:04" (1/1) ... [2019-09-08 09:54:04,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:54:04,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:54:04,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:54:04,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:54:04,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:04" (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 09:54:04,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:54:04,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:54:04,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:54:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:54:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:54:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:54:04,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:54:04,828 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:54:04,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:54:04,828 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:54:04,828 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:54:04,828 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:54:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:54:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:54:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:54:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:54:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:54:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:54:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:54:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:54:07,392 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:54:07,392 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:54:07,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:54:07 BoogieIcfgContainer [2019-09-08 09:54:07,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:54:07,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:54:07,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:54:07,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:54:07,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:54:03" (1/3) ... [2019-09-08 09:54:07,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3677a936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:54:07, skipping insertion in model container [2019-09-08 09:54:07,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:04" (2/3) ... [2019-09-08 09:54:07,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3677a936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:54:07, skipping insertion in model container [2019-09-08 09:54:07,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:54:07" (3/3) ... [2019-09-08 09:54:07,403 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:54:07,415 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:54:07,428 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:54:07,448 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:54:07,488 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:54:07,489 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:54:07,489 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:54:07,489 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:54:07,489 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:54:07,490 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:54:07,490 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:54:07,490 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:54:07,490 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:54:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states. [2019-09-08 09:54:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:54:07,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:07,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:07,560 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:07,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:07,565 INFO L82 PathProgramCache]: Analyzing trace with hash 246150438, now seen corresponding path program 1 times [2019-09-08 09:54:07,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:07,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:07,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:07,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:08,669 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 09:54:08,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:08,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:08,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:08,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:08,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:08,699 INFO L87 Difference]: Start difference. First operand 737 states. Second operand 3 states. [2019-09-08 09:54:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:09,072 INFO L93 Difference]: Finished difference Result 1379 states and 2435 transitions. [2019-09-08 09:54:09,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:09,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 09:54:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:09,102 INFO L225 Difference]: With dead ends: 1379 [2019-09-08 09:54:09,102 INFO L226 Difference]: Without dead ends: 1185 [2019-09-08 09:54:09,109 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 09:54:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-09-08 09:54:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1183. [2019-09-08 09:54:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-09-08 09:54:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1830 transitions. [2019-09-08 09:54:09,244 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1830 transitions. Word has length 314 [2019-09-08 09:54:09,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:09,246 INFO L475 AbstractCegarLoop]: Abstraction has 1183 states and 1830 transitions. [2019-09-08 09:54:09,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:09,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1830 transitions. [2019-09-08 09:54:09,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:54:09,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:09,257 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:09,258 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:09,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:09,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1585474574, now seen corresponding path program 1 times [2019-09-08 09:54:09,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:09,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:09,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:09,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:09,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:10,006 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 09:54:10,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:10,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:10,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:10,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:10,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:10,020 INFO L87 Difference]: Start difference. First operand 1183 states and 1830 transitions. Second operand 3 states. [2019-09-08 09:54:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:10,286 INFO L93 Difference]: Finished difference Result 2327 states and 3625 transitions. [2019-09-08 09:54:10,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:10,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 09:54:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:10,300 INFO L225 Difference]: With dead ends: 2327 [2019-09-08 09:54:10,300 INFO L226 Difference]: Without dead ends: 2031 [2019-09-08 09:54:10,304 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 09:54:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2019-09-08 09:54:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2029. [2019-09-08 09:54:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2019-09-08 09:54:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3126 transitions. [2019-09-08 09:54:10,383 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3126 transitions. Word has length 314 [2019-09-08 09:54:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:10,385 INFO L475 AbstractCegarLoop]: Abstraction has 2029 states and 3126 transitions. [2019-09-08 09:54:10,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3126 transitions. [2019-09-08 09:54:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:54:10,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:10,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:10,395 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:10,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash -226150766, now seen corresponding path program 1 times [2019-09-08 09:54:10,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:10,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:10,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:10,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:10,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:11,252 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 09:54:11,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:11,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:11,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:11,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:11,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:11,255 INFO L87 Difference]: Start difference. First operand 2029 states and 3126 transitions. Second operand 4 states. [2019-09-08 09:54:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:11,591 INFO L93 Difference]: Finished difference Result 5993 states and 9229 transitions. [2019-09-08 09:54:11,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:11,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-08 09:54:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:11,620 INFO L225 Difference]: With dead ends: 5993 [2019-09-08 09:54:11,622 INFO L226 Difference]: Without dead ends: 3979 [2019-09-08 09:54:11,636 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 09:54:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2019-09-08 09:54:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3977. [2019-09-08 09:54:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3977 states. [2019-09-08 09:54:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 6092 transitions. [2019-09-08 09:54:11,869 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 6092 transitions. Word has length 314 [2019-09-08 09:54:11,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:11,870 INFO L475 AbstractCegarLoop]: Abstraction has 3977 states and 6092 transitions. [2019-09-08 09:54:11,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:11,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 6092 transitions. [2019-09-08 09:54:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 09:54:11,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:11,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:11,882 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:11,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:11,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1296301299, now seen corresponding path program 1 times [2019-09-08 09:54:11,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:11,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:11,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:11,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:11,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:12,054 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 09:54:12,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:12,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:12,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:12,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:12,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:12,057 INFO L87 Difference]: Start difference. First operand 3977 states and 6092 transitions. Second operand 3 states. [2019-09-08 09:54:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:12,445 INFO L93 Difference]: Finished difference Result 11886 states and 18205 transitions. [2019-09-08 09:54:12,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:12,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-08 09:54:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:12,490 INFO L225 Difference]: With dead ends: 11886 [2019-09-08 09:54:12,490 INFO L226 Difference]: Without dead ends: 7934 [2019-09-08 09:54:12,506 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 09:54:12,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7934 states. [2019-09-08 09:54:12,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7934 to 3990. [2019-09-08 09:54:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3990 states. [2019-09-08 09:54:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 6111 transitions. [2019-09-08 09:54:12,857 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 6111 transitions. Word has length 316 [2019-09-08 09:54:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:12,857 INFO L475 AbstractCegarLoop]: Abstraction has 3990 states and 6111 transitions. [2019-09-08 09:54:12,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 6111 transitions. [2019-09-08 09:54:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 09:54:12,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:12,870 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:12,870 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:12,870 INFO L82 PathProgramCache]: Analyzing trace with hash -95746744, now seen corresponding path program 1 times [2019-09-08 09:54:12,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:12,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:12,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:12,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:12,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:13,111 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 09:54:13,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:13,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:13,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:13,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:13,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:13,113 INFO L87 Difference]: Start difference. First operand 3990 states and 6111 transitions. Second operand 3 states. [2019-09-08 09:54:13,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:13,724 INFO L93 Difference]: Finished difference Result 11675 states and 17844 transitions. [2019-09-08 09:54:13,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:13,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-08 09:54:13,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:13,772 INFO L225 Difference]: With dead ends: 11675 [2019-09-08 09:54:13,772 INFO L226 Difference]: Without dead ends: 7827 [2019-09-08 09:54:13,790 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 09:54:13,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7827 states. [2019-09-08 09:54:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7827 to 7825. [2019-09-08 09:54:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7825 states. [2019-09-08 09:54:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7825 states to 7825 states and 11919 transitions. [2019-09-08 09:54:14,326 INFO L78 Accepts]: Start accepts. Automaton has 7825 states and 11919 transitions. Word has length 316 [2019-09-08 09:54:14,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:14,327 INFO L475 AbstractCegarLoop]: Abstraction has 7825 states and 11919 transitions. [2019-09-08 09:54:14,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 7825 states and 11919 transitions. [2019-09-08 09:54:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 09:54:14,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:14,357 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:14,358 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:14,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:14,358 INFO L82 PathProgramCache]: Analyzing trace with hash -836740616, now seen corresponding path program 1 times [2019-09-08 09:54:14,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:14,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:14,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:14,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:14,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:14,561 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 09:54:14,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:14,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:14,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:14,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:14,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:14,564 INFO L87 Difference]: Start difference. First operand 7825 states and 11919 transitions. Second operand 3 states. [2019-09-08 09:54:15,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:15,387 INFO L93 Difference]: Finished difference Result 23362 states and 35570 transitions. [2019-09-08 09:54:15,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:15,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-09-08 09:54:15,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:15,456 INFO L225 Difference]: With dead ends: 23362 [2019-09-08 09:54:15,456 INFO L226 Difference]: Without dead ends: 15597 [2019-09-08 09:54:15,481 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 09:54:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15597 states. [2019-09-08 09:54:16,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15597 to 7843. [2019-09-08 09:54:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7843 states. [2019-09-08 09:54:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7843 states to 7843 states and 11940 transitions. [2019-09-08 09:54:16,259 INFO L78 Accepts]: Start accepts. Automaton has 7843 states and 11940 transitions. Word has length 317 [2019-09-08 09:54:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:16,263 INFO L475 AbstractCegarLoop]: Abstraction has 7843 states and 11940 transitions. [2019-09-08 09:54:16,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 7843 states and 11940 transitions. [2019-09-08 09:54:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 09:54:16,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:16,282 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:16,282 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:16,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:16,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1256830877, now seen corresponding path program 1 times [2019-09-08 09:54:16,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:16,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:16,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:16,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:16,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:16,591 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 09:54:16,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:16,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:16,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:16,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:16,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:16,593 INFO L87 Difference]: Start difference. First operand 7843 states and 11940 transitions. Second operand 3 states. [2019-09-08 09:54:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:17,266 INFO L93 Difference]: Finished difference Result 22902 states and 34781 transitions. [2019-09-08 09:54:17,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:17,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 09:54:17,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:17,308 INFO L225 Difference]: With dead ends: 22902 [2019-09-08 09:54:17,308 INFO L226 Difference]: Without dead ends: 15304 [2019-09-08 09:54:17,331 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 09:54:17,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15304 states. [2019-09-08 09:54:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15304 to 15302. [2019-09-08 09:54:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15302 states. [2019-09-08 09:54:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15302 states to 15302 states and 23140 transitions. [2019-09-08 09:54:18,789 INFO L78 Accepts]: Start accepts. Automaton has 15302 states and 23140 transitions. Word has length 318 [2019-09-08 09:54:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:18,789 INFO L475 AbstractCegarLoop]: Abstraction has 15302 states and 23140 transitions. [2019-09-08 09:54:18,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 15302 states and 23140 transitions. [2019-09-08 09:54:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 09:54:18,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:18,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:18,825 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:18,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:18,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1023571840, now seen corresponding path program 1 times [2019-09-08 09:54:18,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:18,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:18,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:18,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:18,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:19,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:19,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:19,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:19,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:19,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:19,235 INFO L87 Difference]: Start difference. First operand 15302 states and 23140 transitions. Second operand 4 states. [2019-09-08 09:54:20,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:20,580 INFO L93 Difference]: Finished difference Result 43245 states and 65177 transitions. [2019-09-08 09:54:20,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:20,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-08 09:54:20,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:20,651 INFO L225 Difference]: With dead ends: 43245 [2019-09-08 09:54:20,651 INFO L226 Difference]: Without dead ends: 28483 [2019-09-08 09:54:20,686 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 09:54:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28483 states. [2019-09-08 09:54:21,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28483 to 15537. [2019-09-08 09:54:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15537 states. [2019-09-08 09:54:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15537 states to 15537 states and 23528 transitions. [2019-09-08 09:54:21,546 INFO L78 Accepts]: Start accepts. Automaton has 15537 states and 23528 transitions. Word has length 318 [2019-09-08 09:54:21,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:21,547 INFO L475 AbstractCegarLoop]: Abstraction has 15537 states and 23528 transitions. [2019-09-08 09:54:21,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 15537 states and 23528 transitions. [2019-09-08 09:54:21,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 09:54:21,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:21,580 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:21,580 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:21,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:21,581 INFO L82 PathProgramCache]: Analyzing trace with hash 89752151, now seen corresponding path program 1 times [2019-09-08 09:54:21,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:21,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:21,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:21,868 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 09:54:21,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:21,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:21,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:21,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:21,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:21,870 INFO L87 Difference]: Start difference. First operand 15537 states and 23528 transitions. Second operand 3 states. [2019-09-08 09:54:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:23,336 INFO L93 Difference]: Finished difference Result 45041 states and 67865 transitions. [2019-09-08 09:54:23,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:23,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 09:54:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:23,393 INFO L225 Difference]: With dead ends: 45041 [2019-09-08 09:54:23,394 INFO L226 Difference]: Without dead ends: 30307 [2019-09-08 09:54:23,438 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 09:54:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30307 states. [2019-09-08 09:54:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30307 to 15641. [2019-09-08 09:54:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15641 states. [2019-09-08 09:54:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15641 states to 15641 states and 23671 transitions. [2019-09-08 09:54:25,044 INFO L78 Accepts]: Start accepts. Automaton has 15641 states and 23671 transitions. Word has length 320 [2019-09-08 09:54:25,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:25,044 INFO L475 AbstractCegarLoop]: Abstraction has 15641 states and 23671 transitions. [2019-09-08 09:54:25,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 15641 states and 23671 transitions. [2019-09-08 09:54:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 09:54:25,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:25,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:25,078 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:25,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:25,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2119611222, now seen corresponding path program 1 times [2019-09-08 09:54:25,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:25,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:25,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:25,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:25,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:25,224 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 09:54:25,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:25,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:25,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:25,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:25,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:25,227 INFO L87 Difference]: Start difference. First operand 15641 states and 23671 transitions. Second operand 3 states. [2019-09-08 09:54:26,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:26,394 INFO L93 Difference]: Finished difference Result 45173 states and 68031 transitions. [2019-09-08 09:54:26,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:26,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-08 09:54:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:26,454 INFO L225 Difference]: With dead ends: 45173 [2019-09-08 09:54:26,454 INFO L226 Difference]: Without dead ends: 30432 [2019-09-08 09:54:26,480 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 09:54:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30432 states. [2019-09-08 09:54:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30432 to 15766. [2019-09-08 09:54:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15766 states. [2019-09-08 09:54:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15766 states to 15766 states and 23817 transitions. [2019-09-08 09:54:27,340 INFO L78 Accepts]: Start accepts. Automaton has 15766 states and 23817 transitions. Word has length 321 [2019-09-08 09:54:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:27,340 INFO L475 AbstractCegarLoop]: Abstraction has 15766 states and 23817 transitions. [2019-09-08 09:54:27,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 15766 states and 23817 transitions. [2019-09-08 09:54:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 09:54:27,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:27,363 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:54:27,363 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:27,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:27,363 INFO L82 PathProgramCache]: Analyzing trace with hash -289045942, now seen corresponding path program 1 times [2019-09-08 09:54:27,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:27,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:27,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:27,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:27,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:27,738 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 09:54:27,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:27,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:27,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:27,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:27,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:27,742 INFO L87 Difference]: Start difference. First operand 15766 states and 23817 transitions. Second operand 4 states. [2019-09-08 09:54:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:28,323 INFO L93 Difference]: Finished difference Result 28797 states and 43357 transitions. [2019-09-08 09:54:28,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:28,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-08 09:54:28,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:28,351 INFO L225 Difference]: With dead ends: 28797 [2019-09-08 09:54:28,352 INFO L226 Difference]: Without dead ends: 13894 [2019-09-08 09:54:28,381 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 09:54:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13894 states. [2019-09-08 09:54:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13894 to 13874. [2019-09-08 09:54:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13874 states. [2019-09-08 09:54:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13874 states to 13874 states and 20957 transitions. [2019-09-08 09:54:29,265 INFO L78 Accepts]: Start accepts. Automaton has 13874 states and 20957 transitions. Word has length 322 [2019-09-08 09:54:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:29,266 INFO L475 AbstractCegarLoop]: Abstraction has 13874 states and 20957 transitions. [2019-09-08 09:54:29,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 13874 states and 20957 transitions. [2019-09-08 09:54:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 09:54:29,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:29,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:29,279 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:29,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:29,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1431049473, now seen corresponding path program 1 times [2019-09-08 09:54:29,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:29,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:29,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:29,477 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 09:54:29,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:29,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:29,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:29,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:29,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:29,480 INFO L87 Difference]: Start difference. First operand 13874 states and 20957 transitions. Second operand 3 states. [2019-09-08 09:54:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:31,363 INFO L93 Difference]: Finished difference Result 37555 states and 56492 transitions. [2019-09-08 09:54:31,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:31,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 09:54:31,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:31,397 INFO L225 Difference]: With dead ends: 37555 [2019-09-08 09:54:31,397 INFO L226 Difference]: Without dead ends: 25375 [2019-09-08 09:54:31,416 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 09:54:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25375 states. [2019-09-08 09:54:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25375 to 25373. [2019-09-08 09:54:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25373 states. [2019-09-08 09:54:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25373 states to 25373 states and 37971 transitions. [2019-09-08 09:54:32,619 INFO L78 Accepts]: Start accepts. Automaton has 25373 states and 37971 transitions. Word has length 326 [2019-09-08 09:54:32,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:32,620 INFO L475 AbstractCegarLoop]: Abstraction has 25373 states and 37971 transitions. [2019-09-08 09:54:32,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 25373 states and 37971 transitions. [2019-09-08 09:54:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 09:54:32,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:32,638 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:32,638 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:32,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:32,639 INFO L82 PathProgramCache]: Analyzing trace with hash 244300407, now seen corresponding path program 1 times [2019-09-08 09:54:32,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:32,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:32,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:32,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:32,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:32,961 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 09:54:32,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:32,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:54:32,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:54:32,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:54:32,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:54:32,964 INFO L87 Difference]: Start difference. First operand 25373 states and 37971 transitions. Second operand 5 states. [2019-09-08 09:54:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:34,177 INFO L93 Difference]: Finished difference Result 33619 states and 50715 transitions. [2019-09-08 09:54:34,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:54:34,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 326 [2019-09-08 09:54:34,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:34,198 INFO L225 Difference]: With dead ends: 33619 [2019-09-08 09:54:34,198 INFO L226 Difference]: Without dead ends: 13874 [2019-09-08 09:54:34,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:54:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13874 states. [2019-09-08 09:54:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13874 to 13874. [2019-09-08 09:54:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13874 states. [2019-09-08 09:54:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13874 states to 13874 states and 20723 transitions. [2019-09-08 09:54:35,052 INFO L78 Accepts]: Start accepts. Automaton has 13874 states and 20723 transitions. Word has length 326 [2019-09-08 09:54:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:35,053 INFO L475 AbstractCegarLoop]: Abstraction has 13874 states and 20723 transitions. [2019-09-08 09:54:35,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:54:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 13874 states and 20723 transitions. [2019-09-08 09:54:35,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 09:54:35,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:35,069 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:35,069 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:35,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:35,069 INFO L82 PathProgramCache]: Analyzing trace with hash -373051514, now seen corresponding path program 1 times [2019-09-08 09:54:35,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:35,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:35,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:35,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:35,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:35,558 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 09:54:35,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:35,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:35,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:35,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:35,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:35,560 INFO L87 Difference]: Start difference. First operand 13874 states and 20723 transitions. Second operand 4 states. [2019-09-08 09:54:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:36,884 INFO L93 Difference]: Finished difference Result 29960 states and 45313 transitions. [2019-09-08 09:54:36,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:36,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-08 09:54:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:36,922 INFO L225 Difference]: With dead ends: 29960 [2019-09-08 09:54:36,922 INFO L226 Difference]: Without dead ends: 25406 [2019-09-08 09:54:36,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25406 states. [2019-09-08 09:54:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25406 to 25404. [2019-09-08 09:54:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25404 states. [2019-09-08 09:54:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25404 states to 25404 states and 37829 transitions. [2019-09-08 09:54:38,178 INFO L78 Accepts]: Start accepts. Automaton has 25404 states and 37829 transitions. Word has length 326 [2019-09-08 09:54:38,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:38,178 INFO L475 AbstractCegarLoop]: Abstraction has 25404 states and 37829 transitions. [2019-09-08 09:54:38,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25404 states and 37829 transitions. [2019-09-08 09:54:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 09:54:38,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:38,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:38,203 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:38,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1629663082, now seen corresponding path program 1 times [2019-09-08 09:54:38,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:38,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:38,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:38,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:38,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:38,916 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 09:54:38,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:38,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:38,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:38,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:38,918 INFO L87 Difference]: Start difference. First operand 25404 states and 37829 transitions. Second operand 4 states. [2019-09-08 09:54:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:41,720 INFO L93 Difference]: Finished difference Result 74934 states and 111591 transitions. [2019-09-08 09:54:41,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:41,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-08 09:54:41,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:41,783 INFO L225 Difference]: With dead ends: 74934 [2019-09-08 09:54:41,783 INFO L226 Difference]: Without dead ends: 49602 [2019-09-08 09:54:41,811 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 09:54:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49602 states. [2019-09-08 09:54:45,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49602 to 49600. [2019-09-08 09:54:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49600 states. [2019-09-08 09:54:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49600 states to 49600 states and 73457 transitions. [2019-09-08 09:54:45,407 INFO L78 Accepts]: Start accepts. Automaton has 49600 states and 73457 transitions. Word has length 326 [2019-09-08 09:54:45,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:45,407 INFO L475 AbstractCegarLoop]: Abstraction has 49600 states and 73457 transitions. [2019-09-08 09:54:45,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 49600 states and 73457 transitions. [2019-09-08 09:54:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 09:54:45,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:45,439 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:45,439 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:45,440 INFO L82 PathProgramCache]: Analyzing trace with hash 980797981, now seen corresponding path program 1 times [2019-09-08 09:54:45,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:45,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:45,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:45,655 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 09:54:45,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:45,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:45,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:45,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:45,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:45,659 INFO L87 Difference]: Start difference. First operand 49600 states and 73457 transitions. Second operand 3 states. [2019-09-08 09:54:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:51,570 INFO L93 Difference]: Finished difference Result 145188 states and 214387 transitions. [2019-09-08 09:54:51,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:51,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-08 09:54:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:51,681 INFO L225 Difference]: With dead ends: 145188 [2019-09-08 09:54:51,681 INFO L226 Difference]: Without dead ends: 96837 [2019-09-08 09:54:51,727 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 09:54:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96837 states. [2019-09-08 09:54:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96837 to 96835. [2019-09-08 09:54:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96835 states. [2019-09-08 09:54:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96835 states to 96835 states and 142254 transitions. [2019-09-08 09:54:57,058 INFO L78 Accepts]: Start accepts. Automaton has 96835 states and 142254 transitions. Word has length 328 [2019-09-08 09:54:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:57,058 INFO L475 AbstractCegarLoop]: Abstraction has 96835 states and 142254 transitions. [2019-09-08 09:54:57,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 96835 states and 142254 transitions. [2019-09-08 09:54:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 09:54:57,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:57,124 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:57,125 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:57,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1499003912, now seen corresponding path program 1 times [2019-09-08 09:54:57,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:57,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:57,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:57,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:57,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:57,382 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 09:54:57,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:57,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:57,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:57,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:57,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:57,385 INFO L87 Difference]: Start difference. First operand 96835 states and 142254 transitions. Second operand 3 states. [2019-09-08 09:55:07,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:07,987 INFO L93 Difference]: Finished difference Result 285172 states and 418090 transitions. [2019-09-08 09:55:07,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:55:07,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 09:55:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:08,222 INFO L225 Difference]: With dead ends: 285172 [2019-09-08 09:55:08,222 INFO L226 Difference]: Without dead ends: 189684 [2019-09-08 09:55:08,305 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 09:55:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189684 states. [2019-09-08 09:55:21,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189684 to 189682. [2019-09-08 09:55:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189682 states. [2019-09-08 09:55:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189682 states to 189682 states and 276507 transitions. [2019-09-08 09:55:21,876 INFO L78 Accepts]: Start accepts. Automaton has 189682 states and 276507 transitions. Word has length 330 [2019-09-08 09:55:21,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:21,876 INFO L475 AbstractCegarLoop]: Abstraction has 189682 states and 276507 transitions. [2019-09-08 09:55:21,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:55:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 189682 states and 276507 transitions. [2019-09-08 09:55:22,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 09:55:22,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:22,017 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:22,018 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:22,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:22,018 INFO L82 PathProgramCache]: Analyzing trace with hash 307016405, now seen corresponding path program 1 times [2019-09-08 09:55:22,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:22,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:22,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:22,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:22,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:22,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:22,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:55:22,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:55:22,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:55:22,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:55:22,384 INFO L87 Difference]: Start difference. First operand 189682 states and 276507 transitions. Second operand 4 states. [2019-09-08 09:55:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:42,750 INFO L93 Difference]: Finished difference Result 505501 states and 735049 transitions. [2019-09-08 09:55:42,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:55:42,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-09-08 09:55:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:43,147 INFO L225 Difference]: With dead ends: 505501 [2019-09-08 09:55:43,147 INFO L226 Difference]: Without dead ends: 319111 [2019-09-08 09:55:43,321 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 09:55:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319111 states. [2019-09-08 09:56:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319111 to 183931. [2019-09-08 09:56:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183931 states. [2019-09-08 09:56:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183931 states to 183931 states and 268034 transitions. [2019-09-08 09:56:03,630 INFO L78 Accepts]: Start accepts. Automaton has 183931 states and 268034 transitions. Word has length 330 [2019-09-08 09:56:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:03,631 INFO L475 AbstractCegarLoop]: Abstraction has 183931 states and 268034 transitions. [2019-09-08 09:56:03,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:56:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 183931 states and 268034 transitions. [2019-09-08 09:56:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 09:56:03,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:03,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:03,757 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:03,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:03,758 INFO L82 PathProgramCache]: Analyzing trace with hash -709613371, now seen corresponding path program 1 times [2019-09-08 09:56:03,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:03,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:03,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:03,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:03,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:03,901 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 09:56:03,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:03,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:56:03,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:56:03,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:56:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:56:03,903 INFO L87 Difference]: Start difference. First operand 183931 states and 268034 transitions. Second operand 3 states. [2019-09-08 09:56:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:29,476 INFO L93 Difference]: Finished difference Result 500933 states and 728469 transitions. [2019-09-08 09:56:29,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:56:29,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-09-08 09:56:29,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:29,926 INFO L225 Difference]: With dead ends: 500933 [2019-09-08 09:56:29,926 INFO L226 Difference]: Without dead ends: 328031 [2019-09-08 09:56:30,069 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 09:56:30,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328031 states. [2019-09-08 09:56:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328031 to 184412. [2019-09-08 09:56:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184412 states. [2019-09-08 09:56:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184412 states to 184412 states and 268632 transitions. [2019-09-08 09:56:44,804 INFO L78 Accepts]: Start accepts. Automaton has 184412 states and 268632 transitions. Word has length 333 [2019-09-08 09:56:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:44,805 INFO L475 AbstractCegarLoop]: Abstraction has 184412 states and 268632 transitions. [2019-09-08 09:56:44,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:56:44,805 INFO L276 IsEmpty]: Start isEmpty. Operand 184412 states and 268632 transitions. [2019-09-08 09:56:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 09:56:44,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:44,946 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:44,946 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:44,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:44,946 INFO L82 PathProgramCache]: Analyzing trace with hash -338182756, now seen corresponding path program 1 times [2019-09-08 09:56:44,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:44,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:44,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:44,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:44,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:45,257 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 09:56:45,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:45,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:56:45,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:56:45,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:56:45,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:56:45,260 INFO L87 Difference]: Start difference. First operand 184412 states and 268632 transitions. Second operand 4 states. [2019-09-08 09:57:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:00,681 INFO L93 Difference]: Finished difference Result 344339 states and 500623 transitions. [2019-09-08 09:57:00,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:57:00,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2019-09-08 09:57:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:00,862 INFO L225 Difference]: With dead ends: 344339 [2019-09-08 09:57:00,863 INFO L226 Difference]: Without dead ends: 165239 [2019-09-08 09:57:00,965 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 09:57:01,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165239 states. [2019-09-08 09:57:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165239 to 164912. [2019-09-08 09:57:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164912 states. [2019-09-08 09:57:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164912 states to 164912 states and 239930 transitions. [2019-09-08 09:57:12,635 INFO L78 Accepts]: Start accepts. Automaton has 164912 states and 239930 transitions. Word has length 334 [2019-09-08 09:57:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:12,635 INFO L475 AbstractCegarLoop]: Abstraction has 164912 states and 239930 transitions. [2019-09-08 09:57:12,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:57:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 164912 states and 239930 transitions. [2019-09-08 09:57:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-08 09:57:12,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:12,759 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:12,759 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:12,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:12,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1093412469, now seen corresponding path program 1 times [2019-09-08 09:57:12,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:12,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:12,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:12,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:13,220 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 09:57:13,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:57:13,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:57:13,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:57:13,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:57:13,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:57:13,222 INFO L87 Difference]: Start difference. First operand 164912 states and 239930 transitions. Second operand 8 states. [2019-09-08 09:57:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:35,811 INFO L93 Difference]: Finished difference Result 369876 states and 546608 transitions. [2019-09-08 09:57:35,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:57:35,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 338 [2019-09-08 09:57:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:36,199 INFO L225 Difference]: With dead ends: 369876 [2019-09-08 09:57:36,199 INFO L226 Difference]: Without dead ends: 314082 [2019-09-08 09:57:36,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:57:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314082 states. [2019-09-08 09:58:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314082 to 314080. [2019-09-08 09:58:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314080 states. [2019-09-08 09:58:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314080 states to 314080 states and 456142 transitions. [2019-09-08 09:58:11,407 INFO L78 Accepts]: Start accepts. Automaton has 314080 states and 456142 transitions. Word has length 338 [2019-09-08 09:58:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:58:11,408 INFO L475 AbstractCegarLoop]: Abstraction has 314080 states and 456142 transitions. [2019-09-08 09:58:11,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:58:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 314080 states and 456142 transitions. [2019-09-08 09:58:12,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-08 09:58:12,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:58:12,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:58:12,568 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:58:12,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:58:12,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1015113787, now seen corresponding path program 1 times [2019-09-08 09:58:12,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:58:12,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:58:12,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:58:12,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:58:12,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:58:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:58:12,930 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 09:58:12,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:58:12,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:58:12,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:58:12,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:58:12,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:58:12,931 INFO L87 Difference]: Start difference. First operand 314080 states and 456142 transitions. Second operand 6 states. [2019-09-08 09:58:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:58:51,209 INFO L93 Difference]: Finished difference Result 510454 states and 774763 transitions. [2019-09-08 09:58:51,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:58:51,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 338 [2019-09-08 09:58:51,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:58:51,902 INFO L225 Difference]: With dead ends: 510454 [2019-09-08 09:58:51,902 INFO L226 Difference]: Without dead ends: 487308 [2019-09-08 09:58:52,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:58:53,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487308 states. [2019-09-08 09:59:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487308 to 348724. [2019-09-08 09:59:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348724 states. [2019-09-08 09:59:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348724 states to 348724 states and 511990 transitions. [2019-09-08 09:59:30,191 INFO L78 Accepts]: Start accepts. Automaton has 348724 states and 511990 transitions. Word has length 338 [2019-09-08 09:59:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:30,192 INFO L475 AbstractCegarLoop]: Abstraction has 348724 states and 511990 transitions. [2019-09-08 09:59:30,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:59:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 348724 states and 511990 transitions. [2019-09-08 09:59:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-08 09:59:30,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:30,416 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:59:30,416 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:30,417 INFO L82 PathProgramCache]: Analyzing trace with hash 772196443, now seen corresponding path program 1 times [2019-09-08 09:59:30,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:30,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:30,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:30,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:30,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:30,984 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 09:59:30,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:30,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 09:59:30,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 09:59:30,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 09:59:30,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 09:59:30,986 INFO L87 Difference]: Start difference. First operand 348724 states and 511990 transitions. Second operand 14 states. [2019-09-08 10:00:56,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:00:56,753 INFO L93 Difference]: Finished difference Result 931147 states and 1386960 transitions. [2019-09-08 10:00:56,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:00:56,754 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 338 [2019-09-08 10:00:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:00:58,784 INFO L225 Difference]: With dead ends: 931147 [2019-09-08 10:00:58,784 INFO L226 Difference]: Without dead ends: 847137 [2019-09-08 10:00:59,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 10:00:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847137 states. [2019-09-08 10:01:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847137 to 377576. [2019-09-08 10:01:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377576 states. [2019-09-08 10:01:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377576 states to 377576 states and 551066 transitions. [2019-09-08 10:01:57,307 INFO L78 Accepts]: Start accepts. Automaton has 377576 states and 551066 transitions. Word has length 338 [2019-09-08 10:01:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:01:57,308 INFO L475 AbstractCegarLoop]: Abstraction has 377576 states and 551066 transitions. [2019-09-08 10:01:57,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 10:01:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 377576 states and 551066 transitions. [2019-09-08 10:01:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-08 10:01:57,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:01:57,577 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:01:57,577 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:01:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:01:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash 133289292, now seen corresponding path program 1 times [2019-09-08 10:01:57,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:01:57,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:01:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:01:57,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:01:57,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:01:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:01:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:01:59,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:01:59,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 10:01:59,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 10:01:59,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 10:01:59,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 10:01:59,140 INFO L87 Difference]: Start difference. First operand 377576 states and 551066 transitions. Second operand 16 states. [2019-09-08 10:03:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:34,385 INFO L93 Difference]: Finished difference Result 881786 states and 1319056 transitions. [2019-09-08 10:03:34,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 10:03:34,385 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 338 [2019-09-08 10:03:34,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:35,754 INFO L225 Difference]: With dead ends: 881786 [2019-09-08 10:03:35,754 INFO L226 Difference]: Without dead ends: 827408 [2019-09-08 10:03:35,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=448, Invalid=1274, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 10:03:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827408 states. [2019-09-08 10:04:43,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827408 to 454080. [2019-09-08 10:04:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454080 states. [2019-09-08 10:04:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454080 states to 454080 states and 654550 transitions. [2019-09-08 10:04:44,177 INFO L78 Accepts]: Start accepts. Automaton has 454080 states and 654550 transitions. Word has length 338 [2019-09-08 10:04:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:44,178 INFO L475 AbstractCegarLoop]: Abstraction has 454080 states and 654550 transitions. [2019-09-08 10:04:44,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 10:04:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 454080 states and 654550 transitions. [2019-09-08 10:04:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-08 10:04:45,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:45,282 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:04:45,282 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash -109628052, now seen corresponding path program 1 times [2019-09-08 10:04:45,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:45,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:45,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:45,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:45,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:04:45,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:45,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:04:45,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:04:45,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:04:45,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:04:45,893 INFO L87 Difference]: Start difference. First operand 454080 states and 654550 transitions. Second operand 4 states.